git.iko.soy/streamly
on master help sign in
swap
30c5a561277 ahead, 0 behind
463 files changed+69443−35777
since splitsnapshots
unifiedsplit
.circleci/config.yml+75−278 .github/workflows/haskell.yml+128−98 .github/workflows/packdiff.yml+39 .github/workflows/regression-check.yml+54−46 .hlint.ignore+12−23 .hlint.yaml+6−7 .packcheck.ignore+12−1 CHANGELOG.md+1−1 LICENSE−254 README.md+1−1 appveyor.yml+2 benchmark/NanoBenchmarks.hs+27−22 benchmark/Streamly/Benchmark/Data/Array.hs+33−4 benchmark/Streamly/Benchmark/Data/Array/Common.hs+8−11 benchmark/Streamly/Benchmark/Data/Array/CommonImports.hs+7−8 benchmark/Streamly/Benchmark/Data/Array/Foreign/Mut.hs−94 benchmark/Streamly/Benchmark/Data/Array/Foreign.hs → benchmark/Streamly/Benchmark/Data/Array/Generic.hs+15−28 benchmark/Streamly/Benchmark/Data/Array/Prim.hs−57 benchmark/Streamly/Benchmark/Data/Array/Prim/Pinned.hs−57 benchmark/Streamly/Benchmark/Data/Array/SmallArray.hs+2 benchmark/Streamly/Benchmark/Data/Array/Stream/Foreign.hs → benchmark/Streamly/Benchmark/Data/Array/Stream.hs+80−44 benchmark/Streamly/Benchmark/Data/Fold.hs+244−196 benchmark/Streamly/Benchmark/Data/Fold/Window.hs+116−59 benchmark/Streamly/Benchmark/Data/MutArray.hs+300 benchmark/Streamly/Benchmark/Data/Parser.hs+642−189 benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs−417 benchmark/Streamly/Benchmark/Data/Parser/ParserK.hs−163 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/Prelude/Serial/Elimination.hs → benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hs+183−121 benchmark/Streamly/Benchmark/Prelude/Serial/Exceptions.hs → benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hs+124−70 benchmark/Streamly/Benchmark/Prelude/Serial/NestedStream.hs → benchmark/Streamly/Benchmark/Data/Stream/Expand.hs+217−156 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/Prelude/Serial/Split.hs → benchmark/Streamly/Benchmark/Data/Stream/Split.hs+25−12 benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+46−5 benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs+61−33 benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs → benchmark/Streamly/Benchmark/Data/Stream/StreamKAlt.hs+5−3 benchmark/Streamly/Benchmark/Data/Stream/ToStreamK.hs+938 benchmark/Streamly/Benchmark/Prelude/Serial/Transformation.hs → benchmark/Streamly/Benchmark/Data/Stream/Transform.hs+284−173 benchmark/Streamly/Benchmark/Data/Unfold.hs+46−36 benchmark/Streamly/Benchmark/FileSystem/Handle.hs+1−1 benchmark/Streamly/Benchmark/FileSystem/Handle/Read.hs+60−52 benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+26−26 benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+11−6 benchmark/Streamly/Benchmark/Prelude/Ahead.hs+3−1 benchmark/Streamly/Benchmark/Prelude/Async.hs+5−3 benchmark/Streamly/Benchmark/Prelude/Concurrent.hs+2−1 benchmark/Streamly/Benchmark/Prelude/Merge.hs+4−2 benchmark/Streamly/Benchmark/Prelude/Parallel.hs+3−1 benchmark/Streamly/Benchmark/Prelude/Rate.hs+2−1 benchmark/Streamly/Benchmark/Prelude/Serial.hs−53 benchmark/Streamly/Benchmark/Prelude/Serial/Generation.hs−179 benchmark/Streamly/Benchmark/Prelude/Serial/Lift.hs−123 benchmark/Streamly/Benchmark/Prelude/Serial/NestedFold.hs−487 benchmark/Streamly/Benchmark/Prelude/WAsync.hs+3−1 benchmark/Streamly/Benchmark/Prelude/WSerial.hs+4−2 benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+11−2 benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs+4−2 benchmark/Streamly/Benchmark/Unicode/Char.hs+18−10 benchmark/Streamly/Benchmark/Unicode/Parser.hs+107 benchmark/Streamly/Benchmark/Unicode/Stream.hs+60−34 benchmark/Streamly/Benchmark/Unicode/Utf8.hs+3−3 benchmark/bench-report/BenchReport.hs−272 benchmark/bench-report/bench-report.cabal−23 benchmark/bench-report/bin/bench-runner.sh−685 benchmark/bench-report/bin/build-lib.sh−218 benchmark/bench-report/default.nix−55 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+11−6 benchmark/lib/Streamly/Benchmark/Common/Handle.hs+12−1 benchmark/lib/Streamly/Benchmark/Prelude.hs+3−1 benchmark/streamly-benchmarks.cabal+396−172 bin/bench-config.sh−160 bin/bench.sh−15 bin/mk-hscope.sh+1−1 bin/repl+3 bin/run-ci.sh+28−28 bin/run-repl-quick.sh+1−1 bin/targets.sh−120 bin/test.sh−247 cabal.project.O0+4−4 cabal.project.Werror-nocode+7−3 cabal.project.doctest+10−4 cabal.project.ghc-head+9−1 cabal.project.packdiff+9 cabal.project.report+30 cabal.project.streamly+10 configure+9−9 configure.ac+1−1 core/Changelog.md+1 core/LICENSE+322 core/configure+9−9 core/configure.ac+1−1 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 src/Streamly/Console/Stdio.hs → core/src/Streamly/Console/Stdio.hs+3−4 core/src/Streamly/Data/Array.hs+167 core/src/Streamly/Data/Array/Generic.hs+51 core/src/Streamly/Data/Fold.hs+195−69 core/src/Streamly/Data/Fold/Tee.hs−41 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 src/Streamly/FileSystem/Handle.hs → core/src/Streamly/FileSystem/Handle.hs+26−11 src/Streamly/Internal/Console/Stdio.hs → core/src/Streamly/Internal/Console/Stdio.hs+44−45 core/src/Streamly/Internal/Control/Exception.hs+1−13 core/src/Streamly/Internal/Data/Array.hs+945−261 core/src/Streamly/Internal/Data/Array/ArrayMacros.h+24−8 core/src/Streamly/Internal/Data/Array/Foreign.hs−581 core/src/Streamly/Internal/Data/Array/Foreign/Mut.hs−103 core/src/Streamly/Internal/Data/Array/Foreign/Mut/Type.hs−2365 core/src/Streamly/Internal/Data/Array/Foreign/Type.hs−823 core/src/Streamly/Internal/Data/Array/Generic.hs+342 core/src/Streamly/Internal/Data/Array/Mut/Type.hs−570 core/src/Streamly/Internal/Data/Array/Stream.hs+725 core/src/Streamly/Internal/Data/Array/Stream/Mut/Foreign.hs−326 core/src/Streamly/Internal/Data/Array/Type.hs+1148 src/Streamly/Internal/Data/Binary/Decode.hs → core/src/Streamly/Internal/Data/Binary/Parser.hs+164−42 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+2 core/src/Streamly/Internal/Data/Fold.hs+15−2076 core/src/Streamly/Internal/Data/Array/Stream/Fold/Foreign.hs → core/src/Streamly/Internal/Data/Fold/Chunked.hs+119−86 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+2−2 core/src/Streamly/Internal/Data/Fold/Tee.hs+33−6 core/src/Streamly/Internal/Data/Fold/Type.hs+850−298 core/src/Streamly/Internal/Data/Fold/Window.hs+148−144 core/src/Streamly/Internal/Data/IOFinalizer.hs+20−21 core/src/Streamly/Internal/Data/IORef/Prim.hs → core/src/Streamly/Internal/Data/IORef/Unboxed.hs+36−35 core/src/Streamly/Internal/Data/IsMap.hs+8−13 core/src/Streamly/Internal/Data/List.hs+115−66 core/src/Streamly/Internal/Data/Maybe/Strict.hs+9 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+3017−577 core/src/Streamly/Internal/Data/Parser/ParserD.hs−1254 core/src/Streamly/Internal/Data/Parser/ParserK/Type.hs−319 core/src/Streamly/Internal/Data/Parser/ParserD/Tee.hs → core/src/Streamly/Internal/Data/Parser/Tee.hs+10−6 core/src/Streamly/Internal/Data/Parser/ParserD/Type.hs → core/src/Streamly/Internal/Data/Parser/Type.hs+544−493 core/src/Streamly/Internal/Data/ParserK.hs+16 core/src/Streamly/Internal/Data/ParserK/Type.hs+752 core/src/Streamly/Internal/Data/Pipe.hs+12−1707 core/src/Streamly/Internal/Data/Pipe/Type.hs−3 core/src/Streamly/Internal/Data/Producer.hs+6−13 core/src/Streamly/Internal/Data/Producer/Source.hs+101−35 core/src/Streamly/Internal/Data/Producer/Type.hs+1−1 core/src/Streamly/Internal/Data/Refold/Type.hs+5−6 core/src/Streamly/Internal/Data/Ring.hs+603−28 core/src/Streamly/Internal/Data/Ring/Foreign.hs−561 core/src/Streamly/Internal/Data/Ring/Generic.hs+185 core/src/Streamly/Internal/Data/SVar/Type.hs+10−1 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/Common.hs−161 core/src/Streamly/Internal/Data/Stream/Container.hs+310 core/src/Streamly/Internal/Data/Stream/Eliminate.hs+849 core/src/Streamly/Internal/Data/Stream/StreamD/Exception.hs → core/src/Streamly/Internal/Data/Stream/Exception.hs+197−120 core/src/Streamly/Internal/Data/Stream/Generate.hs+1191 core/src/Streamly/Internal/Data/Stream/Instances.hs−171 core/src/Streamly/Internal/Data/Stream/Lift.hs+129 core/src/Streamly/Internal/Data/Stream/StreamD/Nesting.hs → core/src/Streamly/Internal/Data/Stream/Nesting.hs+912−354 core/src/Streamly/Internal/Data/Stream/Serial.hs−343 core/src/Streamly/Internal/Data/Stream/StreamD/Step.hs → core/src/Streamly/Internal/Data/Stream/Step.hs+2−2 core/src/Streamly/Internal/Data/Stream/StreamD.hs+3−23 core/src/Streamly/Internal/Data/Stream/StreamD/Eliminate.hs−510 core/src/Streamly/Internal/Data/Stream/StreamD/Generate.hs−406 core/src/Streamly/Internal/Data/Stream/StreamD/Lift.hs−112 core/src/Streamly/Internal/Data/Stream/StreamD/Transform.hs−1302 core/src/Streamly/Internal/Data/Stream/StreamD/Type.hs−1032 core/src/Streamly/Internal/Data/Stream/StreamDK.hs−156 core/src/Streamly/Internal/Data/Stream/StreamK.hs−956 core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs−1317 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/Stream/WSerial.hs−249 core/src/Streamly/Internal/Data/StreamK.hs+1730 core/src/Streamly/Internal/Data/Stream/StreamDK/Type.hs → core/src/Streamly/Internal/Data/StreamK/Alt.hs+143−3 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+16−16 core/src/Streamly/Internal/Data/Time/Clock/Type.hsc+1−1 core/src/Streamly/Internal/Data/Time/TimeSpec.hsc−3 core/src/Streamly/Internal/Data/Time/Units.hs+8−7 core/src/Streamly/Internal/Data/Tuple/Strict.hs+2 core/src/Streamly/Internal/Data/Unbox.hs+908 core/src/Streamly/Internal/Data/Unbox/TH.hs+498 core/src/Streamly/Internal/Data/Unfold.hs+198−327 core/src/Streamly/Internal/Data/Unfold/Enumeration.hs+2−32 core/src/Streamly/Internal/Data/Unfold/Type.hs+284−64 src/Streamly/Internal/FileSystem/Dir.hs → core/src/Streamly/Internal/FileSystem/Dir.hs+188−80 src/Streamly/Internal/FileSystem/File.hs → core/src/Streamly/Internal/FileSystem/File.hs+204−137 src/Streamly/Internal/FileSystem/Handle.hs → core/src/Streamly/Internal/FileSystem/Handle.hs+160−216 core/src/Streamly/Internal/FileSystem/Path.hs+515 core/src/Streamly/Internal/Foreign/Malloc.hs−49 core/src/Streamly/Internal/System/IO.hs+4−2 core/src/Streamly/Internal/Unicode/Array.hs+104 core/src/Streamly/Internal/Unicode/Parser.hs+627 src/Streamly/Internal/Unicode/Stream.hs → core/src/Streamly/Internal/Unicode/Stream.hs+261−227 core/src/Streamly/Internal/Unicode/String.hs+158 core/src/Streamly/Unicode/Parser.hs+69 src/Streamly/Unicode/Stream.hs → core/src/Streamly/Unicode/Stream.hs+20−17 core/src/Streamly/Unicode/String.hs+30 core/src/assert.hs+6 core/src/inline.hs+2−2 core/streamly-core.cabal+310−122 default.nix+16−7 docs/Developer/Benchmarks.md+60−39 docs/Developer/Contributing.md+1−2 docs/Developer/Github.link+1 docs/Developer/MAINTAINING.md+42−18 docs/Developer/Tests.md+2−2 docs/Developer/ci-tests.md+16−6 docs/Developer/module-organization.md+4−4 docs/Developer/optimization-guidelines.md+13−1 docs/Developer/paths.rst+25−2 docs/Documentation.md+5 docs/User/Explanation/Overview.md → docs/User/Explanatory/Overview.md docs/User/Explanatory/design.md+42 docs/User/Explanation/monad-transformers.md → docs/User/Explanatory/monad-transformers.md docs/User/ProjectRelated/performance.md → docs/User/Explanatory/performance.md docs/User/Explanation/streaming-pradigms.rst → docs/User/Explanatory/streaming-pradigms.rst docs/User/Explanation/unified-abstractions.md → docs/User/Explanatory/unified-abstractions.md+1−1 docs/User/HowTo/Compiling.md+54−46 docs/User/HowTo/Examples.link+1 docs/User/HowTo/faq.md+57−33 docs/User/HowTo/streamly-vs-async.md+2 docs/User/HowTo/streamly-vs-lists.md+2 docs/User/Project/ApiChangelogs/0.8.3-0.9.0.txt+175 docs/User/ProjectRelated/API-changelog.txt → docs/User/Project/ApiChangelogs/0.8.3.txt docs/User/Project/ApiChangelogs/0.9.0-0.10.0.txt+424 docs/User/ProjectRelated/CONTRIBUTORS.md → docs/User/Project/CONTRIBUTORS.md+16 docs/User/ProjectRelated/Changelog.md → docs/User/Project/Changelog.md+126−9 docs/User/ProjectRelated/Credits.md → docs/User/Project/Credits.md docs/User/Project/Github.link+1 docs/User/Project/README.md+141 docs/User/ProjectRelated/Roadmap.link → docs/User/Project/Roadmap.link docs/User/Project/Upgrading-0.8-to-0.9.md+384 docs/User/Tutorials/ConcurrentStreams.hs+18−28 docs/User/Tutorials/Examples.link+1 docs/User/Tutorials/Introduction.md−651 docs/User/Tutorials/ReactiveProgramming.hs+3−1 docs/User/Tutorials/Tutorial.hs+46−67 docs/User/Tutorials/before-you-begin.md+77 docs/User/Tutorials/getting-started.md+120−191 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/ProjectRelated/resources.md → docs/User/resources.md docs/streamly-docs.cabal+14−7 hie.yaml+62−32 src/Streamly.hs−623 src/Streamly/Data/Array.hs−43 core/src/Streamly/Data/Array/Foreign.hs → src/Streamly/Data/Array/Foreign.hs+44−3 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−165 src/Streamly/Data/Unicode/Stream.hs−99 core/src/Streamly/Internal/Control/Concurrent.hs → src/Streamly/Internal/Control/Concurrent.hs+1−12 core/src/Streamly/Internal/Control/ForkLifted.hs → src/Streamly/Internal/Control/ForkLifted.hs+17−4 src/Streamly/Internal/Data/Array/ArrayMacros.h−27 src/Streamly/Internal/Data/Array/Prim.hs−110 src/Streamly/Internal/Data/Array/Prim/Mut/Type.hs−94 src/Streamly/Internal/Data/Array/Prim/MutTypesInclude.hs−413 src/Streamly/Internal/Data/Array/Prim/Pinned.hs−108 src/Streamly/Internal/Data/Array/Prim/Pinned/Mut/Type.hs−176 src/Streamly/Internal/Data/Array/Prim/Pinned/Type.hs−127 src/Streamly/Internal/Data/Array/Prim/Type.hs−98 src/Streamly/Internal/Data/Array/Prim/TypesInclude.hs−706 src/Streamly/Internal/Data/Array/PrimInclude.hs−184 src/Streamly/Internal/Data/Array/Stream/Foreign.hs−859 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 core/src/Streamly/Internal/Data/Cont.hs → src/Streamly/Internal/Data/Cont.hs src/Streamly/Internal/Data/Fold/Async.hs+20−7 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+8−7 src/Streamly/Internal/Data/IOFinalizer/Lifted.hs+74 src/Streamly/Internal/Data/IsMap/HashMap.hs+42 src/Streamly/Internal/Data/SVar.hs+2−2 src/Streamly/Internal/Data/SVar/Dispatch.hs−3 src/Streamly/Internal/Data/SmallArray.hs+26−25 src/Streamly/Internal/Data/SmallArray/Type.hs−3 src/Streamly/Internal/Data/Stream/Ahead.hs+37−12 src/Streamly/Internal/Data/Stream/Async.hs+50−16 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/Instances.hs+9−12 src/Streamly/Internal/Data/Stream/IsStream.hs+25−5 src/Streamly/Internal/Data/Stream/IsStream/Combinators.hs+4−2 src/Streamly/Internal/Data/Stream/IsStream/Common.hs+75−53 src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs+71−82 src/Streamly/Internal/Data/Stream/IsStream/Enumeration.hs+15−2 src/Streamly/Internal/Data/Stream/IsStream/Exception.hs+29−15 src/Streamly/Internal/Data/Stream/IsStream/Expand.hs+35−23 src/Streamly/Internal/Data/Stream/IsStream/Generate.hs+32−55 src/Streamly/Internal/Data/Stream/IsStream/Lift.hs+8−10 src/Streamly/Internal/Data/Stream/IsStream/Reduce.hs+81−68 src/Streamly/Internal/Data/Stream/IsStream/Top.hs+88−37 src/Streamly/Internal/Data/Stream/IsStream/Transform.hs+73−143 src/Streamly/Internal/Data/Stream/IsStream/Type.hs+67−72 src/Streamly/Internal/Data/Stream/Lifted.hs+335 src/Streamly/Internal/Data/Stream/MkType.hs+641 src/Streamly/Internal/Data/Stream/Parallel.hs+60−32 src/Streamly/Internal/Data/Stream/Prelude.hs+19 src/Streamly/Internal/Data/Stream/SVar.hs+18 src/Streamly/Internal/Data/Stream/SVar/Eliminate.hs+12−7 src/Streamly/Internal/Data/Stream/SVar/Generate.hs+13−10 src/Streamly/Internal/Data/Stream/Serial.hs+456 src/Streamly/Internal/Data/Stream/Time.hs+950 core/src/Streamly/Internal/Data/Stream/Zip.hs → src/Streamly/Internal/Data/Stream/Zip.hs+55−5 src/Streamly/Internal/Data/Stream/ZipAsync.hs+14−11 src/Streamly/Internal/Data/Unfold/Exception.hs+214 src/Streamly/Internal/Data/Unfold/Prelude.hs+17 src/Streamly/Internal/Data/Unfold/SVar.hs+3−6 src/Streamly/Internal/FileSystem/Event.hs+7−4 src/Streamly/Internal/FileSystem/Event/Darwin.hs+69−76 src/Streamly/Internal/FileSystem/Event/Linux.hs+105−106 src/Streamly/Internal/FileSystem/Event/Windows.hs+64−61 src/Streamly/Internal/FileSystem/FD.hs+70−62 src/Streamly/Internal/FileSystem/FDIO.hs−5 src/Streamly/Internal/Network/Inet/TCP.hs+161−124 src/Streamly/Internal/Network/Socket.hs+143−247 src/Streamly/Internal/System/IOVec.hs+13−7 src/Streamly/Internal/Unicode/Array/Char.hs−92 src/Streamly/Internal/Unicode/Array/Prim/Pinned.hs−91 src/Streamly/Internal/Unicode/Char.hs+21−12 src/Streamly/Internal/Unicode/Char/Parser.hs−214 src/Streamly/Internal/Unicode/Utf8.hs+15−9 src/Streamly/Memory/Array.hs−74 src/Streamly/Network/Inet/TCP.hs+45−6 src/Streamly/Network/Socket.hs+74−47 src/Streamly/Prelude.hs+14−6 src/assert.hs+6 src/inline.hs+2−2 stack.yaml+2−2 streamly.cabal+233−363 targets/Targets.hs+213 benchmark/bench-report/cabal.project → targets/cabal.project targets/default.nix+163 targets/streamly-targets.cabal+12 test/Streamly/Test/Data/Array.hs+231−5 test/Streamly/Test/Data/Array/Common.hs+15−23 test/Streamly/Test/Data/Array/CommonImports.hs+4−4 test/Streamly/Test/Data/Array/Foreign.hs−213 test/Streamly/Test/Data/Array/Prim/Pinned.hs → test/Streamly/Test/Data/Array/Generic.hs+22−12 test/Streamly/Test/Data/Array/Prim.hs−55 test/Streamly/Test/Data/Array/Stream.hs+113 test/Streamly/Test/Data/Array/Stream/Foreign.hs−72 test/Streamly/Test/Data/Fold.hs+175−102 test/Streamly/Test/Data/Fold/Window.hs+21−20 test/Streamly/Test/Data/List.hs+20−20 test/Streamly/Test/Data/MutArray.hs+152 test/Streamly/Test/Data/Parser.hs+763−193 test/Streamly/Test/Data/Parser/ParserD.hs → test/Streamly/Test/Data/ParserK.hs+155−91 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+2 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+15−22 test/Streamly/Test/FileSystem/Event/Common.hs+10−6 test/Streamly/Test/FileSystem/Event/Darwin.hs+1−1 test/Streamly/Test/FileSystem/Event/Linux.hs+17−4 test/Streamly/Test/FileSystem/Event/Windows.hs+2−2 test/Streamly/Test/FileSystem/Handle.hs+27−31 test/Streamly/Test/Network/Inet/TCP.hs+25−18 test/Streamly/Test/Network/Socket.hs+29−20 test/Streamly/Test/Prelude.hs+2 test/Streamly/Test/Prelude/Ahead.hs+2−3 test/Streamly/Test/Prelude/Async.hs+2−3 test/Streamly/Test/Prelude/Concurrent.hs+2 test/Streamly/Test/Prelude/Fold.hs+2 test/Streamly/Test/Prelude/Parallel.hs+2 test/Streamly/Test/Prelude/Rate.hs+2 test/Streamly/Test/Prelude/Serial.hs+157−118 test/Streamly/Test/Prelude/Top.hs+9−3 test/Streamly/Test/Prelude/WAsync.hs+2 test/Streamly/Test/Prelude/WSerial.hs+4−5 test/Streamly/Test/Prelude/ZipAsync.hs+2 test/Streamly/Test/Prelude/ZipSerial.hs+2−3 test/Streamly/Test/Serialize/Serializable.hs+237 test/Streamly/Test/Unicode/Char.hs+13−9 test/Streamly/Test/Unicode/Parser.hs+231 test/Streamly/Test/Unicode/Stream.hs+34−30 test/lib/Streamly/Test/Common.hs+4−3 test/lib/Streamly/Test/Prelude/Common.hs+18−41 test/streamly-tests.cabal+190−41 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+75−278
@@ -1,7 +1,7 @@
11version: 2.1
22
33#-----------------------------------------------------------------------------
4−# packcheck-0.4.2
4+# packcheck-0.7.0
55# Packcheck global environment variables
66#-----------------------------------------------------------------------------
77
@@ -11,6 +11,8 @@ 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
1416 CABAL_REINIT_CONFIG: "y"
1517 LC_ALL: "C.UTF-8"
1618
@@ -22,7 +24,6 @@ env: &env
2224 # DISABLE_DOCS: "y"
2325 # DISABLE_SDIST_BUILD: "y"
2426 # DISABLE_DIST_CHECKS: "y"
25− ENABLE_INSTALL: "y"
2627
2728 # ------------------------------------------------------------------------
2829 # stack options
@@ -38,15 +39,12 @@ env: &env
3839 # cabal options
3940 # ------------------------------------------------------------------------
4041 CABAL_CHECK_RELAX: "y"
41− CABAL_NO_SANDBOX: "y"
42− CABAL_HACKAGE_MIRROR: "hackage.haskell.org:http://hackage.fpcomplete.com"
4342 CABAL_BUILD_OPTIONS: "-j1 --flag limit-build-mem"
4443
4544 # ------------------------------------------------------------------------
4645 # Where to find the required tools
4746 # ------------------------------------------------------------------------
48− PATH: /opt/ghc/bin:/opt/ghcjs/bin:/sbin:/usr/sbin:/bin:/usr/bin
49− TOOLS_DIR: /opt
47+ PATH: /sbin:/usr/sbin:/bin:/usr/bin
5048
5149 # ------------------------------------------------------------------------
5250 # Location of packcheck.sh (the shell script invoked to perform CI tests ).
@@ -59,15 +57,15 @@ env: &env
5957 # If you have not committed packcheck.sh in your repo at PACKCHECK
6058 # then it is automatically pulled from this URL.
6159 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
62− PACKCHECK_GITHUB_COMMIT: "35efa99b2082d13722b8a0183ac6455df98e91b9"
60+ PACKCHECK_GITHUB_COMMIT: "f6cfd7b7a33b4bf6fd63cce6a3fb3d26f5031403"
6361
6462executors:
6563 amd64-executor:
6664 docker:
67− - image: ubuntu:xenial
65+ - image: ubuntu:latest
6866 x86-executor:
6967 docker:
70− - image: i386/ubuntu:eoan
68+ - image: i386/ubuntu:focal
7169
7270#-----------------------------------------------------------------------------
7371# Common utility stuff, not to be modified usually
@@ -79,38 +77,50 @@ preinstall: &preinstall
7977 # required for https/cache save and restore
8078 apt-get install -y ca-certificates
8179
82− # required to (re)generate the configure script
83− apt-get install -y autoconf
84−
85− # For ghc and cabal-install packages from hvr's ppa
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.
8683 # gnupg is required for apt-key to work
87− apt-get install -y gnupg
88− apt-get install -y apt-transport-https
89− apt-key adv --keyserver keyserver.ubuntu.com --recv-keys BA3CBA3FFE22B574
90− apt-get install -y software-properties-common
91− add-apt-repository -y ppa:hvr/ghc
92− # echo "deb http://downloads.haskell.org/debian stretch main" >> /etc/apt/sources.list
93− echo "deb-src http://ppa.launchpad.net/hvr/ghc/ubuntu xenial main" >> /etc/apt/sources.list
94− apt-get update
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
9588
96− # required for packcheck
97− apt-get install -y curl
89+ # required for outbound https for stack and for stack setup
90+ apt-get install -y netbase xz-utils make
91+ apt-get install -y zlib1g-dev
9892
99− # required for circleci.
100− apt-get install -y libcurl4-gnutls-dev
101− apt-get install -y git
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
102102 apt-get install -y libtinfo-dev
103103
104− # required for outbound https for stack and for stack setup
105− apt-get install -y netbase xz-utils make
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
106109
107−project-preinstall: &project-preinstall
108− run: |
109110 # Get packcheck if needed
110− CURL=$(which curl)
111− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
112− if test ! -e "$PACKCHECK"; then $CURL -sL -o "$PACKCHECK" $PACKCHECK_URL; fi;
113− chmod +x $PACKCHECK
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
114124
115125restore: &restore
116126 # Needs to happen after installing ca-certificates
@@ -126,270 +136,71 @@ save: &save
126136 save_cache:
127137 key: v1-{{ .Environment.CIRCLE_JOB }}-{{ .Branch }}
128138 paths:
129− - ~/.cabal
130− - ~/.ghc
131139 - ~/.local
140+ - ~/.cabal
132141 - ~/.stack
142+ - ~/.ghcup
133143
134144#-----------------------------------------------------------------------------
135145# Build matrix
136146#-----------------------------------------------------------------------------
137147
138148jobs:
139− cabal-ghc-8_10_4:
140− <<: *env
141− executor: amd64-executor
142− steps:
143− - *preinstall
144− - checkout
145− - *project-preinstall
146− - *restore
147− - run:
148− environment:
149− CABAL_PROJECT: "cabal.project"
150− DISABLE_TEST: "yes"
151− DISABLE_BENCH: "yes"
152− DISABLE_DIST_CHECKS: "yes"
153− command: |
154− apt-get install -y ghc-8.10.4
155− apt-get install -y cabal-install-3.4
156− bash -c "$PACKCHECK cabal"
157− - *save
158− stack-ghc-8_8:
159− <<: *env
160− executor: amd64-executor
161− steps:
162− - *preinstall
163− - checkout
164− - *project-preinstall
165− - *restore
166− - run:
167− name: GHC 8.8 + stack lts-16.12
168− environment:
169− BUILD: "stack"
170− RESOLVER: "lts-16.12"
171− SDIST_OPTIONS: "--ignore-check"
172− STACK_BUILD_OPTIONS: "--flag streamly-benchmarks:-opt"
173− command: |
174− apt-get build-dep -y ghc-8.8.4
175− apt-get install -y cabal-install-3.2
176− bash -c "$PACKCHECK $BUILD"
177− - *save
178149 cabal-ghc-8_6_5:
179150 <<: *env
180151 executor: amd64-executor
181152 steps:
182− - *preinstall
183153 - checkout
184− - *project-preinstall
185154 - *restore
186− - run: |
187− apt-get install -y ghc-8.6.3
188− apt-get install -y cabal-install-2.4
189− bash -c "$PACKCHECK cabal-v2"
190− - *save
191− cabal-ghc-8_4_4:
192− <<: *env
193− executor: x86-executor
194− steps:
195155 - *preinstall
196− - checkout
197− - *project-preinstall
198− - *restore
199− - run:
200− name: GHC 8.4.4 + x86 + debug
201− environment:
202− BUILD: "cabal-v2"
203− GHCVER: "8.4.4"
204− CABAL_BUILD_OPTIONS: "--flag debug --flag limit-build-mem"
205− command: |
206− apt-get install -y ghc-8.4.4
207− apt-get install -y cabal-install-3.2
208− bash -c "$PACKCHECK $BUILD"
209− - *save
210− cabal-ghc-8_2_2:
211− <<: *env
212− executor: amd64-executor
213− steps:
214− - *preinstall
215− - checkout
216− - *project-preinstall
217− - *restore
218156 - run:
219157 environment:
220− BUILD: "cabal-v2"
221− DISABLE_TEST: "yes"
222− DISABLE_BENCH: "yes"
223− DISABLE_DOCS: "yes"
224− DISABLE_SDIST_BUILD: "yes"
225− DISABLE_DIST_CHECKS: "yes"
226− command: |
227− apt-get install -y ghc-8.2.2
228− apt-get install -y cabal-install-3.2
229− bash -c "$PACKCHECK $BUILD"
230− - *save
231− cabal-ghc-8_0_2:
232− <<: *env
233− executor: amd64-executor
234− steps:
235− - *preinstall
236− - checkout
237− - *project-preinstall
238− - *restore
239− - run:
240− environment:
241− BUILD: "cabal-v2"
242− DISABLE_TEST: "yes"
243− DISABLE_BENCH: "yes"
244− DISABLE_DOCS: "yes"
245− DISABLE_SDIST_BUILD: "yes"
246− DISABLE_DIST_CHECKS: "yes"
247− command: |
248− apt-get install -y ghc-8.0.2
249− apt-get install -y cabal-install-3.2
250− bash -c "$PACKCHECK $BUILD"
251− - *save
252− cabal-ghc-7_10_3:
253− <<: *env
254− executor: amd64-executor
255− steps:
256− - *preinstall
257− - checkout
258− - *project-preinstall
259− - *restore
260− - run: |
261− apt-get install -y ghc-7.10.3
262− apt-get install -y cabal-install-2.4
263− bash -c "$PACKCHECK cabal-v2"
264− - *save
265− stack-ghc-8_4:
266− <<: *env
267− executor: amd64-executor
268− steps:
269− - *preinstall
270− - checkout
271− - *project-preinstall
272− - *restore
273− - run: |
274− bash -c "$PACKCHECK stack RESOLVER=lts-12"
275− - *save
276− stack-ghc-8_2:
277− <<: *env
278− executor: amd64-executor
279− steps:
280− - *preinstall
281− - checkout
282− - *project-preinstall
283− - *restore
284− - run: |
285− bash -c "$PACKCHECK stack RESOLVER=lts-11"
286− - *save
287− cabal-ghcjs-8_4:
288− <<: *env
289− executor: amd64-executor
290− steps:
291− - *preinstall
292− - checkout
293− - *project-preinstall
294− - *restore
295− - run:
296− name: GHCJS 8.4+no-test+no-docs
297− environment:
298− BUILD: cabal-v2
299− ENABLE_GHCJS: "yes"
300− DISABLE_TEST: "yes"
301− ENABLE_INSTALL: ""
302− DISABLE_DOCS: "yes"
158+ GHCVER: "8.6.5"
159+ CABAL_VERSION: "3.6.2.0"
160+ CABAL_PROJECT: "cabal.project"
303161 DISABLE_SDIST_BUILD: "yes"
162+ CABAL_BUILD_OPTIONS: "--flag debug --flag -opt"
304163 command: |
305− add-apt-repository -y ppa:hvr/ghcjs
306− add-apt-repository -y 'deb https://deb.nodesource.com/node_11.x xenial main'
307− curl -sSL https://deb.nodesource.com/gpgkey/nodesource.gpg.key | apt-key add -
308− apt-get update
309− apt-get install -y cabal-install-3.2
310− apt-get install -y nodejs
311− apt-get install -y ghcjs-8.4
312− cabal user-config update -a "jobs: 1"
313− bash -c "$PACKCHECK $BUILD"
164+ bash -c "$PACKCHECK cabal"
314165 - *save
315− coveralls-ghc-8_2_2:
166+ cabal-ghc-9_8_1-docspec:
316167 <<: *env
317168 executor: amd64-executor
318169 steps:
319− - *preinstall
320170 - checkout
321− - *project-preinstall
322171 - *restore
323− - run:
324− environment:
325− BUILD: cabal
326− COVERALLS_OPTIONS: "--repo-token=\"$REPO_TOKEN\" --coverage-mode=StrictlyFullLines --exclude-dir=test test"
327− GHC_OPTIONS: "-DCOVERAGE_BUILD"
328− command: |
329− apt-get install -y ghc-8.2.2
330− apt-get install -y cabal-install-2.4
331− bash -c "$PACKCHECK cabal-v1"
332− - *save
333− coveralls-ghc-8_8_3:
334− <<: *env
335− executor: amd64-executor
336− steps:
337172 - *preinstall
338− - checkout
339− - *project-preinstall
340− - *restore
341173 - run:
342174 environment:
343− BUILD: cabal-v2
344− COVERALLS_OPTIONS: "--repo-token=\"$REPO_TOKEN\" --coverage-mode=StrictlyFullLines --exclude-dir=test"
345− CABAL_PROJECT: "cabal.project.coverage"
346− CABAL_BUILD_TARGETS: ""
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"
347185 command: |
348− apt-get install -y ghc-8.8.3
349− apt-get install -y cabal-install-3.0
350− bash -c "$PACKCHECK cabal-v2"
351− no_output_timeout: 25m
186+ bash -c "$PACKCHECK cabal"
352187 - *save
353− coveralls-ghc-8_10_2:
188+ hlint-trailing-spaces:
354189 <<: *env
355190 executor: amd64-executor
356191 steps:
357− - *preinstall
358192 - checkout
359− - *project-preinstall
360193 - *restore
361− - run:
362− name: Build and test with inspection, coverage, Werror
363− command: |
364− apt-get install -y ghc-8.10.2
365− apt-get install -y cabal-install-3.2
366− # Run tests with coverage
367− cabal update
368− cabal user-config update -a "jobs: 1"
369− bin/test.sh --coverage --raw
370− # Upload results to coveralls.io
371− PATH=$HOME/.cabal/bin:$PATH
372− export PATH
373− which hpc-coveralls 2>/dev/null || cabal install --project-file cabal.project.hpc-coveralls hpc-coveralls
374− hpc-coveralls --repo-token="$REPO_TOKEN" --coverage-mode=StrictlyFullLines
375− no_output_timeout: 25m
376− - *save
377− hlint-src:
378− <<: *env
379− executor: amd64-executor
380− steps:
381194 - *preinstall
382− - checkout
383− - *project-preinstall
384− - *restore
385195 - run:
386− name: Hlint src
196+ name: hlint and trailing spaces
387197 environment:
388− BUILD: cabal-v2
198+ DISABLE_SDIST_BUILD: "yes"
199+ HLINT_VERSION: 3.6.1
389200 HLINT_OPTIONS: lint
390− HLINT_TARGETS: src test benchmark
201+ HLINT_TARGETS: core/src src test benchmark
391202 command: |
392− bash -c "$PACKCHECK $BUILD" || exit 1
203+ bash -c "$PACKCHECK hlint" || exit 1
393204 echo "Checking trailing spaces..."
394205 count=$(find . -name "*.hs" -exec grep -H '\ $' {} \; | tee /dev/tty | wc -l)
395206 exit $count
@@ -399,23 +210,9 @@ workflows:
399210 version: 2
400211 build:
401212 jobs:
402− - cabal-ghc-8_10_4:
403− name: GHC 8.10.4 + sdist + no-test + no-bench
404− #- cabal-ghc-8.6.5
405− #- cabal-ghc-8_4_4:
406− # name: GHC 8.4.4 + x86 + debug
407− #- cabal-ghc-8_2_2:
408− # name: GHC 8.2.2 + no-test + no-bench + no-docs
409− #- cabal-ghc-8_0_2:
410− # name: GHC 8.0.2 + no-test + no-bench + no-docs
411− #- cabal-ghc-7.10.3
412− - cabal-ghcjs-8_4:
413− name: GHCJS 8.4 + no-test + no-docs
414− #- stack-ghc-8.4
415− #- stack-ghc-8.2
416− #- coveralls-ghc-8.2.2
417− #- coveralls-ghc-8.8.3
418− #- coveralls-ghc-8_10_2:
419− # name: GHC 8.10.2 + inspection + coverage + Werror
420− - hlint-src:
421− name: Hlint src + Trailing Spaces
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
.github/workflows/haskell.yml+128−98
@@ -13,8 +13,15 @@ jobs:
1313 # packcheck environment variables
1414 LC_ALL: C.UTF-8
1515 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 }}
1621 GHCVER: ${{ matrix.ghc_version }}
22+ CABALVER: ${{ matrix.cabal_version }}
1723 DISABLE_DOCS: ${{ matrix.disable_docs }}
24+ ENABLE_DOCSPEC: ${{ matrix.enable_docspec }}
1825 DISABLE_TEST: ${{ matrix.disable_test }}
1926 DISABLE_BENCH: ${{ matrix.disable_bench }}
2027 DISABLE_DIST_CHECKS: ${{ matrix.disable_dist_checks }}
@@ -38,14 +45,21 @@ jobs:
3845 STACK_BUILD_OPTIONS: ${{ matrix.stack_build_options }}
3946
4047 # packcheck location and revision
41− PACKCHECK_LOCAL_PATH: "./packcheck.sh"
48+ PACKCHECK: "./packcheck.sh"
4249 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
43− PACKCHECK_GITHUB_COMMIT: "075e13ab716c67d2110db4905ae42b0280af046d"
50+ PACKCHECK_GITHUB_COMMIT: "v0.7.0"
4451
4552 # Pull token from "secrets" setting of the github repo
4653 COVERALLS_TOKEN: ${{ secrets.COVERALLS_TOKEN }}
4754 COVERAGE: ${{ matrix.coverage }}
48− DOCTEST: ${{ matrix.doctest }}
55+
56+ # hlint
57+ HLINT_VERSION: 3.6.1
58+ HLINT_OPTIONS: "lint"
59+ HLINT_TARGETS: "core/src src test benchmark"
60+
61+ # Subdir
62+ SUBDIR: ${{ matrix.subdir }}
4963
5064 runs-on: ${{ matrix.runner }}
5165 continue-on-error: ${{ matrix.ignore_error }}
@@ -54,8 +68,8 @@ jobs:
5468 matrix:
5569 # The order is important to optimize fail-fast.
5670 name:
57− - 8.10.7-sdist-fusion-inspection-Werror
58− - 9.2.2-docspec
71+ - 9.8.1-Werror
72+ # - 9.8.1-docspec
5973 # - 8.10.7-coverage
6074
6175 # Note: if cabal.project is not specified benchmarks and tests won't
@@ -64,155 +78,159 @@ jobs:
6478 include:
6579 - name: head
6680 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"
6791 runner: ubuntu-latest
6892 build: cabal
69− cabal_version: latest
93+ cabal_version: 3.10.2.0
7094 cabal_project: cabal.project.ghc-head
7195 disable_sdist_build: "y"
7296 ignore_error: true
73− - name: 9.2.2
74− ghc_version: 9.2.2
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
75120 runner: ubuntu-latest
76121 build: cabal
122+ cabal_version: 3.10.1.0
123+ disable_sdist_build: "y"
77124 cabal_project: cabal.project
78− cabal_version: 3.6
125+ cabal_build_options: "--flag fusion-plugin --flag inspection"
126+ ignore_error: false
127+ - name: 9.6.3-macos
128+ ghc_version: 9.6.3
129+ runner: macos-latest
130+ build: cabal
131+ cabal_version: 3.10.1.0
79132 disable_sdist_build: "y"
133+ cabal_project: cabal.project
80134 ignore_error: false
81− - name: 9.2.2-docspec
82− ghc_version: 9.2.2
135+ - name: 9.4.7
136+ ghc_version: 9.4.7
83137 runner: ubuntu-latest
84− doctest: "y"
85− cabal_version: 3.6
138+ build: cabal
139+ cabal_version: 3.8.1.0
140+ disable_sdist_build: "y"
86141 cabal_project: cabal.project
87142 ignore_error: false
88− - name: 9.0.2
89− ghc_version: 9.0.2
143+ - name: 9.2.8
144+ ghc_version: 9.2.8
90145 runner: ubuntu-latest
91146 build: cabal
92− cabal_version: 3.6
93147 cabal_project: cabal.project
148+ cabal_version: 3.6.2.0
94149 disable_sdist_build: "y"
95150 ignore_error: false
96− - name: 8.10.7-sdist-stack
151+ - name: 9.0.2-streamly-sdist
152+ ghc_version: 9.0.2
153+ 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
97166 runner: ubuntu-latest
98167 build: stack
99− resolver: lts-18.23
168+ resolver: lts-20.13
100169 stack_yaml: stack.yaml
101170 sdist_options: "--ignore-check"
102171 stack_build_options: "--flag streamly-benchmarks:-opt"
103− cabal_version: 3.6
104− ignore_error: false
105− - name: 8.10.7-macos
106− ghc_version: 8.10.7
107− runner: macos-latest
108− build: cabal
109− cabal_version: 3.6
110− cabal_project: cabal.project
111− disable_sdist_build: "y"
172+ cabal_version: 3.6.2.0
112173 ignore_error: false
113174 # - name: 8.10.7-coverage
114175 # ghc_version: 8.10.7
115176 # runner: ubuntu-latest
116177 # coverage: "y"
117− # cabal_version: 3.6
178+ # cabal_version: 3.6.2.0
118179 # ignore_error: false
119− - name: 8.10.7-sdist-fusion-inspection-Werror
120− ghc_version: 8.10.7
121− runner: ubuntu-latest
122− build: cabal
123− cabal_version: 3.6
124− cabal_project: cabal.project.Werror
125− cabal_build_options: "--flag fusion-plugin --flag inspection"
126− ignore_error: false
127− - name: 8.8.4-sdist-fusion
180+ - name: 8.8.4
128181 ghc_version: 8.8.4
129182 runner: ubuntu-latest
130183 build: cabal
131− cabal_version: 3.6
184+ cabal_version: 3.6.2.0
132185 cabal_project: cabal.project
133− cabal_build_options: "--flag fusion-plugin"
134− ignore_error: false
135− - name: 8.6.5-sdist-streamk-unoptimized
136− ghc_version: 8.6.5
137− runner: ubuntu-latest
138− build: cabal
139− cabal_version: 3.6
140− cabal_project: cabal.project
141− cabal_build_options: "--flag streamk --flag -opt"
186+ disable_sdist_build: "y"
142187 ignore_error: false
143− - name: 8.6.5-sdist-debug-unoptimized
188+ - name: 8.6.5-debug-unoptimized
144189 ghc_version: 8.6.5
145190 runner: ubuntu-latest
146191 build: cabal
147− cabal_version: 3.6
192+ cabal_version: 3.6.2.0
148193 cabal_project: cabal.project
149194 cabal_build_options: "--flag debug --flag -opt"
195+ disable_sdist_build: "y"
150196 ignore_error: false
151− - name: 8.4.4-sdist
152− ghc_version: 8.4.4
197+ - name: hlint
198+ build: hlint
153199 runner: ubuntu-latest
154− build: cabal
155− cabal_version: 3.6
156− cabal_project: cabal.project
157− ignore_error: false
200+ ignore_error: true
158201
159202 steps:
160203 - uses: actions/checkout@v2
161204
162205 - uses: actions/cache@v1
163− name: Cache ~/.cabal
206+ name: Cache common directories
164207 with:
165− path: ~/.cabal
208+ path: |
209+ ~/.local
210+ ~/.cabal
211+ ~/.stack
212+ ~/.ghcup
166213 # Bump the key version to clear the cache
167− key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v1
214+ key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v2
168215
169216 - name: Download packcheck
170217 run: |
171− # Get packcheck if needed
172− CURL=$(which curl)
173− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
174− if test ! -e "$PACKCHECK_LOCAL_PATH"; then $CURL -sL -o "$PACKCHECK_LOCAL_PATH" $PACKCHECK_URL; fi;
175− chmod +x $PACKCHECK_LOCAL_PATH
176−
177− os=$(uname -s -m)
178− case "$os" in
179− "Linux x86_64") GHCUP_ARCH="x86_64-linux" ;;
180− "Darwin x86_64") GHCUP_ARCH="x86_64-apple-darwin" ;;
181− *) echo "Unknown OS/Arch: $os"; exit 1;;
182− esac
183−
184− $CURL -sL -o ./ghcup https://downloads.haskell.org/~ghcup/0.1.17.4/${GHCUP_ARCH}-ghcup-0.1.17.4
185− chmod +x ./ghcup
186− if test "$GHCVER" = "head"
218+ if test ! -e "$PACKCHECK"
187219 then
188− ./ghcup install ghc -u https://gitlab.haskell.org/ghc/ghc/-/jobs/artifacts/master/raw/ghc-x86_64-deb10-linux-integer-simple.tar.xz?job=validate-x86_64-linux-deb10-integer-simple head
189− else
190− ./ghcup install ghc $GHCVER
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
191230 fi
192− ./ghcup set ghc $GHCVER
193231
194232 - name: Run tests
195233 run: |
196− if test -n "$DOCTEST"
197− then
198− mkdir -p $HOME/.cabal/bin
199− curl -sL https://github.com/phadej/cabal-extras/releases/download/cabal-docspec-0.0.0.20210111/cabal-docspec-0.0.0.20210111.xz > cabal-docspec.xz
200− echo '0829bd034fba901cbcfe491d98ed8b28fd54f9cb5c91fa8e1ac62dc4413c9562 cabal-docspec.xz' | sha256sum -c -
201− xz -d < cabal-docspec.xz > $HOME/.cabal/bin/cabal-docspec
202− rm -f cabal-docspec.xz
203− chmod a+x $HOME/.cabal/bin/cabal-docspec
204− cabal update
205− cabal build all
206− $HOME/.cabal/bin/cabal-docspec --version
207− $HOME/.cabal/bin/cabal-docspec --timeout 60 --check-properties --property-variables xs
208− elif test -z "$COVERAGE"
209− then
210− export TOOLS_DIR=/opt
211− # /usr/local/opt/curl/bin for macOS
212− export PATH=$HOME/.local/bin:$HOME/.ghcup/bin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/local/opt/curl/bin
213− bash -c "$PACKCHECK_LOCAL_PATH $BUILD"
214− fi
215−
216234 if test -n "$COVERAGE"
217235 then
218236 # Run tests with coverage
@@ -225,4 +243,16 @@ jobs:
225243 bin/test.sh --coverage --raw
226244 # XXX Uncomment this and fix it properly later
227245 # 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"
228258 fi
.github/workflows/packdiff.ymlnew file+39
@@ -0,0 +1,39 @@
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.yml+54−46
@@ -1,7 +1,8 @@
11name: Regression checking
22
3−on: pull_request
4−
3+on:
4+ workflow_dispatch:
5+ pull_request:
56
67# References:
78# https://docs.github.com/en/actions/managing-workflow-runs/manually-running-a-workflow
@@ -16,30 +17,24 @@ on: pull_request
1617jobs:
1718 check-regressions:
1819 env:
19− CI_BENCH_SH: bin/bench.sh
2020 CI_BENCHMARKS_WITH_CUTOFF: >-
2121 Data.Array
22− Data.Array.Foreign
23− Data.Array.Prim
24− Data.Array.Prim.Pinned
22+ Data.MutArray
23+ Data.Array.Generic
24+ Data.Ring.Unboxed
2525 Data.Fold
26+ Data.Fold.Window
2627 Data.Parser
27− Data.Parser.ParserD
28− Data.Parser.ParserK
29− Data.SmallArray
30− Data.Stream.StreamD
31− Data.Stream.StreamDK
32− Data.Stream.StreamK:6
28+ Data.ParserK
29+ Data.StreamD
30+ Data.StreamK:6
3331 Data.Unfold
32+ Data.Stream
33+ Data.Stream.Concurrent
34+ Data.Stream.ConcurrentEager
35+ Data.Stream.ConcurrentInterleaved
36+ Data.Stream.ConcurrentOrdered
3437 FileSystem.Handle
35− Prelude.Ahead
36− Prelude.Async:12
37− Prelude.Parallel
38− Prelude.Serial
39− Prelude.WAsync:6
40− Prelude.WSerial
41− Prelude.ZipAsync
42− Prelude.ZipSerial
4338 Unicode.Char
4439 Unicode.Stream
4540 Unicode.Utf8
@@ -60,47 +55,60 @@ jobs:
6055 done
6156 echo "CI_BENCHMARKS=$CI_BENCHMARKS" >> $GITHUB_ENV
6257
63− - name: Setup haskell
64− uses: actions/setup-haskell@v1
65− with:
66− ghc-version: 8.8.4
67− cabal-version: 3.2
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
6867
6968 - uses: actions/cache@v2
70− name: Cache ~/.cabal and bench-report
69+ name: Cache ~/.cabal
7170 with:
7271 path: |
7372 ~/.cabal
74− ./benchmark/bench-report/bin/bench-report
7573 # Bump the key version to clear the cache
76− key: cache-v1
74+ key: cache-v2
7775
78− - name: Cache charts from master
79− id: cache-charts-master
76+ - name: Cache bench-runner from pr
77+ id: cache-bench-runner-pr
8078 uses: actions/cache@v2
8179 with:
82− path: charts-master
80+ path: bench-runner
8381 # Bump the key version to clear the cache
84− key: charts-master-v1
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=./
8596
8697 # -----------------------------------------------------------------
8798 # -- Generate reports for the base branch and upload
8899 # -----------------------------------------------------------------
89100
90101 - name: Checkout the base branch
91− if: steps.cache-charts-master.outputs.cache-hit != 'true'
92102 uses: actions/checkout@v2
93103 with:
94104 ref: master
105+ clean: false
95106
96107 - name: Run benchmarks
97− if: steps.cache-charts-master.outputs.cache-hit != 'true'
98108 run: |
99− chmod +x $CI_BENCH_SH
100− $CI_BENCH_SH --benchmarks "$CI_BENCHMARKS" --raw
109+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw
101110
102111 - name: Move charts to charts-master
103− if: steps.cache-charts-master.outputs.cache-hit != 'true'
104112 run: mv charts charts-master
105113
106114 # -----------------------------------------------------------------
@@ -117,8 +125,7 @@ jobs:
117125
118126 - name: Run benchmarks and append
119127 run: |
120− chmod +x $CI_BENCH_SH
121− $CI_BENCH_SH --benchmarks "$CI_BENCHMARKS" --raw --append
128+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw --append
122129
123130 # -----------------------------------------------------------------
124131 # -- Compare
@@ -126,12 +133,10 @@ jobs:
126133
127134 - name: List all benchmarks
128135 run: |
129− chmod +x $CI_BENCH_SH
130− $CI_BENCH_SH --no-measure
136+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --no-measure
131137
132138 - name: Compare benchmarks
133139 run: |
134− chmod +x $CI_BENCH_SH
135140
136141 EXIT_STATUS=0
137142
@@ -146,10 +151,13 @@ jobs:
146151
147152 echo
148153 echo "Checking $bname for regressions greater than $cutoff percent"
149− ! $CI_BENCH_SH --benchmarks "$bname" \
150− --fields "$CI_FIELDS" \
151− --no-measure --silent \
152− --diff-cutoff-percent $cutoff \
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 \
153161 | grep -v "^$"
154162 test $? -eq 1 && EXIT_STATUS=1
155163 done
.hlint.ignore+12−23
@@ -1,51 +1,40 @@
1−src/Streamly/Internal/Data/Stream/Prelude.hs
2−src/Streamly/Internal/Data/Stream/PreludeCommon.hs
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
36src/Streamly/Internal/Data/Stream/Serial.hs
47src/Streamly/Internal/Data/Stream/Zip.hs
5−src/Streamly/Internal/Data/Stream/StreamK/Type.hs
6−src/Streamly/Internal/Data/Pipe/Type.hs
7−src/Streamly/Internal/Data/SmallArray/Type.hs
8−src/Streamly/Internal/Unicode/Stream.hs
9−src/Streamly/Internal/Data/Array/Prim/Type.hs
10−src/Streamly/Internal/Data/Array/Prim/Mut/Type.hs
11−src/Streamly/Internal/Data/Array/Prim/MutTypesInclude.hs
12−src/Streamly/Internal/Data/Array/Prim/Pinned/Mut/Type.hs
13−src/Streamly/Internal/Data/Array/Prim/Pinned/Type.hs
14−src/Streamly/Internal/Data/Array/Prim/TypesInclude.hs
158test/Streamly/Test/Data/Array.hs
16−test/Streamly/Test/Data/Array/Prim.hs
17−test/Streamly/Test/Data/Array/Prim/Pinned.hs
18−test/Streamly/Test/Data/Array/Foreign.hs
199test/Streamly/Test/Data/Parser.hs
20−test/Streamly/Test/Data/Parser/ParserD.hs
10+test/Streamly/Test/Data/ParserK.hs
2111test/Streamly/Test/Data/SmallArray.hs
2212test/Streamly/Test/Data/Unfold.hs
2313test/Streamly/Test/FileSystem/Event.hs
2414test/Streamly/Test/Prelude/Concurrent.hs
15+test/Streamly/Test/Data/Stream/Concurrent.hs
16+test/lib/Streamly/Test/Prelude/Common.hs
2517test/Streamly/Test/Prelude/Fold.hs
2618test/Streamly/Test/Prelude/Rate.hs
2719test/Streamly/Test/Prelude/Serial.hs
2820test/Streamly/Test/Unicode/Stream.hs
21+test/Streamly/Test/Data/Unbox.hs
2922benchmark/lib/Streamly/Benchmark/Common.hs
3023benchmark/lib/Streamly/Benchmark/Common/Handle.hs
3124benchmark/lib/Streamly/Benchmark/Prelude.hs
3225benchmark/NanoBenchmarks.hs
3326benchmark/Streamly/Benchmark/Data/Array.hs
34−benchmark/Streamly/Benchmark/Data/ArrayOps.hs
35−benchmark/Streamly/Benchmark/Data/NestedUnfoldOps.hs
3627benchmark/Streamly/Benchmark/Data/Parser.hs
37−benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs
28+benchmark/Streamly/Benchmark/Data/ParserK.hs
3829benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs
3930benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs
4031benchmark/Streamly/Benchmark/Data/Unfold.hs
4132benchmark/Streamly/Benchmark/FileSystem/Handle.hs
4233benchmark/Streamly/Benchmark/Prelude/Async.hs
34+benchmark/Streamly/Benchmark/Prelude/Concurrent.hs
4335benchmark/Streamly/Benchmark/Prelude/Merge.hs
4436benchmark/Streamly/Benchmark/Prelude/Parallel.hs
4537benchmark/Streamly/Benchmark/Prelude/Rate.hs
46−benchmark/Streamly/Benchmark/Prelude/Serial/Exceptions.hs
47−benchmark/Streamly/Benchmark/Prelude/Serial/Nested.hs
48−benchmark/Streamly/Benchmark/Prelude/Serial/Split.hs
4938benchmark/Streamly/Benchmark/Prelude/WAsync.hs
5039benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs
51−benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs
40+benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs
.hlint.yaml+6−7
@@ -24,15 +24,14 @@
2424- ignore: {name: "Use uncurry"}
2525- ignore: {name: "Redundant $!"}
2626- ignore: {name: "Use fmap"}
27+- ignore: {name: "Use ++"}
2728
2829# Warnings ignored in specific places
29−- ignore: {name: "Use ++", within: Serial.Transformation}
30−- ignore: {name: "Use mapM", within: Serial.Transformation}
31−- ignore: {name: "Use traverse", within: Serial.Transformation}
32−
33−- ignore: {name: "Redundant <*", within: Serial.NestedStream}
34−- ignore: {name: "Use ++", within: Serial.NestedStream}
35−- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Char.Parser}
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}
3635
3736# Specify additional command line arguments
3837#
.packcheck.ignore+12−1
@@ -2,13 +2,16 @@
22.ghci
33.github/workflows/haskell.yml
44.github/workflows/regression-check.yml
5+.github/workflows/packdiff.yml
56.gitignore
67.hlint.ignore
78.hlint.yaml
89.packcheck.ignore
910appveyor.yml
10−benchmark/bench-report/default.nix
11+benchmark/bench-runner/default.nix
12+benchmark/bench-runner/cabal.project
1113bin/ghc.sh
14+bin/repl
1215bin/run-ci.sh
1316bin/run-repl-quick.sh
1417cabal.project
@@ -17,9 +20,17 @@ cabal.project.doctest
1720cabal.project.ghc-head
1821cabal.project.hpc-coveralls
1922cabal.project.O0
23+cabal.project.report
24+cabal.project.packdiff
25+cabal.project.streamly
2026cabal.project.Werror
2127cabal.project.Werror-nocode
28+core/
2229default.nix
2330examples/README.md
2431hie.yaml
2532stack.yaml
33+targets/default.nix
34+targets/cabal.project
35+test/test-runner/default.nix
36+test/test-runner/cabal.project
CHANGELOG.md+1−1
@@ -1 +1 @@
1−docs/ProjectRelated/Changelog.md
1+docs/User/Project/Changelog.md
LICENSE−254
@@ -26,172 +26,6 @@ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
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.
2828
29−-------------------------------------------------------------------------------
30−base-4.12.0.0 (http://hackage.haskell.org/package/base-4.12.0.0)
31−-------------------------------------------------------------------------------
32−This library (libraries/base) is derived from code from several
33−sources:
34−
35− * Code from the GHC project which is largely (c) The University of
36− Glasgow, and distributable under a BSD-style license (see below),
37−
38− * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
39− and freely redistributable (but see the full license for
40− restrictions).
41−
42− * Code from the Haskell Foreign Function Interface specification,
43− which is (c) Manuel M. T. Chakravarty and freely redistributable
44− (but see the full license for restrictions).
45−
46−The full text of these licenses is reproduced below. All of the
47−licenses are BSD-style or compatible.
48−
49−The Glasgow Haskell Compiler License
50−
51−Copyright 2004, The University Court of the University of Glasgow.
52−All rights reserved.
53−
54−Redistribution and use in source and binary forms, with or without
55−modification, are permitted provided that the following conditions are met:
56−
57−- Redistributions of source code must retain the above copyright notice,
58−this list of conditions and the following disclaimer.
59−
60−- Redistributions in binary form must reproduce the above copyright notice,
61−this list of conditions and the following disclaimer in the documentation
62−and/or other materials provided with the distribution.
63−
64−- Neither name of the University nor the names of its contributors may be
65−used to endorse or promote products derived from this software without
66−specific prior written permission.
67−
68−THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
69−GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
70−INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
71−FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
72−UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
73−FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
74−DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
75−SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
76−CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
77−LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
78−OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
79−DAMAGE.
80−
81−Code derived from the document "Report on the Programming Language
82−Haskell 98", is distributed under the following license:
83−
84− Copyright (c) 2002 Simon Peyton Jones
85−
86− The authors intend this Report to belong to the entire Haskell
87− community, and so we grant permission to copy and distribute it for
88− any purpose, provided that it is reproduced in its entirety,
89− including this Notice. Modified versions of this Report may also be
90− copied and distributed for any purpose, provided that the modified
91− version is clearly presented as such, and that it does not claim to
92− be a definition of the Haskell 98 Language.
93−
94−Code derived from the document "The Haskell 98 Foreign Function
95−Interface, An Addendum to the Haskell 98 Report" is distributed under
96−the following license:
97−
98− Copyright (c) 2002 Manuel M. T. Chakravarty
99−
100− The authors intend this Report to belong to the entire Haskell
101− community, and so we grant permission to copy and distribute it for
102− any purpose, provided that it is reproduced in its entirety,
103− including this Notice. Modified versions of this Report may also be
104− copied and distributed for any purpose, provided that the modified
105− version is clearly presented as such, and that it does not claim to
106− be a definition of the Haskell 98 Foreign Function Interface.
107−
108−-------------------------------------------------------------------------------
109−bjoern-2008-2009 (http://bjoern.hoehrmann.de/utf-8/decoder/dfa/)
110−-------------------------------------------------------------------------------
111−Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de>
112−
113−Permission is hereby granted, free of charge, to any person obtaining a copy of
114−this software and associated documentation files (the "Software"), to deal in
115−the Software without restriction, including without limitation the rights to
116−use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
117−of the Software, and to permit persons to whom the Software is furnished to do
118−so, subject to the following conditions:
119−
120−The above copyright notice and this permission notice shall be included in all
121−copies or substantial portions of the Software.
122−
123−THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
124−IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
125−FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
126−AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
127−LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
128−OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
129−SOFTWARE.
130−
131−-------------------------------------------------------------------------------
132−clock-0.7.2 (http://hackage.haskell.org/package/clock-0.7.2)
133−-------------------------------------------------------------------------------
134−Copyright (c) 2009-2012, Cetin Sert
135−Copyright (c) 2010, Eugene Kirpichov
136−
137−All rights reserved.
138−
139−Redistribution and use in source and binary forms, with or without
140−modification, are permitted provided that the following conditions are
141−met:
142−
143− * Redistributions of source code must retain the above copyright
144− notice, this list of conditions and the following disclaimer.
145−
146− * Redistributions in binary form must reproduce the above
147− copyright notice, this list of conditions and the following
148− disclaimer in the documentation and/or other materials provided
149− with the distribution.
150−
151− * The names of contributors may not be used to endorse or promote
152− products derived from this software without specific prior
153− written permission.
154−
155−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
156−"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
157−LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
158−A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
159−OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
160−SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
161−LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
162−DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
163−THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
164−(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
165−OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
166−
167−-------------------------------------------------------------------------------
168−foldl-1.4.5 (http://hackage.haskell.org/package/foldl-1.4.5)
169−-------------------------------------------------------------------------------
170−Copyright (c) 2013 Gabriel Gonzalez
171−All rights reserved.
172−
173−Redistribution and use in source and binary forms, with or without modification,
174−are permitted provided that the following conditions are met:
175− * Redistributions of source code must retain the above copyright notice,
176− this list of conditions and the following disclaimer.
177− * Redistributions in binary form must reproduce the above copyright notice,
178− this list of conditions and the following disclaimer in the documentation
179− and/or other materials provided with the distribution.
180− * Neither the name of Gabriel Gonzalez nor the names of other contributors
181− may be used to endorse or promote products derived from this software
182− without specific prior written permission.
183−
184−THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
185−ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
186−WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
187−DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
188−ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
189−(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
190−LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
191−ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
192−(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
193−SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
194−
19529-------------------------------------------------------------------------------
19630fsnotify-0.3.0.1 (http://hackage.haskell.org/package/fsnotify-0.3.0.1/)
19731-------------------------------------------------------------------------------
@@ -259,91 +93,3 @@ DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25993THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26094(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26195OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
262−
263−-------------------------------------------------------------------------------
264−primitive-0.7.0.0 (https://hackage.haskell.org/package/primitive-0.7.0.0)
265−-------------------------------------------------------------------------------
266−Copyright (c) 2008-2009, Roman Leshchinskiy
267−All rights reserved.
268−
269−Redistribution and use in source and binary forms, with or without
270−modification, are permitted provided that the following conditions are met:
271−
272−- Redistributions of source code must retain the above copyright notice,
273−this list of conditions and the following disclaimer.
274−
275−- Redistributions in binary form must reproduce the above copyright notice,
276−this list of conditions and the following disclaimer in the documentation
277−and/or other materials provided with the distribution.
278−
279−- Neither name of the University nor the names of its contributors may be
280−used to endorse or promote products derived from this software without
281−specific prior written permission.
282−
283−THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
284−GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
285−INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
286−FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
287−UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
288−FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
289−DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
290−SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
291−CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
292−LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
293−OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
294−DAMAGE.
295−
296−-------------------------------------------------------------------------------
297−transient-0.5.5 (http://hackage.haskell.org/package/transient-0.5.5)
298−-------------------------------------------------------------------------------
299−Copyright © 2014-2016 Alberto G. Corona <https://github.com/agocorona>
300−
301−Permission is hereby granted, free of charge, to any person obtaining a copy of
302−this software and associated documentation files (the "Software"), to deal in
303−the Software without restriction, including without limitation the rights to
304−use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
305−the Software, and to permit persons to whom the Software is furnished to do so,
306−subject to the following conditions:
307−
308−The above copyright notice and this permission notice shall be included in all
309−copies or substantial portions of the Software.
310−
311−THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
312−IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
313−FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
314−COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
315−IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
316−CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
317−
318−-------------------------------------------------------------------------------
319−vector-0.12.0.2 (http://hackage.haskell.org/package/vector-0.12.0.2)
320−-------------------------------------------------------------------------------
321−Copyright (c) 2008-2012, Roman Leshchinskiy
322−All rights reserved.
323−
324−Redistribution and use in source and binary forms, with or without
325−modification, are permitted provided that the following conditions are met:
326−
327−- Redistributions of source code must retain the above copyright notice,
328−this list of conditions and the following disclaimer.
329−
330−- Redistributions in binary form must reproduce the above copyright notice,
331−this list of conditions and the following disclaimer in the documentation
332−and/or other materials provided with the distribution.
333−
334−- Neither name of the University nor the names of its contributors may be
335−used to endorse or promote products derived from this software without
336−specific prior written permission.
337−
338−THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
339−GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
340−INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
341−FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
342−UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
343−FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
344−DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
345−SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
346−CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
347−LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
348−OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
349−DAMAGE.
README.md+1−1
@@ -1 +1 @@
1−docs/Tutorials/Introduction.md
1+docs/User/Project/README.md
appveyor.yml+2
@@ -14,6 +14,8 @@ environment:
1414 # ------------------------------------------------------------------------
1515 # Common options
1616 # ------------------------------------------------------------------------
17+ # GHC 9.2.7 onwards redundant constraint warnings are incompatible with
18+ # older versions
1719 GHC_OPTIONS: "-Werror"
1820 CABAL_REINIT_CONFIG: "y"
1921 LC_ALL: "C.UTF-8"
benchmark/NanoBenchmarks.hs+27−22
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-------------------------------------------------------------------------------
24-- Investigate specific benchmarks more closely in isolation, possibly looking
35-- at GHC generated code for optimizing specific problematic cases.
@@ -6,30 +8,27 @@
68{-# LANGUAGE FlexibleContexts #-}
79{-# LANGUAGE ScopedTypeVariables #-}
810
9−import Streamly.Prelude (SerialT)
10−import Streamly.Internal.Data.SVar (MonadAsync)
11+import Data.Char (ord)
12+import Streamly.Internal.Data.Stream (Stream)
13+import System.IO (hSeek, SeekMode(..), openFile, IOMode(..))
1114
12−import qualified Streamly.Data.Array.Foreign as A
13−import qualified Streamly.FileSystem.Handle as FH
15+import qualified Streamly.Data.Array as A
1416import qualified Streamly.Internal.FileSystem.Handle as IFH
1517import qualified Streamly.Data.Fold as FL
18+import qualified Streamly.Internal.Data.Stream as S
1619import 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
1920
20−import Data.Char (ord)
21−import Gauge
22−import System.IO (hSeek, SeekMode(..), openFile, IOMode(..))
21+import Test.Tasty.Bench
2322import System.Random
2423
2524maxValue :: Int
2625maxValue = 100000
2726
28−-- type Stream = K.Stream
29−type Stream = SerialT
27+drain :: Monad m => S.Stream m a -> m ()
28+drain = S.fold FL.drain
3029
3130{-# INLINE sourceUnfoldrM #-}
32−sourceUnfoldrM :: MonadAsync m => Stream m Int
31+sourceUnfoldrM :: Monad m => Stream m Int
3332sourceUnfoldrM = S.unfoldrM step 0
3433 where
3534 step cnt =
@@ -38,7 +37,7 @@ sourceUnfoldrM = S.unfoldrM step 0
3837 else return (Just (cnt, cnt + 1))
3938
4039{-# INLINE sourceUnfoldrMN #-}
41−sourceUnfoldrMN :: MonadAsync m => Int -> Stream m Int
40+sourceUnfoldrMN :: Monad m => Int -> Stream m Int
4241sourceUnfoldrMN n = S.unfoldrM step n
4342 where
4443 step cnt =
@@ -67,7 +66,7 @@ takeAllDropOne = S.drop 1 . S.take maxValue
6766
6867{-# INLINE takeDrop #-}
6968takeDrop :: Monad m => Stream m Int -> m ()
70−takeDrop = S.drain .
69+takeDrop = drain .
7170 takeAllDropOne . takeAllDropOne . takeAllDropOne . takeAllDropOne
7271
7372-------------------------------------------------------------------------------
@@ -82,7 +81,7 @@ dropWhileFalse = S.dropWhile (> maxValue)
8281
8382{-# INLINE dropWhileFalseX4 #-}
8483dropWhileFalseX4 :: Monad m => Stream m Int -> m ()
85−dropWhileFalseX4 = S.drain
84+dropWhileFalseX4 = drain
8685 . dropWhileFalse . dropWhileFalse . dropWhileFalse . dropWhileFalse
8786
8887-------------------------------------------------------------------------------
@@ -91,7 +90,7 @@ dropWhileFalseX4 = S.drain
9190
9291{-# INLINE iterateSource #-}
9392iterateSource
94− :: MonadAsync m
93+ :: Monad m
9594 => (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
9695iterateSource g i n = f i (sourceUnfoldrMN n)
9796 where
@@ -103,20 +102,26 @@ iterateSource g i n = f i (sourceUnfoldrMN n)
103102main :: IO ()
104103main = do
105104 defaultMain [bench "unfoldr" $ nfIO $
106− randomRIO (1,1) >>= \n -> S.drain (sourceUnfoldr n)]
105+ randomRIO (1,1) >>= \n -> drain (sourceUnfoldr n)]
107106 defaultMain [bench "take-drop" $ nfIO $ takeDrop sourceUnfoldrM]
108107 defaultMain [bench "dropWhileFalseX4" $
109108 nfIO $ dropWhileFalseX4 sourceUnfoldrM]
110109 defaultMain [bench "iterate-mapM" $
111− nfIO $ S.drain $ iterateSource (S.mapM return) 100000 10]
110+ nfIO $ drain $ iterateSource (S.mapM return) 100000 10]
112111
113112 inText <- openFile "benchmark/text-processing/gutenberg-500.txt" ReadMode
114113 defaultMain [mkBenchText "splitOn abc...xyz" inText $ do
115− (S.length $ Internal.splitOnSeq (A.fromList $ map (fromIntegral . ord)
116− "abcdefghijklmnopqrstuvwxyz") FL.drain
117− $ IFH.getBytes inText) >>= print
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
118123 ]
119124 where
120125
121126 mkBenchText name h action =
122− bench name $ perRunEnv (hSeek h AbsoluteSeek 0) (\_ -> action)
127+ env (hSeek h AbsoluteSeek 0) (\_ -> bench name $ nfIO action)
benchmark/Streamly/Benchmark/Data/Array.hs+33−4
@@ -1,3 +1,6 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+{-# OPTIONS_GHC -Wno-orphans #-}
3+
14{-# LANGUAGE CPP #-}
25
36#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
@@ -5,18 +8,31 @@
58import Control.DeepSeq (deepseq)
69
710import qualified Streamly.Internal.Data.Array as IA
11+import qualified GHC.Exts as GHC
12+
13+-- import qualified Streamly.Data.Array as A
814import qualified Streamly.Internal.Data.Array as A
15+
916type Stream = A.Array
1017
1118#include "Streamly/Benchmark/Data/Array/Common.hs"
1219
20+instance NFData (A.Array a) where
21+ {-# INLINE rnf #-}
22+ rnf _ = ()
23+
1324-------------------------------------------------------------------------------
1425-- Benchmark helpers
1526-------------------------------------------------------------------------------
1627
28+-- Drain a source that generates a pure array
29+{-# INLINE benchPureSrc #-}
30+benchPureSrc :: String -> (Int -> Stream a) -> Benchmark
31+benchPureSrc name src = benchPure name src id
32+
1733-- Drain a source that generates an array in the IO monad
1834{-# INLINE benchIOSrc #-}
19−benchIOSrc :: NFData a => String -> (Int -> IO (Stream a)) -> Benchmark
35+benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
2036benchIOSrc name src = benchIO name src id
2137
2238-------------------------------------------------------------------------------
@@ -27,7 +43,6 @@ benchIOSrc name src = benchIO name src id
2743sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
2844sourceIntFromToFromList value n = P.return $ A.fromListN value [n..n + value]
2945
30−
3146{-# INLINE readInstance #-}
3247readInstance :: P.String -> Stream Int
3348readInstance str =
@@ -48,6 +63,14 @@ foldableSum = P.sum
4863-}
4964#endif
5065
66+{-# INLINE sourceIsList #-}
67+sourceIsList :: Int -> Int -> Stream Int
68+sourceIsList value n = GHC.fromList [n..n+value]
69+
70+{-# INLINE sourceIsString #-}
71+sourceIsString :: Int -> Int -> Stream P.Char
72+sourceIsString value n = GHC.fromString (P.replicate (n + value) 'a')
73+
5174{-# INLINE sourceIntFromToFromStream #-}
5275sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
5376sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
@@ -61,15 +84,21 @@ o_1_space_generation value =
6184 [ bgroup
6285 "generation"
6386 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
64− , let testStr = mkListString value
87+ , let testStr = "fromList " ++ mkListString value
6588 in testStr `deepseq` bench "read" (nf readInstance testStr)
89+ , benchPureSrc "writeN . IsList.fromList" (sourceIsList value)
90+ , benchPureSrc
91+ "writeN . IsString.fromString"
92+ (sourceIsString value)
93+
6694 ]
6795 ]
6896
6997o_1_space_elimination :: Int -> [Benchmark]
7098o_1_space_elimination value =
7199 [ bgroup "elimination"
72− [ benchFold "writeLastN.1"
100+ [ benchPureSink value "length . IsList.toList" (length . GHC.toList)
101+ , benchFold "writeLastN.1"
73102 (S.fold (IA.writeLastN 1)) (P.sourceUnfoldrM value)
74103 , benchFold "writeLastN.10"
75104 (S.fold (IA.writeLastN 10)) (P.sourceUnfoldrM value)
benchmark/Streamly/Benchmark/Data/Array/Common.hs+8−11
@@ -1,5 +1,3 @@
1−
2−
31-------------------------------------------------------------------------------
42-- Benchmark helpers
53-------------------------------------------------------------------------------
@@ -68,14 +66,14 @@ scanl' , scanl1', map
6866
6967{-# INLINE onArray #-}
7068onArray
71− :: MonadIO m => Int -> (S.SerialT m Int -> S.SerialT m Int)
69+ :: MonadIO m => Int -> (Stream.Stream m Int -> Stream.Stream m Int)
7270 -> Stream Int
7371 -> m (Stream Int)
74−onArray value f arr = S.fold (A.writeN value) $ f $ S.unfold A.read arr
72+onArray value f arr = S.fold (A.writeN value) $ f $ S.unfold A.reader arr
7573
76−scanl' value n = composeN n $ onArray value $ S.scanl' (+) 0
77−scanl1' value n = composeN n $ onArray value $ S.scanl1' (+)
78−map value n = composeN n $ onArray value $ S.map (+1)
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)
7977-- map n = composeN n $ A.map (+1)
8078
8179{-# INLINE eqInstance #-}
@@ -100,8 +98,7 @@ showInstance = P.show
10098
10199{-# INLINE pureFoldl' #-}
102100pureFoldl' :: MonadIO m => Stream Int -> m Int
103−pureFoldl' = S.foldl' (+) 0 . S.unfold A.read
104−
101+pureFoldl' = S.fold (Fold.foldl' (+) 0) . S.unfold A.reader
105102
106103-------------------------------------------------------------------------------
107104-- Elimination
@@ -109,11 +106,11 @@ pureFoldl' = S.foldl' (+) 0 . S.unfold A.read
109106
110107{-# INLINE unfoldReadDrain #-}
111108unfoldReadDrain :: MonadIO m => Stream Int -> m ()
112−unfoldReadDrain = S.drain . S.unfold A.read
109+unfoldReadDrain = S.fold Fold.drain . S.unfold A.reader
113110
114111{-# INLINE toStreamRevDrain #-}
115112toStreamRevDrain :: MonadIO m => Stream Int -> m ()
116−toStreamRevDrain = S.drain . A.toStreamRev
113+toStreamRevDrain = S.fold Fold.drain . A.readRev
117114
118115-------------------------------------------------------------------------------
119116-- Bench groups
benchmark/Streamly/Benchmark/Data/Array/CommonImports.hs+7−8
@@ -1,17 +1,16 @@
11{-# LANGUAGE FlexibleContexts #-}
22
33import Control.DeepSeq (NFData(..))
4+import Control.Monad.IO.Class (MonadIO)
5+import Data.Functor ((<&>))
46import System.Random (randomRIO)
57
6−import qualified Streamly.Prelude as S
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
711
8−import Gauge
12+import Test.Tasty.Bench
913import Streamly.Benchmark.Common hiding (benchPureSrc)
10−import qualified Streamly.Benchmark.Prelude as P
11−
12−
13−import Control.Monad.IO.Class (MonadIO)
14+import qualified Stream.Common as P
1415
1516import Prelude as P hiding (map)
16−
17−import Data.Functor ((<&>))
benchmark/Streamly/Benchmark/Data/Array/Foreign/Mut.hsdeleted−94
@@ -1,94 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.Array.Foreign.Mut
3−-- Copyright : (c) 2021 Composewell Technologies
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−
7−{-# LANGUAGE CPP #-}
8−{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−
11−#ifdef __HADDOCK_VERSION__
12−#undef INSPECTION
13−#endif
14−
15−#ifdef INSPECTION
16−{-# LANGUAGE TemplateHaskell #-}
17−{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
18−#endif
19−
20−module Main (main) where
21−
22−import Control.DeepSeq (NFData(..))
23−import Streamly.Prelude (MonadAsync, SerialT, IsStream)
24−import System.Random (randomRIO)
25−
26−import qualified Streamly.Prelude as Stream
27−import qualified Streamly.Internal.Data.Array.Foreign as Array
28−import qualified Streamly.Internal.Data.Array.Foreign.Mut as MArray
29−
30−import Gauge hiding (env)
31−import Streamly.Benchmark.Common
32−
33−-------------------------------------------------------------------------------
34−-- Utilities
35−-------------------------------------------------------------------------------
36−
37−{-# INLINE sourceUnfoldrM #-}
38−sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
39−sourceUnfoldrM value n = Stream.unfoldrM step n
40− where
41− step cnt =
42− if cnt > n + value
43− then return Nothing
44− else return (Just (cnt, cnt + 1))
45−
46−{-# INLINE benchIO #-}
47−benchIO
48− :: NFData b
49− => String -> (Int -> a) -> (a -> IO b) -> Benchmark
50−benchIO name src sink =
51− bench name $ nfIO $ randomRIO (1,1) >>= sink . src
52−
53−o_1_space_serial_marray ::
54− Int -> (MArray.Array Int, Array.Array Int) -> [Benchmark]
55−o_1_space_serial_marray value ~(array, indices) =
56− [ benchIO "partitionBy (< 0)" (const array)
57− $ MArray.partitionBy (< 0)
58− , benchIO "partitionBy (> 0)" (const array)
59− $ MArray.partitionBy (> 0)
60− , benchIO "partitionBy (< value/2)" (const array)
61− $ MArray.partitionBy (< (value `div` 2))
62− , benchIO "partitionBy (> value/2)" (const array)
63− $ MArray.partitionBy (> (value `div` 2))
64− , benchIO "strip (< value/2 || > value/2)" (const array)
65− $ MArray.strip (\x -> x < value `div` 2 || x > value `div` 2)
66− , benchIO "strip (> 0)" (const array)
67− $ MArray.strip (> 0)
68− , benchIO "modifyIndices (+ 1)" (const indices)
69− $ Stream.fold (MArray.modifyIndices (\_idx val -> val + 1) array)
70− . Stream.unfold Array.read
71− ]
72−
73−-------------------------------------------------------------------------------
74−-- Driver
75−-------------------------------------------------------------------------------
76−
77−moduleName :: String
78−moduleName = "Data.Array.Foreign.Mut"
79−
80−main :: IO ()
81−main = do
82− runWithCLIOptsEnv defaultStreamSize alloc allBenchmarks
83−
84− where
85−
86− alloc value = do
87− marr <- MArray.fromStream (sourceUnfoldrM value 0 :: SerialT IO Int)
88− indices <- Array.fromStream (sourceUnfoldrM value 0 :: SerialT IO Int)
89− return (marr, indices)
90−
91− allBenchmarks array value =
92− [ bgroup (o_1_space_prefix moduleName) $
93− o_1_space_serial_marray value array
94− ]
benchmark/Streamly/Benchmark/Data/Array/Foreign.hs → benchmark/Streamly/Benchmark/Data/Array/Generic.hsrenamed+15−28
@@ -1,30 +1,30 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+{-# OPTIONS_GHC -Wno-orphans #-}
3+
14{-# LANGUAGE CPP #-}
25
36#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
47
58import Control.DeepSeq (deepseq)
69
7−import qualified Streamly.Internal.Data.Array.Foreign as IA
8−import qualified GHC.Exts as GHC
10+import qualified Streamly.Internal.Data.Array.Generic as IA
11+import qualified Streamly.Internal.Data.Array.Generic as A
912
10−import qualified Streamly.Data.Array.Foreign as A
11−import qualified Streamly.Internal.Data.Array.Foreign as A
1213type Stream = A.Array
1314
1415#include "Streamly/Benchmark/Data/Array/Common.hs"
1516
17+instance NFData a => NFData (A.Array a) where
18+ {-# INLINE rnf #-}
19+ rnf = A.foldl' (\_ x -> rnf x) ()
20+
1621-------------------------------------------------------------------------------
1722-- Benchmark helpers
1823-------------------------------------------------------------------------------
1924
20−-- Drain a source that generates a pure array
21−{-# INLINE benchPureSrc #-}
22−benchPureSrc :: String -> (Int -> Stream a) -> Benchmark
23−benchPureSrc name src = benchPure name src id
24−
2525-- Drain a source that generates an array in the IO monad
2626{-# INLINE benchIOSrc #-}
27−benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
27+benchIOSrc :: NFData a => String -> (Int -> IO (Stream a)) -> Benchmark
2828benchIOSrc name src = benchIO name src id
2929
3030-------------------------------------------------------------------------------
@@ -55,17 +55,10 @@ foldableSum = P.sum
5555-}
5656#endif
5757
58−{-# INLINE sourceIsList #-}
59−sourceIsList :: Int -> Int -> Stream Int
60−sourceIsList value n = GHC.fromList [n..n+value]
61−
62−{-# INLINE sourceIsString #-}
63−sourceIsString :: Int -> Int -> Stream P.Char
64−sourceIsString value n = GHC.fromString (P.replicate (n + value) 'a')
65−
6658{-# INLINE sourceIntFromToFromStream #-}
6759sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
68−sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
60+sourceIntFromToFromStream value n =
61+ S.fold A.write $ S.enumerateFromTo n (n + value)
6962
7063-------------------------------------------------------------------------------
7164-- Bench groups
@@ -76,21 +69,15 @@ o_1_space_generation value =
7669 [ bgroup
7770 "generation"
7871 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
79− , let testStr = mkListString value
72+ , let testStr = "fromList " ++ mkListString value
8073 in testStr `deepseq` bench "read" (nf readInstance testStr)
81− , benchPureSrc "writeN . IsList.fromList" (sourceIsList value)
82− , benchPureSrc
83− "writeN . IsString.fromString"
84− (sourceIsString value)
85−
8674 ]
8775 ]
8876
8977o_1_space_elimination :: Int -> [Benchmark]
9078o_1_space_elimination value =
9179 [ bgroup "elimination"
92− [ benchPureSink value "length . IsList.toList" (length . GHC.toList)
93− , benchFold "writeLastN.1"
80+ [ benchFold "writeLastN.1"
9481 (S.fold (IA.writeLastN 1)) (P.sourceUnfoldrM value)
9582 , benchFold "writeLastN.10"
9683 (S.fold (IA.writeLastN 10)) (P.sourceUnfoldrM value)
@@ -114,7 +101,7 @@ o_n_heap_serial value =
114101 ]
115102
116103moduleName :: String
117−moduleName = "Data.Array.Foreign"
104+moduleName = "Data.Array.Generic"
118105
119106defStreamSize :: Int
120107defStreamSize = defaultStreamSize
benchmark/Streamly/Benchmark/Data/Array/Prim.hsdeleted−57
@@ -1,57 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−
3−#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
4−
5−import qualified Streamly.Internal.Data.Array.Prim as A
6−type Stream = A.Array
7−
8−#include "Streamly/Benchmark/Data/Array/Common.hs"
9−
10−-------------------------------------------------------------------------------
11−-- Benchmark helpers
12−-------------------------------------------------------------------------------
13−
14−-- Drain a source that generates an array in the IO monad
15−{-# INLINE benchIOSrc #-}
16−benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
17−benchIOSrc name src = benchIO name src id
18−
19−-------------------------------------------------------------------------------
20−-- Bench Ops
21−-------------------------------------------------------------------------------
22−
23−{-# INLINE sourceIntFromToFromList #-}
24−sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
25−sourceIntFromToFromList value n = P.return $ A.fromListN value [n..n + value]
26−
27−-- CPP:
28−{-# INLINE sourceIntFromToFromStream #-}
29−sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
30−sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
31−
32−-------------------------------------------------------------------------------
33−-- Bench groups
34−-------------------------------------------------------------------------------
35−
36−o_1_space_generation :: Int -> [Benchmark]
37−o_1_space_generation value =
38− [ bgroup
39− "generation"
40− [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
41− ]
42− ]
43−
44−moduleName :: String
45−moduleName = "Data.Array.Prim"
46−
47−defStreamSize :: Int
48−defStreamSize = defaultStreamSize
49−
50−main :: IO ()
51−main = runWithCLIOpts defStreamSize allBenchmarks
52−
53− where
54−
55− allBenchmarks size =
56− bgroup (o_1_space_prefix moduleName) (o_1_space_generation size)
57− : commonBenchmarks size
benchmark/Streamly/Benchmark/Data/Array/Prim/Pinned.hsdeleted−57
@@ -1,57 +0,0 @@
1−{-# LANGUAGE CPP #-}
2−
3−#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
4−
5−import qualified Streamly.Internal.Data.Array.Prim.Pinned as A
6−type Stream = A.Array
7−
8−#include "Streamly/Benchmark/Data/Array/Common.hs"
9−
10−-------------------------------------------------------------------------------
11−-- Benchmark helpers
12−-------------------------------------------------------------------------------
13−
14−-- Drain a source that generates an array in the IO monad
15−{-# INLINE benchIOSrc #-}
16−benchIOSrc :: String -> (Int -> IO (Stream a)) -> Benchmark
17−benchIOSrc name src = benchIO name src id
18−
19−-------------------------------------------------------------------------------
20−-- Bench Ops
21−-------------------------------------------------------------------------------
22−
23−{-# INLINE sourceIntFromToFromList #-}
24−sourceIntFromToFromList :: MonadIO m => Int -> Int -> m (Stream Int)
25−sourceIntFromToFromList value n = P.return $ A.fromListN value [n..n + value]
26−
27−-- CPP:
28−{-# INLINE sourceIntFromToFromStream #-}
29−sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
30−sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
31−
32−-------------------------------------------------------------------------------
33−-- Bench groups
34−-------------------------------------------------------------------------------
35−
36−o_1_space_generation :: Int -> [Benchmark]
37−o_1_space_generation value =
38− [ bgroup
39− "generation"
40− [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
41− ]
42− ]
43−
44−moduleName :: String
45−moduleName = "Data.Array.Prim.Pinned"
46−
47−defStreamSize :: Int
48−defStreamSize = defaultStreamSize
49−
50−main :: IO ()
51−main = runWithCLIOpts defStreamSize allBenchmarks
52−
53− where
54−
55− allBenchmarks size =
56− bgroup (o_1_space_prefix moduleName) (o_1_space_generation size)
57− : commonBenchmarks size
benchmark/Streamly/Benchmark/Data/Array/SmallArray.hs+2
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13{-# LANGUAGE CPP #-}
24
35#include "Streamly/Benchmark/Data/Array/CommonImports.hs"
benchmark/Streamly/Benchmark/Data/Array/Stream/Foreign.hs → benchmark/Streamly/Benchmark/Data/Array/Stream.hsrenamed+80−44
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Streamly.Benchmark.Data.ParserD
35-- Copyright : (c) 2020 Composewell Technologies
@@ -24,31 +26,35 @@ module Main
2426 ) where
2527
2628import Control.DeepSeq (NFData(..))
27−import Control.Monad (void)
28−import Control.Monad.Catch (MonadThrow)
29+import Control.Monad (void, when)
30+import Control.Monad.Catch (MonadCatch)
2931import Data.Functor.Identity (runIdentity)
32+import Data.Maybe (isJust)
3033import Data.Word (Word8)
34+import Streamly.Internal.Data.Stream (Stream)
35+import Streamly.Internal.Data.StreamK (StreamK)
3136import System.IO (Handle)
3237import System.Random (randomRIO)
3338import Prelude hiding ()
3439
35−import qualified Streamly.Prelude as Stream
36−import qualified Streamly.Internal.Data.Array.Foreign as Array
37−import qualified Streamly.Internal.Data.Array.Stream.Foreign as ArrayStream
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
3843import qualified Streamly.Internal.Data.Fold as Fold
39−import qualified Streamly.Internal.Data.Parser.ParserD as ParserD
40−import qualified Streamly.Internal.Data.Stream.IsStream as Stream (arraysOf)
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
4147import qualified Streamly.Internal.FileSystem.Handle as Handle
4248import qualified Streamly.Internal.Unicode.Stream as Unicode
4349
44−import Gauge hiding (env)
45−import Streamly.Prelude (SerialT, MonadAsync, IsStream)
50+import Test.Tasty.Bench hiding (env)
4651import Streamly.Benchmark.Common
4752import Streamly.Benchmark.Common.Handle
53+import Control.Monad.IO.Class (MonadIO)
4854
4955#ifdef INSPECTION
50−import Foreign.Storable (Storable)
51−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
56+import Streamly.Internal.Data.MutByteArray (Unbox)
57+import Streamly.Internal.Data.Stream (Step(..))
5258import Test.Inspection
5359#endif
5460
@@ -59,7 +65,7 @@ import Test.Inspection
5965-- XXX these can be moved to the common module
6066
6167{-# INLINE sourceUnfoldrM #-}
62−sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
68+sourceUnfoldrM :: MonadIO m => Int -> Int -> Stream.Stream m Int
6369sourceUnfoldrM value n = Stream.unfoldrM step n
6470 where
6571 step cnt =
@@ -70,7 +76,7 @@ sourceUnfoldrM value n = Stream.unfoldrM step n
7076{-# INLINE benchIO #-}
7177benchIO
7278 :: NFData b
73− => String -> (Int -> t IO a) -> (t IO a -> IO b) -> Benchmark
79+ => String -> (Int -> Stream IO a) -> (Stream IO a -> IO b) -> Benchmark
7480benchIO name src sink =
7581 bench name $ nfIO $ randomRIO (1,1) >>= sink . src
7682
@@ -81,7 +87,7 @@ benchIO name src sink =
8187-- | Get the last byte from a file bytestream.
8288toChunksLast :: Handle -> IO (Maybe Word8)
8389toChunksLast inh = do
84− let s = Handle.getChunks inh
90+ let s = Handle.readChunks inh
8591 larr <- Stream.last s
8692 return $ case larr of
8793 Nothing -> Nothing
@@ -95,8 +101,8 @@ inspect $ 'toChunksLast `hasNoType` ''Step
95101-- | Count the number of bytes in a file.
96102toChunksSumLengths :: Handle -> IO Int
97103toChunksSumLengths inh =
98− let s = Handle.getChunks inh
99− in Stream.sum (Stream.map Array.length s)
104+ let s = Handle.readChunks inh
105+ in Stream.fold Fold.sum (Stream.map Array.length s)
100106
101107#ifdef INSPECTION
102108inspect $ hasNoTypeClasses 'toChunksSumLengths
@@ -106,8 +112,8 @@ inspect $ 'toChunksSumLengths `hasNoType` ''Step
106112-- | Sum the bytes in a file.
107113toChunksCountBytes :: Handle -> IO Word8
108114toChunksCountBytes inh = do
109− let foldlArr' f z = runIdentity . Stream.foldl' f z . Array.toStream
110− let s = Handle.getChunks inh
115+ let foldlArr' f z = runIdentity . Stream.foldl' f z . Array.read
116+ let s = Handle.readChunks inh
111117 Stream.foldl' (\acc arr -> acc + foldlArr' (+) 0 arr) 0 s
112118
113119#ifdef INSPECTION
@@ -117,7 +123,7 @@ inspect $ 'toChunksCountBytes `hasNoType` ''Step
117123
118124toChunksDecodeUtf8Arrays :: Handle -> IO ()
119125toChunksDecodeUtf8Arrays =
120− Stream.drain . Unicode.decodeUtf8Arrays . Handle.getChunks
126+ Stream.drain . Unicode.decodeUtf8Chunks . Handle.readChunks
121127
122128#ifdef INSPECTION
123129inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
@@ -131,7 +137,9 @@ inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
131137-- | Count the number of lines in a file.
132138toChunksSplitOnSuffix :: Handle -> IO Int
133139toChunksSplitOnSuffix =
134− Stream.length . ArrayStream.splitOnSuffix 10 . Handle.getChunks
140+ Stream.fold Fold.length
141+ . ArrayStream.splitOnSuffix 10
142+ . Handle.readChunks
135143
136144#ifdef INSPECTION
137145inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
@@ -141,7 +149,10 @@ inspect $ 'toChunksSplitOnSuffix `hasNoType` ''Step
141149-- XXX use a word splitting combinator instead of splitOn and test it.
142150-- | Count the number of words in a file.
143151toChunksSplitOn :: Handle -> IO Int
144−toChunksSplitOn = Stream.length . ArrayStream.splitOn 32 . Handle.getChunks
152+toChunksSplitOn =
153+ Stream.fold Fold.length
154+ . ArrayStream.splitOn 32
155+ . Handle.readChunks
145156
146157#ifdef INSPECTION
147158inspect $ hasNoTypeClasses 'toChunksSplitOn
@@ -179,12 +190,11 @@ o_1_space_read_chunked env =
179190copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
180191copyChunksSplitInterposeSuffix inh outh =
181192 Stream.fold (Handle.write outh)
182− $ ArrayStream.interposeSuffix 10
183− $ ArrayStream.splitOnSuffix 10
184− $ Handle.getChunks inh
193+ $ ArrayStream.interposeSuffix 10 . ArrayStream.splitOnSuffix 10
194+ $ Handle.readChunks inh
185195
186196#ifdef INSPECTION
187−inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterposeSuffix [''Storable]
197+inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterposeSuffix [''Unbox]
188198inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
189199#endif
190200
@@ -193,13 +203,12 @@ inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
193203copyChunksSplitInterpose :: Handle -> Handle -> IO ()
194204copyChunksSplitInterpose inh outh =
195205 Stream.fold (Handle.write outh)
196− $ ArrayStream.interpose 32
197206 -- XXX this is not correct word splitting combinator
198− $ ArrayStream.splitOn 32
199− $ Handle.getChunks inh
207+ $ ArrayStream.interpose 32 . ArrayStream.splitOn 32
208+ $ Handle.readChunks inh
200209
201210#ifdef INSPECTION
202−inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterpose [''Storable]
211+inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterpose [''Unbox]
203212inspect $ 'copyChunksSplitInterpose `hasNoType` ''Step
204213#endif
205214
@@ -218,30 +227,53 @@ o_1_space_copy_toChunks_group_ungroup env =
218227-------------------------------------------------------------------------------
219228
220229{-# INLINE drainWhile #-}
221−drainWhile :: MonadThrow m => (a -> Bool) -> ParserD.Parser m a ()
222−drainWhile p = ParserD.takeWhile p Fold.drain
230+drainWhile :: MonadCatch m => (a -> Bool) -> Parser.Parser a m ()
231+drainWhile p = Parser.takeWhile p Fold.drain
223232
224233-------------------------------------------------------------------------------
225234-- Folds and parsers
226235-------------------------------------------------------------------------------
227236
228237{-# INLINE fold #-}
229−fold :: SerialT IO (Array.Array Int) -> IO ()
230−fold s = void $ ArrayStream.fold Fold.drain s
231−
232−{-# INLINE parseArray #-}
233−parseArray :: Int -> SerialT IO (Array.Array Int) -> IO ()
234−parseArray value s = void $ ArrayStream.parse (drainWhile (< value)) s
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
235259
236260o_1_space_serial_array ::
237261 Int -> [Array.Array Int] -> [Array.Array Int] -> [Benchmark]
238262o_1_space_serial_array bound arraysSmall arraysBig =
239263 [ benchIO "fold (of 100)" (\_ -> Stream.fromList arraysSmall) fold
240264 , benchIO "fold (single)" (\_ -> Stream.fromList arraysBig) fold
265+ , benchIO
266+ "foldBreak (recursive, small arrays)"
267+ (\_ -> Stream.fromList arraysSmall)
268+ (foldBreak . StreamK.fromStream)
241269 , benchIO "parse (of 100)" (\_ -> Stream.fromList arraysSmall)
242− $ parseArray bound
270+ $ parse bound
243271 , benchIO "parse (single)" (\_ -> Stream.fromList arraysBig)
244− $ parseArray bound
272+ $ parse bound
273+ , benchIO
274+ "parseBreak (recursive, small arrays)"
275+ (\_ -> Stream.fromList arraysSmall)
276+ (parseBreak . StreamK.fromStream)
245277 ]
246278
247279-------------------------------------------------------------------------------
@@ -249,7 +281,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
249281-------------------------------------------------------------------------------
250282
251283moduleName :: String
252−moduleName = "Data.Array.Stream.Foreign"
284+moduleName = "Data.Array.Stream"
253285
254286main :: IO ()
255287main = do
@@ -258,10 +290,14 @@ main = do
258290
259291 where
260292
261− alloc value = do
262− small <- Stream.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
263− big <- Stream.toList $ Stream.arraysOf value $ sourceUnfoldrM value 0
264− return (small, big)
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)
265301
266302 allBenchmarks env arrays value =
267303 let (arraysSmall, arraysBig) = arrays
benchmark/Streamly/Benchmark/Data/Fold.hs+244−196
@@ -6,14 +6,23 @@
66-- Maintainer : streamly@composewell.com
77
88{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE FlexibleInstances #-}
910{-# LANGUAGE RankNTypes #-}
1011{-# 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
1119
1220module Main (main) where
1321
1422import Control.DeepSeq (NFData(..))
23+import Control.Monad (when)
1524import Control.Monad.IO.Class (MonadIO(..))
16−import Data.Functor.Identity (Identity)
25+import Data.Functor.Identity (Identity(..))
1726import Data.Map.Strict (Map)
1827import Data.Hashable (Hashable)
1928import Data.HashMap.Strict (HashMap)
@@ -21,16 +30,18 @@ import Data.IntMap.Strict (IntMap)
2130import Data.Monoid (Last(..), Sum(..))
2231import System.Random (randomRIO)
2332
24−import Streamly.Prelude (SerialT)
33+import Streamly.Internal.Data.Stream (Stream)
2534import Streamly.Internal.Data.Fold (Fold(..))
35+import Streamly.Internal.Data.IsMap.HashMap ()
36+import Streamly.Internal.Data.MutArray (MutArray)
2637
2738import qualified Streamly.Internal.Data.Fold as FL
39+import qualified Streamly.Data.Fold.Prelude as Fold
2840import qualified Streamly.Internal.Data.Unfold as Unfold
2941import qualified Streamly.Internal.Data.Pipe as Pipe
30−import qualified Streamly.Internal.Data.Stream.IsStream as IP
31−import qualified Streamly.Prelude as S
42+import qualified Streamly.Internal.Data.Stream as Stream
3243
33−import Gauge
44+import Test.Tasty.Bench
3445import Streamly.Benchmark.Common
3546import Prelude hiding (all, any, take, unzip, sequence_, filter)
3647
@@ -38,8 +49,8 @@ import Prelude hiding (all, any, take, unzip, sequence_, filter)
3849-- completely optimized out by the compiler in some cases.
3950
4051{-# INLINE sourceUnfoldrM #-}
41−sourceUnfoldrM :: (S.IsStream t, S.MonadAsync m) => Int -> Int -> t m Int
42−sourceUnfoldrM value n = S.unfoldrM step n
52+sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
53+sourceUnfoldrM value n = Stream.unfoldrM step n
4354 where
4455 step cnt =
4556 if cnt > n + value
@@ -47,14 +58,14 @@ sourceUnfoldrM value n = S.unfoldrM step n
4758 else return (Just (cnt, cnt + 1))
4859
4960{-# INLINE source #-}
50−source :: (S.MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
61+source :: Monad m => Int -> Int -> Stream m Int
5162source = sourceUnfoldrM
5263
5364-- | Takes a fold method, and uses it with a default source.
5465{-# INLINE benchIOSink #-}
5566benchIOSink
56− :: (S.IsStream t, NFData b)
57− => Int -> String -> (t IO Int -> IO b) -> Benchmark
67+ :: NFData b
68+ => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
5869benchIOSink value name f = bench name $ nfIO $ randomRIO (1,1) >>= f . source value
5970
6071-------------------------------------------------------------------------------
@@ -62,16 +73,16 @@ benchIOSink value name f = bench name $ nfIO $ randomRIO (1,1) >>= f . source va
6273-------------------------------------------------------------------------------
6374
6475{-# INLINE any #-}
65−any :: (Monad m, Ord a) => a -> SerialT m a -> m Bool
66−any value = IP.fold (FL.any (> value))
76+any :: (Monad m, Ord a) => a -> Stream m a -> m Bool
77+any value = Stream.fold (FL.any (> value))
6778
6879{-# INLINE all #-}
69−all :: (Monad m, Ord a) => a -> SerialT m a -> m Bool
70−all value = IP.fold (FL.all (<= value))
80+all :: (Monad m, Ord a) => a -> Stream m a -> m Bool
81+all value = Stream.fold (FL.all (<= value))
7182
7283{-# INLINE take #-}
73−take :: Monad m => Int -> SerialT m a -> m ()
74−take value = IP.fold (FL.take value FL.drain)
84+take :: Monad m => Int -> Stream m a -> m ()
85+take value = Stream.fold (FL.take value FL.drain)
7586
7687{-# INLINE sequence_ #-}
7788sequence_ :: Monad m => Int -> Fold m a ()
@@ -88,69 +99,75 @@ sequence_ value =
8899-------------------------------------------------------------------------------
89100
90101{-# INLINE filter #-}
91−filter :: Monad m => Int -> SerialT m Int -> m ()
92−filter _ = IP.fold (FL.filter even FL.drain)
102+filter :: Monad m => Int -> Stream m Int -> m ()
103+filter _ = Stream.fold (FL.filter even FL.drain)
93104
94−{-# INLINE foldFilter #-}
95−foldFilter :: Monad m => Int -> SerialT m Int -> m ()
96−foldFilter _ = IP.fold (FL.foldFilter (FL.satisfy even) FL.drain)
105+{-# INLINE scanMaybe #-}
106+scanMaybe :: Monad m => Int -> Stream m Int -> m ()
107+scanMaybe _ = Stream.fold (FL.scanMaybe (FL.filtering even) FL.drain)
97108
98−{-# INLINE foldFilter2 #-}
99−foldFilter2 :: Monad m => Int -> SerialT m Int -> m ()
100−foldFilter2 _ =
101− IP.fold
102− $ FL.foldFilter (FL.satisfy even)
103− $ FL.foldFilter (FL.satisfy odd) FL.drain
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
104115
105116-------------------------------------------------------------------------------
106117-- Splitting by serial application
107118-------------------------------------------------------------------------------
108119
109120{-# INLINE takeEndBy_ #-}
110−takeEndBy_ :: Monad m => Int -> SerialT m Int -> m ()
111−takeEndBy_ value = IP.fold (FL.takeEndBy_ (>= value) FL.drain)
121+takeEndBy_ :: Monad m => Int -> Stream m Int -> m ()
122+takeEndBy_ value = Stream.fold (FL.takeEndBy_ (>= value) FL.drain)
112123
113124{-# INLINE many #-}
114−many :: Monad m => SerialT m Int -> m ()
115−many = IP.fold (FL.many (FL.take 1 FL.drain) FL.drain)
125+many :: Monad m => Stream m Int -> m ()
126+many = Stream.fold (FL.many (FL.take 1 FL.drain) FL.drain)
116127
117128{-# INLINE splitAllAny #-}
118−splitAllAny :: Monad m => Int -> SerialT m Int -> m (Bool, Bool)
129+splitAllAny :: Monad m => Int -> Stream m Int -> m (Bool, Bool)
119130splitAllAny value =
120− IP.fold
121− (FL.serialWith (,)
131+ Stream.fold
132+ (FL.splitWith (,)
122133 (FL.all (<= (value `div` 2)))
123134 (FL.any (> value))
124135 )
125136
126−{-# INLINE serial_ #-}
127−serial_ :: Monad m => Int -> SerialT m Int -> m Bool
128−serial_ value =
129− IP.fold
130− (FL.serial_
137+{-# INLINE split_ #-}
138+split_ :: Monad m => Int -> Stream m Int -> m Bool
139+split_ value =
140+ Stream.fold
141+ (FL.split_
131142 (FL.all (<= (value `div` 2)))
132143 (FL.any (> value))
133144 )
134145
135146{-# INLINE shortest #-}
136−shortest :: Monad m => SerialT m Int -> m (Either Int Int)
137−shortest = IP.fold (FL.shortest FL.sum FL.length)
147+shortest :: Monad m => Stream m Int -> m (Either Int Int)
148+shortest = Stream.fold (FL.shortest FL.sum FL.length)
138149
139150{-# INLINE longest #-}
140−longest :: Monad m => SerialT m Int -> m (Either Int Int)
141−longest = IP.fold (FL.longest FL.sum FL.length)
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
142159
143160-------------------------------------------------------------------------------
144161-- Distributing by parallel application
145162-------------------------------------------------------------------------------
146163
147164{-# INLINE teeSumLength #-}
148−teeSumLength :: Monad m => SerialT m Int -> m (Int, Int)
149−teeSumLength = IP.fold (FL.teeWith (,) FL.sum FL.length)
165+teeSumLength :: Monad m => Stream m Int -> m (Int, Int)
166+teeSumLength = Stream.fold (FL.teeWith (,) FL.sum FL.length)
150167
151168{-# INLINE teeAllAny #-}
152−teeAllAny :: (Monad m, Ord a) => a -> SerialT m a -> m (Bool, Bool)
153−teeAllAny value = IP.fold (FL.teeWith (,) all_ any_)
169+teeAllAny :: (Monad m, Ord a) => a -> Stream m a -> m (Bool, Bool)
170+teeAllAny value = Stream.fold (FL.teeWith (,) all_ any_)
154171
155172 where
156173
@@ -158,16 +175,16 @@ teeAllAny value = IP.fold (FL.teeWith (,) all_ any_)
158175 any_ = FL.any (> value)
159176
160177{-# INLINE teeWithFst #-}
161−teeWithFst :: Monad m => SerialT m Int -> m (Int, Int)
162−teeWithFst = IP.fold (FL.teeWithFst (,) FL.sum FL.length)
178+teeWithFst :: Monad m => Stream m Int -> m (Int, Int)
179+teeWithFst = Stream.fold (FL.teeWithFst (,) FL.sum FL.length)
163180
164181{-# INLINE teeWithMin #-}
165−teeWithMin :: Monad m => SerialT m Int -> m (Int, Int)
166−teeWithMin = IP.fold (FL.teeWithMin (,) FL.sum FL.length)
182+teeWithMin :: Monad m => Stream m Int -> m (Int, Int)
183+teeWithMin = Stream.fold (FL.teeWithMin (,) FL.sum FL.length)
167184
168185{-# INLINE distribute #-}
169−distribute :: Monad m => SerialT m Int -> m [Int]
170−distribute = IP.fold (FL.distribute [FL.sum, FL.length])
186+distribute :: Monad m => Stream m Int -> m [Int]
187+distribute = Stream.fold (FL.distribute [FL.sum, FL.length])
171188
172189-------------------------------------------------------------------------------
173190-- Partitioning
@@ -178,88 +195,88 @@ oddEven :: Int -> Either Int Int
178195oddEven x = if odd x then Left x else Right x
179196
180197{-# INLINE partition #-}
181−partition :: Monad m => SerialT m Int -> m (Int, Int)
182−partition = IP.fold $ FL.lmap oddEven (FL.partition FL.sum FL.length)
198+partition :: Monad m => Stream m Int -> m (Int, Int)
199+partition = Stream.fold $ FL.lmap oddEven (FL.partition FL.sum FL.length)
183200
184201{-# INLINE partitionByFstM #-}
185−partitionByFstM :: Monad m => SerialT m Int -> m (Int, Int)
202+partitionByFstM :: Monad m => Stream m Int -> m (Int, Int)
186203partitionByFstM =
187− IP.fold (FL.partitionByFstM (return . oddEven) FL.sum FL.length)
204+ Stream.fold (FL.partitionByFstM (return . oddEven) FL.sum FL.length)
188205
189206{-# INLINE partitionByMinM #-}
190−partitionByMinM :: Monad m => SerialT m Int -> m (Int, Int)
207+partitionByMinM :: Monad m => Stream m Int -> m (Int, Int)
191208partitionByMinM =
192− IP.fold (FL.partitionByMinM (return . oddEven) FL.sum FL.length)
193−
194−{-# INLINE demuxWith #-}
195−demuxWith :: (Monad m, Ord k) =>
196− (a -> k) -> (k -> m (Fold m a b)) -> SerialT m a -> m (Map k b)
197−demuxWith f g = S.fold (FL.demuxWith f g)
198−
199−{-# INLINE demuxWithInt #-}
200−demuxWithInt :: Monad m =>
201− (a -> Int) -> (Int -> m (Fold m a b)) -> SerialT m a -> m (IntMap b)
202−demuxWithInt f g = S.fold (FL.demuxWith f g)
203−
204−{-# INLINE demuxWithHash #-}
205−demuxWithHash :: (Monad m, Ord k, Hashable k) =>
206− (a -> k) -> (k -> m (Fold m a b)) -> SerialT m a -> m (HashMap k b)
207−demuxWithHash f g = S.fold (FL.demuxWith f g)
208−
209−{-# INLINE demuxMutWith #-}
210−demuxMutWith :: (MonadIO m, Ord k) =>
211− (a -> k) -> (k -> m (Fold m a b)) -> SerialT m a -> m (Map k b)
212−demuxMutWith f g = S.fold (FL.demuxMutWith f g)
213−
214−{-# INLINE demuxMutWithHash #-}
215−demuxMutWithHash :: (MonadIO m, Ord k, Hashable k) =>
216− (a -> k) -> (k -> m (Fold m a b)) -> SerialT m a -> m (HashMap k b)
217−demuxMutWithHash f g = S.fold (FL.demuxMutWith f g)
218−
219−{-# INLINE classifyWith #-}
220−classifyWith ::
221− (Monad m, Ord k, Num a) => (a -> k) -> SerialT m a -> m (Map k a)
222−classifyWith f = S.fold (FL.classifyWith f FL.sum)
223−
224−{-# INLINE classifyWithInt #-}
225−classifyWithInt ::
226− (MonadIO m, Num a) => (a -> Int) -> SerialT m a -> m (IntMap a)
227−classifyWithInt f = S.fold (FL.classifyWith f FL.sum)
228−
229−{-# INLINE classifyMutWith #-}
230−classifyMutWith ::
231− (MonadIO m, Ord k, Num a) => (a -> k) -> SerialT m a -> m (Map k a)
232−classifyMutWith f = S.fold (FL.classifyMutWith f FL.sum)
233−
234−{-# INLINE classifyMutWithInt #-}
235−classifyMutWithInt ::
236− (MonadIO m, Num a) => (a -> Int) -> SerialT m a -> m (IntMap a)
237−classifyMutWithInt f = S.fold (FL.classifyMutWith f FL.sum)
238−
239−{-# INLINE classifyMutWithHash #-}
240−classifyMutWithHash :: (MonadIO m, Ord k, Num a, Hashable k) =>
241− (a -> k) -> SerialT m a -> m (HashMap k a)
242−classifyMutWithHash f = S.fold (FL.classifyMutWith f FL.sum)
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)
243260
244261-------------------------------------------------------------------------------
245262-- unzip
246263-------------------------------------------------------------------------------
247264
248265{-# INLINE unzip #-}
249−unzip :: Monad m => SerialT m Int -> m (Int, Int)
250−unzip = IP.fold $ FL.lmap (\a -> (a, a)) (FL.unzip FL.sum FL.length)
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)
251268
252269{-# INLINE unzipWithFstM #-}
253−unzipWithFstM :: Monad m => SerialT m Int -> m (Int, Int)
270+unzipWithFstM :: Monad m => Stream m Int -> m (Int, Int)
254271unzipWithFstM = do
255− let f = \a -> return (a + 1, a)
256− IP.fold (FL.unzipWithFstM f FL.sum FL.length)
272+ let f a = return (a + 1, a)
273+ Stream.fold (FL.unzipWithFstM f FL.sum FL.length)
257274
258275{-# INLINE unzipWithMinM #-}
259−unzipWithMinM :: Monad m => SerialT m Int -> m (Int, Int)
276+unzipWithMinM :: Monad m => Stream m Int -> m (Int, Int)
260277unzipWithMinM = do
261− let f = \a -> return (a + 1, a)
262− IP.fold (FL.unzipWithMinM f FL.sum FL.length)
278+ let f a = return (a + 1, a)
279+ Stream.fold (FL.unzipWithMinM f FL.sum FL.length)
263280
264281-------------------------------------------------------------------------------
265282-- Nested
@@ -269,8 +286,8 @@ unzipWithMinM = do
269286unfoldMany :: Int -> Benchmarkable
270287unfoldMany val =
271288 nfIO
272− $ IP.fold (FL.unfoldMany (Unfold.replicateM val) FL.drain)
273− $ IP.fromPure (randomRIO (1, 1 :: Int))
289+ $ Stream.fold (FL.unfoldMany Unfold.replicateM FL.drain)
290+ $ Stream.fromPure (val, randomRIO (1, 1 :: Int))
274291
275292-------------------------------------------------------------------------------
276293-- Benchmarks
@@ -279,103 +296,113 @@ unfoldMany val =
279296moduleName :: String
280297moduleName = "Data.Fold"
281298
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+
282307o_1_space_serial_elimination :: Int -> [Benchmark]
283308o_1_space_serial_elimination value =
284309 [ bgroup "elimination"
285− [ benchIOSink value "drain" (S.fold FL.drain)
286− , benchIOSink value "drainBy" (S.fold (FL.drainBy return))
287− , benchIOSink value "drainN" (S.fold (FL.drainN value))
288− , benchIOSink value "last" (S.fold FL.last)
289− , benchIOSink value "length" (S.fold FL.length)
290− , benchIOSink value "sum" (S.fold FL.sum)
291− , benchIOSink value "sum (foldMap)" (S.fold (FL.foldMap Sum))
292− , benchIOSink value "product" (S.fold FL.product)
293− , benchIOSink value "maximumBy" (S.fold (FL.maximumBy compare))
294− , benchIOSink value "maximum" (S.fold FL.maximum)
295− , benchIOSink value "minimumBy" (S.fold (FL.minimumBy compare))
296− , benchIOSink value "minimum" (S.fold FL.minimum)
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)
297324 , benchIOSink
298325 value
299326 "mean"
300− (S.fold FL.mean . S.map (fromIntegral :: Int -> Double))
327+ (Stream.fold FL.mean . fmap (fromIntegral :: Int -> Double))
301328 , benchIOSink
302329 value
303330 "variance"
304− (S.fold FL.variance . S.map (fromIntegral :: Int -> Double))
331+ (Stream.fold FL.variance . fmap (fromIntegral :: Int -> Double))
305332 , benchIOSink
306333 value
307334 "stdDev"
308− (S.fold FL.stdDev . S.map (fromIntegral :: Int -> Double))
335+ (Stream.fold FL.stdDev . fmap (fromIntegral :: Int -> Double))
309336 , benchIOSink
310337 value
311338 "mconcat"
312− (S.fold FL.mconcat . S.map (Last . Just))
339+ (Stream.fold FL.mconcat . fmap (Last . Just))
313340 , benchIOSink
314341 value
315342 "foldMap"
316− (S.fold (FL.foldMap (Last . Just)))
343+ (Stream.fold (FL.foldMap (Last . Just)))
317344 , benchIOSink
318345 value
319346 "foldMapM"
320− (S.fold (FL.foldMapM (return . Last . Just)))
321− , benchIOSink value "index" (S.fold (FL.index (value + 1)))
322− , benchIOSink value "head" (S.fold FL.head)
323− , benchIOSink value "find" (S.fold (FL.find (== (value + 1))))
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))))
324351 , benchIOSink
325352 value
326353 "lookup"
327− (S.fold (FL.lmap (\a -> (a, a)) (FL.lookup (value + 1))))
354+ (Stream.fold (FL.lmap (\a -> (a, a)) (FL.lookup (value + 1))))
328355 , benchIOSink
329356 value
330357 "findIndex"
331− (S.fold (FL.findIndex (== (value + 1))))
358+ (Stream.fold (FL.findIndex (== (value + 1))))
332359 , benchIOSink
333360 value
334361 "elemIndex"
335− (S.fold (FL.elemIndex (value + 1)))
336− , benchIOSink value "null" (S.fold FL.null)
337− , benchIOSink value "elem" (S.fold (FL.elem (value + 1)))
338− , benchIOSink value "notElem" (S.fold (FL.notElem (value + 1)))
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)))
339366 , benchIOSink value "all" $ all value
340367 , benchIOSink value "any" $ any value
341368 , benchIOSink value "take" $ take value
342369 , benchIOSink value "takeEndBy_" $ takeEndBy_ value
343− , benchIOSink value "and" (S.fold FL.and . S.map (<= (value + 1)))
344− , benchIOSink value "or" (S.fold FL.or . S.map (> (value + 1)))
370+ , benchIOSink value "and" (Stream.fold FL.and . fmap (<= (value + 1)))
371+ , benchIOSink value "or" (Stream.fold FL.or . fmap (> (value + 1)))
345372 ]
346373 ]
347374
348375o_1_space_serial_transformation :: Int -> [Benchmark]
349376o_1_space_serial_transformation value =
350377 [ bgroup "transformation"
351− [ benchIOSink value "map" (S.fold (FL.lmap (+ 1) FL.drain))
378+ [ benchIOSink value "map" (Stream.fold (FL.lmap (+ 1) FL.drain))
352379 , let f x = if even x then Just x else Nothing
353380 fld = FL.mapMaybe f FL.drain
354− in benchIOSink value "mapMaybe" (S.fold fld)
381+ in benchIOSink value "mapMaybe" (Stream.fold fld)
355382 , benchIOSink
356383 value
357384 "rsequence"
358− (S.fold (FL.rmapM id (return <$> FL.drain)))
359− , benchIOSink value "rmapM" (S.fold (FL.rmapM return FL.drain))
385+ (Stream.fold (FL.rmapM id (return <$> FL.drain)))
386+ , benchIOSink value "rmapM" (Stream.fold (FL.rmapM return FL.drain))
360387 , benchIOSink
361388 value
362389 "pipe-mapM"
363− (S.fold
390+ (Stream.fold
364391 (FL.transform
365392 (Pipe.mapM (\x -> return $ x + 1))
366393 FL.drain))
367394 , benchIOSink
368395 value
369396 "fold-scan"
370− (S.fold $ FL.scan FL.sum FL.drain)
397+ (Stream.fold $ FL.scan FL.sum FL.drain)
371398 , benchIOSink
372399 value
373400 "fold-scanMany"
374− (S.fold $ FL.scanMany (FL.take 2 FL.drain) FL.drain)
401+ (Stream.fold $ FL.scanMany (FL.take 2 FL.drain) FL.drain)
375402 , benchIOSink
376403 value
377404 "fold-postscan"
378− (S.fold $ FL.postscan FL.sum FL.drain)
405+ (Stream.fold $ FL.postscan FL.sum FL.drain)
379406 ]
380407 ]
381408
@@ -384,10 +411,11 @@ o_1_space_serial_composition value =
384411 [ bgroup
385412 "composition"
386413 [ benchIOSink value "filter even" $ filter value
387− , benchIOSink value "foldFilter even" $ foldFilter value
388− , benchIOSink value "foldFilter even, odd" $ foldFilter2 value
389− , benchIOSink value "serialWith (all, any)" $ splitAllAny value
390− , benchIOSink value "serial_ (all, any)" $ serial_ 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
391419 , benchIOSink value "tee (all, any)" $ teeAllAny value
392420 , benchIOSink value "many drain (take 1)" many
393421 , bench "unfoldMany" $ unfoldMany value
@@ -408,7 +436,7 @@ o_1_space_serial_composition value =
408436
409437o_n_space_serial :: Int -> [Benchmark]
410438o_n_space_serial value =
411− [ benchIOSink value "sequence_/100" $ S.fold (sequence_ (value `div` 100))
439+ [ benchIOSink value "sequence_/100" $ Stream.fold (sequence_ (value `div` 100))
412440 ]
413441
414442o_n_heap_serial :: Int -> [Benchmark]
@@ -417,49 +445,50 @@ o_n_heap_serial value =
417445 -- Left folds for building a structure are inherently non-streaming
418446 -- as the structure cannot be lazily consumed until fully built.
419447 [
420− benchIOSink value "toList" (S.fold FL.toList)
421− , benchIOSink value "toListRev" (S.fold FL.toListRev)
448+ benchIOSink value "toList" (Stream.fold FL.toList)
449+ , benchIOSink value "toListRev" (Stream.fold FL.toListRev)
422450 , benchIOSink value "toStream"
423− (S.fold FL.toStream
424− :: SerialT IO a -> IO (SerialT Identity a))
451+ (Stream.fold FL.toStream
452+ :: Stream IO a -> IO (Stream Identity a))
425453 , benchIOSink value "toStreamRev"
426− (S.fold FL.toStreamRev
427− :: SerialT IO a -> IO (SerialT Identity a))
454+ (Stream.fold FL.toStreamRev
455+ :: Stream IO a -> IO (Stream Identity a))
456+ , benchIOSink value "nub" (Stream.fold FL.nub)
428457 ]
429458 , bgroup "key-value"
430459 [
431− benchIOSink value "demuxWith (64 buckets) [sum, length]"
432− $ demuxWith (getKey 64) getFold
433− , benchIOSink value "demuxWithInt (64 buckets) [sum, length]"
434− $ demuxWithInt (getKey 64) getFold
435− , benchIOSink value "demuxWithHash (64 buckets) [sum, length]"
436− $ demuxWithHash (getKey 64) getFold
437− , benchIOSink value "demuxMutWith (64 buckets) [sum, length]"
438− $ demuxMutWith (getKey 64) getFold
439− , benchIOSink value "demuxMutWithHash (64 buckets) [sum, length]"
440− $ demuxMutWithHash (getKey 64) getFold
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)
441470
442471 -- classify: immutable
443− , benchIOSink value "classifyWith (64 buckets) sum"
444− $ classifyWith (getKey 64)
445− , benchIOSink value "classifyWithInt (64 buckets) sum"
446− $ classifyWithInt (getKey 64)
472+ , benchIOSink value "toMap (64 buckets) sum"
473+ $ toMap (getKey 64)
474+ , benchIOSink value "toIntMap (64 buckets) sum"
475+ $ toIntMap (getKey 64)
447476
448477 -- classify: mutable cells
449− , benchIOSink value "classifyMutWith (single bucket) sum"
450− $ classifyMutWith (getKey 1)
451− , benchIOSink value "classifyMutWith (64 buckets) sum"
452− $ classifyMutWith (getKey 64)
453− , benchIOSink value "classifyMutWith (max buckets) sum"
454− $ classifyMutWith (getKey value)
455− , benchIOSink value "classifyMutWithInt (64 buckets) sum"
456− $ classifyMutWithInt (getKey 64)
457− , benchIOSink value "classifyMutWithHash (single bucket) sum"
458− $ classifyMutWithHash (getKey 1)
459− , benchIOSink value "classifyMutWithHash (64 buckets) sum"
460− $ classifyMutWithHash (getKey 64)
461− , benchIOSink value "classifyMutWithHash (max buckets) sum"
462− $ classifyMutWithHash (getKey value)
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)
463492 ]
464493 ]
465494
@@ -478,7 +507,9 @@ o_n_heap_serial value =
478507-------------------------------------------------------------------------------
479508
480509main :: IO ()
481−main = runWithCLIOpts defaultStreamSize allBenchmarks
510+main = do
511+#ifndef FUSION_CHECK
512+ runWithCLIOpts defaultStreamSize allBenchmarks
482513
483514 where
484515
@@ -491,3 +522,20 @@ main = runWithCLIOpts defaultStreamSize allBenchmarks
491522 , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
492523 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
493524 ]
525+#else
526+ -- Enable FUSION_CHECK macro at the beginning of the file
527+ -- Enable one benchmark below, and run the benchmark
528+ -- Check the .dump-simpl output
529+ let value = 100000
530+ let input = source value 1
531+ let getKey buckets = (`mod` buckets)
532+ let getFold k =
533+ return $ case k of
534+ 0 -> FL.sum
535+ 1 -> FL.length
536+ _ -> FL.length
537+
538+ -- demuxToMap (getKey 64) (getFold . getKey 64) input
539+ toIntMapIO (getKey 64) input
540+ return ()
541+#endif
benchmark/Streamly/Benchmark/Data/Fold/Window.hs+116−59
@@ -1,26 +1,29 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13module Main (main) where
24
35import Control.DeepSeq (NFData)
46import Streamly.Data.Fold (Fold)
5−import Streamly.Prelude (SerialT)
7+import Streamly.Internal.Data.Stream (Stream)
68import System.Random (randomRIO)
79
810import qualified Streamly.Data.Fold as Fold
9−import qualified Streamly.Internal.Data.Ring.Foreign as Ring
10−import qualified Streamly.Prelude as Stream
11−import qualified Streamly.Internal.Data.Fold.Window as Window
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
1214
13−import Gauge
15+import Streamly.Benchmark.Common
16+import Test.Tasty.Bench
1417
1518{-# INLINE source #-}
16−source :: (Monad m, Stream.IsStream t, Num a, Stream.Enumerable a) =>
17− Int -> a -> t m a
19+source :: (Monad m, Num a, Stream.Enumerable a) =>
20+ Int -> a -> Stream m a
1821source len from =
1922 Stream.enumerateFromThenTo from (from + 1) (from + fromIntegral len)
2023
2124{-# INLINE sourceDescending #-}
22−sourceDescending :: (Monad m, Stream.IsStream t, Num a, Stream.Enumerable a) =>
23− Int -> a -> t m a
25+sourceDescending :: (Monad m, Num a, Stream.Enumerable a) =>
26+ Int -> a -> Stream m a
2427sourceDescending len from =
2528 Stream.enumerateFromThenTo
2629 (from + fromIntegral len)
@@ -28,107 +31,161 @@ sourceDescending len from =
2831 from
2932
3033{-# INLINE sourceDescendingInt #-}
31−sourceDescendingInt :: (Monad m, Stream.IsStream t) => Int -> Int -> t m Int
34+sourceDescendingInt :: Monad m => Int -> Int -> Stream m Int
3235sourceDescendingInt = sourceDescending
3336
3437{-# INLINE benchWith #-}
35−benchWith :: (Num a, NFData a) =>
36− (Int -> a -> SerialT IO a) -> Int -> String -> Fold IO a a -> Benchmark
38+benchWith :: (Num a, NFData b) =>
39+ (Int -> a -> Stream IO a) -> Int -> String -> Fold IO a b -> Benchmark
3740benchWith src len name f =
3841 bench name
3942 $ nfIO
4043 $ randomRIO (1, 1 :: Int) >>= Stream.fold f . src len . fromIntegral
4144
4245{-# INLINE benchWithFold #-}
43−benchWithFold :: Int -> String -> Fold IO Double Double -> Benchmark
46+benchWithFold :: NFData a => Int -> String -> Fold IO Double a -> Benchmark
4447benchWithFold = benchWith source
4548
4649{-# INLINE benchWithFoldInt #-}
4750benchWithFoldInt :: Int -> String -> Fold IO Int Int -> Benchmark
4851benchWithFoldInt = benchWith source
4952
50−{-# INLINE benchWithPostscan #-}
51−benchWithPostscan :: Int -> String -> Fold IO Double Double -> Benchmark
52−benchWithPostscan len name f =
53− bench name $ nfIO $ randomRIO (1, 1) >>=
54− Stream.drain . Stream.postscan f . source len
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
5564
56−{-# INLINE numElements #-}
57−numElements :: Int
58−numElements = 100000
65+{-# INLINE benchWithPostscan #-}
66+benchWithPostscan :: Int -> String -> Fold IO Double a -> Benchmark
67+benchWithPostscan = benchScanWith source
5968
60−main :: IO ()
61−main =
62− defaultMain
63− [ bgroup
64− "fold"
69+o_1_space_folds :: Int -> [Benchmark]
70+o_1_space_folds numElements =
71+ [ bgroup "fold"
6572 [ benchWithFold numElements "minimum (window size 100)"
66− (Ring.slidingWindow 100 Window.minimum)
73+ (Window.windowMinimum 100)
6774 , benchWithFold numElements "minimum (window size 1000)"
68− (Ring.slidingWindow 1000 Window.minimum)
75+ (Window.windowMinimum 1000)
6976 , benchWith sourceDescendingInt numElements
7077 "minimum descending (window size 1000)"
71− (Ring.slidingWindow 1000 Window.minimum)
78+ (Window.windowMinimum 1000)
79+
7280 , benchWithFold numElements "maximum (window size 100)"
73− (Ring.slidingWindow 100 Window.maximum)
81+ (Window.windowMaximum 100)
7482 , benchWithFold numElements "maximum (window size 1000)"
75− (Ring.slidingWindow 1000 Window.maximum)
83+ (Window.windowMaximum 1000)
7684 , benchWith sourceDescendingInt numElements
7785 "maximum descending (window size 1000)"
78− (Ring.slidingWindow 1000 Window.maximum)
86+ (Window.windowMaximum 1000)
87+
7988 , benchWithFold numElements "range (window size 100)"
80− (Ring.slidingWindow 100 Window.range)
89+ (Window.windowRange 100)
8190 , benchWithFold numElements "range (window size 1000)"
82− (Ring.slidingWindow 1000 Window.range)
91+ (Window.windowRange 1000)
92+ , benchWith sourceDescendingInt numElements
93+ "range descending (window size 1000)"
94+ (Window.windowRange 1000)
95+
8396 , benchWithFoldInt numElements "sumInt (window size 100)"
84− (Ring.slidingWindow 100 Window.sumInt)
97+ (Ring.slidingWindow 100 Window.windowSumInt)
8598 , benchWithFoldInt numElements "sum for Int (window size 100)"
86− (Ring.slidingWindow 100 Window.sum)
99+ (Ring.slidingWindow 100 Window.windowSum)
87100 , benchWithFold numElements "sum (window size 100)"
88− (Ring.slidingWindow 100 Window.sum)
101+ (Ring.slidingWindow 100 Window.windowSum)
89102 , benchWithFold numElements "sum (window size 1000)"
90− (Ring.slidingWindow 1000 Window.sum)
103+ (Ring.slidingWindow 1000 Window.windowSum)
91104 , benchWithFold numElements "sum (entire stream)"
92− (Window.cumulative Window.sum)
105+ (Window.cumulative Window.windowSum)
93106 , benchWithFold numElements "sum (Data.Fold)"
94107 Fold.sum
95108
96109 , benchWithFold numElements "mean (window size 100)"
97− (Ring.slidingWindow 100 Window.mean)
110+ (Ring.slidingWindow 100 Window.windowMean)
98111 , benchWithFold numElements "mean (window size 1000)"
99− (Ring.slidingWindow 1000 Window.mean)
112+ (Ring.slidingWindow 1000 Window.windowMean)
100113 , benchWithFold numElements "mean (entire stream)"
101− (Window.cumulative Window.mean)
114+ (Window.cumulative Window.windowMean)
102115 , benchWithFold numElements "mean (Data.Fold)"
103116 Fold.mean
104117
105118 , benchWithFold numElements "powerSum 2 (window size 100)"
106− (Ring.slidingWindow 100 (Window.powerSum 2))
119+ (Ring.slidingWindow 100 (Window.windowPowerSum 2))
107120 , benchWithFold numElements "powerSum 2 (entire stream)"
108− (Window.cumulative (Window.powerSum 2))
121+ (Window.cumulative (Window.windowPowerSum 2))
109122
110123 ]
111− , bgroup
112− "scan"
113− [ benchWithPostscan numElements "minimum (window size 100)"
114− (Ring.slidingWindow 100 Window.minimum)
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)
115135 , benchWithPostscan numElements "minimum (window size 1000)"
116− (Ring.slidingWindow 1000 Window.minimum)
117− , benchWithPostscan numElements "maximum (window size 100)"
118− (Ring.slidingWindow 100 Window.maximum)
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)
119145 , benchWithPostscan numElements "maximum (window size 1000)"
120− (Ring.slidingWindow 1000 Window.maximum)
121− , benchWithPostscan numElements "range (window size 100)"
122− (Ring.slidingWindow 100 Window.range)
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)
123155 , benchWithPostscan numElements "range (window size 1000)"
124− (Ring.slidingWindow 1000 Window.range)
156+ (Window.windowRange 1000)
157+ , benchScanWith sourceDescendingInt numElements
158+ "range descending (window size 1000)"
159+ (Window.windowRange 1000)
160+
125161 , benchWithPostscan numElements "sum (window size 100)"
126− (Ring.slidingWindow 100 Window.sum)
162+ (Ring.slidingWindow 100 Window.windowSum)
127163 , benchWithPostscan numElements "sum (window size 1000)"
128− (Ring.slidingWindow 1000 Window.sum)
164+ (Ring.slidingWindow 1000 Window.windowSum)
165+
129166 , benchWithPostscan numElements "mean (window size 100)"
130− (Ring.slidingWindow 100 Window.mean)
167+ (Ring.slidingWindow 100 Window.windowMean)
131168 , benchWithPostscan numElements "mean (window size 1000)"
132− (Ring.slidingWindow 1000 Window.mean)
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))
133175 ]
134176 ]
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.hsnew file+300
@@ -0,0 +1,300 @@
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/Parser.hs+642−189
@@ -1,3 +1,10 @@
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+
18-- |
29-- Module : Streamly.Benchmark.Data.Parser
310-- Copyright : (c) 2020 Composewell Technologies
@@ -7,39 +14,42 @@
714
815{-# LANGUAGE CPP #-}
916{-# LANGUAGE FlexibleContexts #-}
17+{-# LANGUAGE ScopedTypeVariables #-}
18+{-# OPTIONS_GHC -Wno-orphans #-}
1019
1120module Main
1221 (
1322 main
1423 ) where
1524
25+import Control.Applicative ((<|>))
1626import Control.DeepSeq (NFData(..))
17−import Control.Monad.Catch (MonadCatch)
18−import Data.Foldable (asum)
27+import Data.Function ((&))
1928import Data.Functor (($>))
20−import Data.Maybe (fromMaybe)
2129import Data.Monoid (Sum(..))
2230import GHC.Magic (inline)
2331import GHC.Magic (noinline)
2432import System.IO (Handle)
2533import System.Random (randomRIO)
26−import Prelude
27− hiding (any, all, take, sequence, sequence_, sequenceA, takeWhile)
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)
2840
29−import qualified Data.Traversable as TR
30−import qualified Data.Foldable as F
3141import qualified Control.Applicative as AP
42+import qualified Data.Foldable as F
43+import qualified Data.Traversable as TR
3244import qualified Streamly.FileSystem.Handle as Handle
33−import qualified Streamly.Prelude as S
34−import qualified Streamly.Internal.Data.Array.Foreign as Array
35−import qualified Streamly.Internal.Data.Fold as FL
45+import qualified Streamly.Internal.Data.Array as Array
46+import qualified Streamly.Internal.Data.Fold as Fold
3647import qualified Streamly.Internal.Data.Parser as PR
37−import qualified Streamly.Internal.Data.Stream.IsStream as IP
48+import qualified Streamly.Data.Stream as Stream
3849import qualified Streamly.Internal.Data.Producer as Producer
39−import qualified Streamly.Internal.Data.Producer.Source as Source
50+import qualified Streamly.Internal.Data.Stream as Stream
4051
41−import Gauge hiding (env)
42−import Streamly.Prelude (SerialT)
52+import Test.Tasty.Bench hiding (env)
4353import Streamly.Benchmark.Common
4454import Streamly.Benchmark.Common.Handle
4555
@@ -50,19 +60,59 @@ import Streamly.Benchmark.Common.Handle
5060-- XXX these can be moved to the common module
5161
5262{-# INLINE sourceUnfoldrM #-}
53−sourceUnfoldrM :: (S.IsStream t, S.MonadAsync m) => Int -> Int -> t m Int
54−sourceUnfoldrM value n = S.unfoldrM step n
63+sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
64+sourceUnfoldrM value n = Stream.unfoldrM step n
5565 where
5666 step cnt =
5767 if cnt > n + value
5868 then return Nothing
5969 else return (Just (cnt, cnt + 1))
6070
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+
61111-- | Takes a fold method, and uses it with a default source.
62112{-# INLINE benchIOSink #-}
63113benchIOSink
64− :: (S.IsStream t, NFData b)
65− => Int -> String -> (t IO Int -> IO b) -> Benchmark
114+ :: NFData b
115+ => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
66116benchIOSink value name f =
67117 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
68118
@@ -70,199 +120,452 @@ benchIOSink value name f =
70120-- Parsers
71121-------------------------------------------------------------------------------
72122
73−{-# INLINE next #-}
74−next :: MonadCatch m => Int -> SerialT m Int -> m (Maybe Int)
75−next value = IP.parse p
76− where
77− p = do
78− m <- PR.next
79− case m of
80− Just i -> if i >= value then pure m else p
81− Nothing -> pure Nothing
82−
83123{-# INLINE takeBetween #-}
84−takeBetween :: MonadCatch m => Int -> SerialT m a -> m ()
85−takeBetween value = IP.parse (PR.takeBetween 0 value FL.drain)
124+takeBetween :: Monad m => Int -> Stream m a -> m (Either ParseError ())
125+takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
86126
87127{-# INLINE takeEQ #-}
88−takeEQ :: MonadCatch m => Int -> SerialT m a -> m ()
89−takeEQ value = IP.parse (PR.takeEQ value FL.drain)
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)
90134
91−{-# INLINE drainWhile #-}
92−drainWhile :: MonadCatch m => Int -> SerialT m Int -> m ()
93−drainWhile value = IP.parse (PR.drainWhile (<= value))
135+{-# INLINE dropWhile #-}
136+dropWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
137+dropWhile value = Stream.parse (PR.dropWhile (<= value))
94138
95−{-# INLINE sliceBeginWith #-}
96−sliceBeginWith :: MonadCatch m => Int -> SerialT m Int -> m ()
97−sliceBeginWith value stream = do
98− stream1 <- return . fromMaybe (S.fromPure (value + 1)) =<< S.tail stream
99− let stream2 = value `S.cons` stream1
100− IP.parse (PR.sliceBeginWith (== value) FL.drain) stream2
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))
101163
102164{-# INLINE takeWhile #-}
103−takeWhile :: MonadCatch m => Int -> SerialT m Int -> m ()
104−takeWhile value = IP.parse (PR.takeWhile (<= value) FL.drain)
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))
105171
106172{-# INLINE takeP #-}
107−takeP :: MonadCatch m => Int -> SerialT m a -> m ()
108−takeP value = IP.parse (PR.takeP value (PR.fromFold FL.drain))
173+takeP :: Monad m => Int -> Stream m a -> m (Either ParseError ())
174+takeP value = Stream.parse (PR.takeP value (PR.fromFold Fold.drain))
109175
110176{-# INLINE groupBy #-}
111−groupBy :: MonadCatch m => SerialT m Int -> m ()
112−groupBy = IP.parse (PR.groupBy (<=) FL.drain)
177+groupBy :: Monad m => Stream m Int -> m (Either ParseError ())
178+groupBy = Stream.parse (PR.groupBy (<=) Fold.drain)
113179
114180{-# INLINE groupByRolling #-}
115−groupByRolling :: MonadCatch m => SerialT m Int -> m ()
116−groupByRolling = IP.parse (PR.groupByRolling (<=) FL.drain)
181+groupByRolling :: Monad m => Stream m Int -> m (Either ParseError ())
182+groupByRolling = Stream.parse (PR.groupByRolling (<=) Fold.drain)
117183
118184{-# INLINE wordBy #-}
119−wordBy :: MonadCatch m => Int -> SerialT m Int -> m ()
120−wordBy value = IP.parse (PR.wordBy (>= value) FL.drain)
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
121241
122242{-# INLINE manyWordByEven #-}
123−manyWordByEven :: MonadCatch m => SerialT m Int -> m ()
124−manyWordByEven = IP.parse (PR.many (PR.wordBy (Prelude.even) FL.drain) FL.drain)
243+manyWordByEven :: Monad m => Stream m Int -> m (Either ParseError ())
244+manyWordByEven = Stream.parse (PR.many (PR.wordBy even Fold.drain) Fold.drain)
125245
126246{-# INLINE many #-}
127−many :: MonadCatch m => SerialT m Int -> m Int
128−many = IP.parse (PR.many (PR.satisfy (> 0)) FL.length)
247+many :: Monad m => Stream m Int -> m (Either ParseError Int)
248+many = Stream.parse (PR.many (PR.satisfy (> 0)) Fold.length)
129249
130250{-# INLINE manyAlt #-}
131−manyAlt :: MonadCatch m => SerialT m Int -> m Int
251+manyAlt :: Monad m => Stream m Int -> m Int
132252manyAlt xs = do
133− x <- IP.parse (AP.many (PR.satisfy (> 0))) xs
253+ x <- Stream.parse (AP.many (PR.satisfy (> 0))) xs
134254 return $ Prelude.length x
135255
136256{-# INLINE some #-}
137−some :: MonadCatch m => SerialT m Int -> m Int
138−some = IP.parse (PR.some (PR.satisfy (> 0)) FL.length)
257+some :: Monad m => Stream m Int -> m (Either ParseError Int)
258+some = Stream.parse (PR.some (PR.satisfy (> 0)) Fold.length)
139259
140260{-# INLINE someAlt #-}
141−someAlt :: MonadCatch m => SerialT m Int -> m Int
261+someAlt :: Monad m => Stream m Int -> m Int
142262someAlt xs = do
143− x <- IP.parse (AP.some (PR.satisfy (> 0))) xs
263+ x <- Stream.parse (AP.some (PR.satisfy (> 0))) xs
144264 return $ Prelude.length x
145265
146266{-# INLINE manyTill #-}
147−manyTill :: MonadCatch m => Int -> SerialT m Int -> m Int
267+manyTill :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
148268manyTill value =
149− IP.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) FL.length)
269+ Stream.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) Fold.length)
150270
151−{-# INLINE splitAp #-}
152−splitAp :: MonadCatch m
153− => Int -> SerialT m Int -> m ((), ())
154−splitAp value =
155− IP.parse
271+{-# INLINE splitAp2 #-}
272+splitAp2 :: Monad m
273+ => Int -> Stream m Int -> m (Either ParseError ((), ()))
274+splitAp2 value =
275+ Stream.parse
156276 ((,)
157− <$> PR.drainWhile (<= (value `div` 2))
158− <*> PR.drainWhile (<= value)
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)
159307 )
160308
161309{-# INLINE splitApBefore #-}
162−splitApBefore :: MonadCatch m
163− => Int -> SerialT m Int -> m ()
310+splitApBefore :: Monad m
311+ => Int -> Stream m Int -> m (Either ParseError ())
164312splitApBefore value =
165− IP.parse
166− ( PR.drainWhile (<= (value `div` 2))
167− *> PR.drainWhile (<= value)
313+ Stream.parse
314+ ( PR.dropWhile (<= (value `div` 2))
315+ *> PR.dropWhile (<= value)
168316 )
169317
170318{-# INLINE splitApAfter #-}
171−splitApAfter :: MonadCatch m
172− => Int -> SerialT m Int -> m ()
319+splitApAfter :: Monad m
320+ => Int -> Stream m Int -> m (Either ParseError ())
173321splitApAfter value =
174− IP.parse
175− ( PR.drainWhile (<= (value `div` 2))
176− <* PR.drainWhile (<= value)
322+ Stream.parse
323+ ( PR.dropWhile (<= (value `div` 2))
324+ <* PR.dropWhile (<= value)
177325 )
178326
179−{-# INLINE serialWith #-}
180−serialWith :: MonadCatch m
181− => Int -> SerialT m Int -> m ((), ())
182−serialWith value =
183− IP.parse
184− (PR.serialWith (,)
185− (PR.drainWhile (<= (value `div` 2)))
186− (PR.drainWhile (<= value))
327+{-# INLINE splitWith2 #-}
328+splitWith2 :: Monad m
329+ => Int -> Stream m Int -> m (Either ParseError ((), ()))
330+splitWith2 value =
331+ Stream.parse
332+ (PR.splitWith (,)
333+ (PR.dropWhile (<= (value `div` 2)))
334+ (PR.dropWhile (<= value))
187335 )
188336
189337{-# INLINE split_ #-}
190−split_ :: MonadCatch m
191− => Int -> SerialT m Int -> m ()
338+split_ :: Monad m
339+ => Int -> Stream m Int -> m (Either ParseError ())
192340split_ value =
193− IP.parse
341+ Stream.parse
194342 (PR.split_
195− (PR.drainWhile (<= (value `div` 2)))
196− (PR.drainWhile (<= value))
343+ (PR.dropWhile (<= (value `div` 2)))
344+ (PR.dropWhile (<= value))
197345 )
198346
199−{-# INLINE sliceSepByP #-}
200−sliceSepByP :: MonadCatch m
201− => Int -> SerialT m Int -> m()
202−sliceSepByP value = IP.parse (PR.sliceSepByP (>= value) (PR.fromFold FL.drain))
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
203355
356+ initial = do
357+ res <- finitial
358+ return $ case res of
359+ Fold.Partial s -> IPartial s
360+ Fold.Done b -> IDone b
361+
362+ step s a =
363+ if predicate a
364+ then do
365+ fres <- fstep s a
366+ return
367+ $ case fres of
368+ Fold.Partial s1 -> Partial 0 s1
369+ Fold.Done b -> Done 0 b
370+ else return $ Error "fail"
371+
372+ extract s = fmap (Done 0) (ffinal s)
373+
374+{-# INLINE alt2 #-}
375+alt2 :: Monad m
376+ => Int -> Stream m Int -> m (Either ParseError ())
377+alt2 value =
378+ Stream.parse
379+ (PR.alt
380+ (takeWhileFail (<= (value `div` 2)) Fold.drain)
381+ (PR.dropWhile (<= value))
382+ )
383+
384+{-# INLINE alt4 #-}
385+alt4 :: Monad m
386+ => Int -> Stream m Int -> m (Either ParseError ())
387+alt4 value =
388+ Stream.parse
389+ ( takeWhileFail (<= (value * 1 `div` 4)) Fold.drain
390+ <|> takeWhileFail (<= (value * 2 `div` 4)) Fold.drain
391+ <|> takeWhileFail (<= (value * 3 `div` 4)) Fold.drain
392+ <|> PR.dropWhile (<= value)
393+ )
394+
395+{-# INLINE alt8 #-}
396+alt8 :: Monad m
397+ => Int -> Stream m Int -> m (Either ParseError ())
398+alt8 value =
399+ Stream.parse
400+ ( takeWhileFail (<= (value * 1 `div` 8)) Fold.drain
401+ <|> takeWhileFail (<= (value * 2 `div` 8)) Fold.drain
402+ <|> takeWhileFail (<= (value * 3 `div` 8)) Fold.drain
403+ <|> takeWhileFail (<= (value * 4 `div` 8)) Fold.drain
404+ <|> takeWhileFail (<= (value * 5 `div` 8)) Fold.drain
405+ <|> takeWhileFail (<= (value * 6 `div` 8)) Fold.drain
406+ <|> takeWhileFail (<= (value * 7 `div` 8)) Fold.drain
407+ <|> PR.dropWhile (<= value)
408+ )
409+
410+{-# INLINE alt16 #-}
411+alt16 :: Monad m
412+ => Int -> Stream m Int -> m (Either ParseError ())
413+alt16 value =
414+ Stream.parse
415+ ( takeWhileFail (<= (value * 1 `div` 16)) Fold.drain
416+ <|> takeWhileFail (<= (value * 2 `div` 16)) Fold.drain
417+ <|> takeWhileFail (<= (value * 3 `div` 16)) Fold.drain
418+ <|> takeWhileFail (<= (value * 4 `div` 16)) Fold.drain
419+ <|> takeWhileFail (<= (value * 5 `div` 16)) Fold.drain
420+ <|> takeWhileFail (<= (value * 6 `div` 16)) Fold.drain
421+ <|> takeWhileFail (<= (value * 8 `div` 16)) Fold.drain
422+ <|> takeWhileFail (<= (value * 9 `div` 16)) Fold.drain
423+ <|> takeWhileFail (<= (value * 10 `div` 16)) Fold.drain
424+ <|> takeWhileFail (<= (value * 11 `div` 16)) Fold.drain
425+ <|> takeWhileFail (<= (value * 12 `div` 16)) Fold.drain
426+ <|> takeWhileFail (<= (value * 13 `div` 16)) Fold.drain
427+ <|> takeWhileFail (<= (value * 14 `div` 16)) Fold.drain
428+ <|> takeWhileFail (<= (value * 15 `div` 16)) Fold.drain
429+ <|> PR.dropWhile (<= value)
430+ )
431+
432+{-# INLINE altSmall #-}
433+altSmall :: Monad m
434+ => Int -> Stream m Int -> m ()
435+altSmall value =
436+ Stream.fold Fold.drain .
437+ Stream.parseMany
438+ (PR.alt
439+ (PR.satisfy (>= value) *> PR.die "alt")
440+ (PR.satisfy (<= value))
441+ )
442+
443+{-# INLINE monad #-}
444+monad :: Monad m
445+ => Int -> Stream m Int -> m (Either ParseError ())
446+monad value =
447+ Stream.parse
448+ $ do
449+ PR.dropWhile (<= (value `div` 2))
450+ PR.dropWhile (<= value)
451+
452+{-# INLINE monad4 #-}
453+monad4 :: Monad m
454+ => Int -> Stream m Int -> m (Either ParseError ())
455+monad4 value =
456+ Stream.parse $ do
457+ PR.dropWhile (<= (value `div` 4))
458+ PR.dropWhile (<= (value `div` 2))
459+ PR.dropWhile (<= (value * 3 `div` 4))
460+ PR.dropWhile (<= value)
461+
462+{-# INLINE monad8 #-}
463+monad8 :: Monad m
464+ => Int -> Stream m Int -> m (Either ParseError ())
465+monad8 value =
466+ Stream.parse $ do
467+ PR.dropWhile (<= (value * 1 `div` 8))
468+ PR.dropWhile (<= (value * 2 `div` 8))
469+ PR.dropWhile (<= (value * 3 `div` 8))
470+ PR.dropWhile (<= (value * 4 `div` 8))
471+ PR.dropWhile (<= (value * 5 `div` 8))
472+ PR.dropWhile (<= (value * 6 `div` 8))
473+ PR.dropWhile (<= (value * 7 `div` 8))
474+ PR.dropWhile (<= value)
475+
476+{-# INLINE monad16 #-}
477+monad16 :: Monad m
478+ => Int -> Stream m Int -> m (Either ParseError ())
479+monad16 value =
480+ Stream.parse $ do
481+ PR.dropWhile (<= (value * 1 `div` 16))
482+ PR.dropWhile (<= (value * 2 `div` 16))
483+ PR.dropWhile (<= (value * 3 `div` 16))
484+ PR.dropWhile (<= (value * 4 `div` 16))
485+ PR.dropWhile (<= (value * 5 `div` 16))
486+ PR.dropWhile (<= (value * 6 `div` 16))
487+ PR.dropWhile (<= (value * 7 `div` 16))
488+ PR.dropWhile (<= (value * 8 `div` 16))
489+ PR.dropWhile (<= (value * 9 `div` 16))
490+ PR.dropWhile (<= (value * 10 `div` 16))
491+ PR.dropWhile (<= (value * 11 `div` 16))
492+ PR.dropWhile (<= (value * 12 `div` 16))
493+ PR.dropWhile (<= (value * 13 `div` 16))
494+ PR.dropWhile (<= (value * 14 `div` 16))
495+ PR.dropWhile (<= (value * 15 `div` 16))
496+ PR.dropWhile (<= value)
497+
498+{-# INLINE takeEndBy_ #-}
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+{-
204504{-# INLINE teeAllAny #-}
205−teeAllAny :: MonadCatch m
206− => Int -> SerialT m Int -> m ((), ())
505+teeAllAny :: Monad m
506+ => Int -> Stream m Int -> m ((), ())
207507teeAllAny value =
208− IP.parse
508+ Stream.parse
209509 (PR.teeWith (,)
210− (PR.drainWhile (<= value))
211− (PR.drainWhile (<= value))
510+ (PR.dropWhile (<= value))
511+ (PR.dropWhile (<= value))
212512 )
213513
214514{-# INLINE teeFstAllAny #-}
215−teeFstAllAny :: MonadCatch m
216− => Int -> SerialT m Int -> m ((), ())
515+teeFstAllAny :: Monad m
516+ => Int -> Stream m Int -> m ((), ())
217517teeFstAllAny value =
218− IP.parse
518+ Stream.parse
219519 (PR.teeWithFst (,)
220− (PR.drainWhile (<= value))
221− (PR.drainWhile (<= value))
520+ (PR.dropWhile (<= value))
521+ (PR.dropWhile (<= value))
222522 )
223523
224524{-# INLINE shortestAllAny #-}
225−shortestAllAny :: MonadCatch m
226− => Int -> SerialT m Int -> m ()
525+shortestAllAny :: Monad m
526+ => Int -> Stream m Int -> m (Either ParseError ())
227527shortestAllAny value =
228− IP.parse
528+ Stream.parse
229529 (PR.shortest
230− (PR.drainWhile (<= value))
231− (PR.drainWhile (<= value))
530+ (PR.dropWhile (<= value))
531+ (PR.dropWhile (<= value))
232532 )
233533
234534{-# INLINE longestAllAny #-}
235−longestAllAny :: MonadCatch m
236− => Int -> SerialT m Int -> m ()
535+longestAllAny :: Monad m
536+ => Int -> Stream m Int -> m (Either ParseError ())
237537longestAllAny value =
238− IP.parse
538+ Stream.parse
239539 (PR.longest
240− (PR.drainWhile (<= value))
241− (PR.drainWhile (<= value))
540+ (PR.dropWhile (<= value))
541+ (PR.dropWhile (<= value))
242542 )
243−
244−parseManyChunksOfSum :: Int -> Handle -> IO Int
245−parseManyChunksOfSum n inh =
246− S.length
247− $ IP.parseMany
248− (PR.fromFold $ FL.take n FL.sum)
249− (S.unfold Handle.read inh)
543+-}
250544
251545-------------------------------------------------------------------------------
252−-- Parsing with unfolds
546+-- Spanning
253547-------------------------------------------------------------------------------
254548
255−{-# INLINE parseManyUnfoldArrays #-}
256−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
257−parseManyUnfoldArrays count arrays = do
258− let src = Source.source (Just (Producer.OuterLoop arrays))
259− let parser = PR.fromFold (FL.take count FL.drain)
260− let readSrc =
261− Source.producer
262− $ Producer.concat Producer.fromList Array.producer
263− let streamParser =
264− Producer.simplify (Source.parseMany parser readSrc)
265− S.drain $ S.unfold streamParser src
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)
266569
267570-------------------------------------------------------------------------------
268571-- Parsers in which -fspec-constr-recursive=16 is problematic
@@ -273,63 +576,129 @@ parseManyUnfoldArrays count arrays = do
273576-- not have to rely on it.
274577--
275578{-# INLINE lookAhead #-}
276−lookAhead :: MonadCatch m => Int -> SerialT m Int -> m ()
579+lookAhead :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
277580lookAhead value =
278− IP.parse (PR.lookAhead (PR.takeWhile (<= value) FL.drain) $> ())
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)))
279588
589+-- quadratic complexity
280590{-# INLINE sequenceA #-}
281−sequenceA :: MonadCatch m => Int -> SerialT m Int -> m Int
591+sequenceA :: Monad m => Int -> Stream m Int -> m Int
282592sequenceA value xs = do
283− x <- IP.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
593+ x <- Stream.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
284594 return $ length x
285595
286−{-# INLINE sequenceA_ #-}
287−sequenceA_ :: MonadCatch m => Int -> SerialT m Int -> m ()
288−sequenceA_ value =
289− IP.parse (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
290−
596+-- quadratic complexity
291597{-# INLINE sequence #-}
292−sequence :: MonadCatch m => Int -> SerialT m Int -> m Int
598+sequence :: Monad m => Int -> Stream m Int -> m Int
293599sequence value xs = do
294− x <- IP.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
600+ x <- Stream.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
295601 return $ length x
296602
297603{-# INLINE sequence_ #-}
298−sequence_ :: MonadCatch m => Int -> SerialT m Int -> m ()
299−sequence_ value =
300− IP.parse (F.sequence_ $ replicate value (PR.satisfy (> 0)))
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
301607
608+ where
609+
610+ {-# INLINE f #-}
611+ f m k = m >>= (\_ -> k)
612+
613+-- choice using the "Alternative" instance with direct style parser type has
614+-- quadratic performance complexity.
615+--
302616{-# INLINE choiceAsum #-}
303−choiceAsum :: MonadCatch m => Int -> SerialT m Int -> m Int
617+choiceAsum :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
304618choiceAsum value =
305− IP.parse (asum (replicate value (PR.satisfy (< 0)))
619+ Stream.parse (F.asum (replicate value (PR.satisfy (< 0)))
306620 AP.<|> PR.satisfy (> 0))
307621
622+{-
308623{-# INLINE choice #-}
309−choice :: MonadCatch m => Int -> SerialT m Int -> m Int
624+choice :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
310625choice value =
311− IP.parse
626+ Stream.parse
312627 (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
313645
314646-------------------------------------------------------------------------------
315647-- Stream transformation
316648-------------------------------------------------------------------------------
317649
318650{-# INLINE parseMany #-}
319−parseMany :: MonadCatch m => Int -> SerialT m Int -> m ()
651+parseMany :: Monad m => Int -> Stream m Int -> m ()
320652parseMany n =
321− S.drain
322− . S.map getSum
323− . IP.parseMany (PR.fromFold $ FL.take n FL.mconcat)
324− . S.map Sum
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
325686
326687{-# INLINE parseIterate #-}
327−parseIterate :: MonadCatch m => Int -> SerialT m Int -> m ()
688+parseIterate :: Monad m => Int -> Stream m Int -> m ()
328689parseIterate n =
329− S.drain
330− . S.map getSum
331− . IP.parseIterate (PR.fromFold . FL.take n . FL.sconcat) (Sum 0)
332− . S.map Sum
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
333702
334703-------------------------------------------------------------------------------
335704-- Benchmarks
@@ -338,42 +707,95 @@ parseIterate n =
338707moduleName :: String
339708moduleName = "Data.Parser"
340709
710+instance NFData ParseError where
711+ {-# INLINE rnf #-}
712+ rnf (ParseError x) = rnf x
713+
341714o_1_space_serial :: Int -> [Benchmark]
342715o_1_space_serial value =
343− [ benchIOSink value "next" $ next value
344− , benchIOSink value "takeBetween" $ takeBetween value
345− , benchIOSink value "takeEQ" $ takeEQ value
716+ [ benchIOSink value "takeBetween" $ takeBetween value
346717 , benchIOSink value "takeWhile" $ takeWhile value
718+ , benchIOSink value "takeWhileP" $ takeWhileP value
347719 , benchIOSink value "takeP" $ takeP value
348− , benchIOSink value "drainWhile" $ drainWhile value
349− , benchIOSink value "sliceBeginWith" $ sliceBeginWith value
720+ , benchIOSink value "dropWhile" $ dropWhile value
721+ , benchIOSink value "takeStartBy" $ takeStartBy value
722+ , benchIOSink value "takeEndBy_" $ takeEndBy_ value
350723 , benchIOSink value "groupBy" $ groupBy
351724 , benchIOSink value "groupByRolling" $ groupByRolling
352725 , benchIOSink value "wordBy" $ wordBy value
353− , benchIOSink value "splitAp" $ splitAp 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
354736 , benchIOSink value "splitApBefore" $ splitApBefore value
355737 , benchIOSink value "splitApAfter" $ splitApAfter value
356− , benchIOSink value "serialWith" $ serialWith value
357− , benchIOSink value "sliceSepByP" $ sliceSepByP 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
358751 , benchIOSink value "many" many
359752 , benchIOSink value "many (wordBy even)" $ manyWordByEven
360753 , benchIOSink value "some" some
361754 , benchIOSink value "manyTill" $ manyTill value
362− , benchIOSink value "tee" $ teeAllAny value
363− , benchIOSink value "teeFst" $ teeFstAllAny value
364− , benchIOSink value "shortest" $ shortestAllAny value
365− , benchIOSink value "longest" $ longestAllAny value
755+ , benchIOSink value "parseMany" $ parseMany value
366756 , benchIOSink value "parseMany (take 1)" (parseMany 1)
367757 , 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
368770 , benchIOSink value "parseIterate (take 1)" (parseIterate 1)
369771 , benchIOSink value "parseIterate (take all)" (parseIterate value)
772+ , benchIOSink value "concatSequence" concatSequence
773+ {-
774+ , benchIOSink value "tee" $ teeAllAny value
775+ , benchIOSink value "teeFst" $ teeFstAllAny value
776+ , benchIOSink value "shortest" $ shortestAllAny value
777+ , benchIOSink value "longest" $ longestAllAny value
778+ -}
779+ , benchIOSink value "streamEqBy" (streamEqBy value)
370780 ]
371781
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+
372794o_1_space_filesystem :: BenchEnv -> [Benchmark]
373795o_1_space_filesystem env =
374− [ mkBench ("S.parseMany (FL.take " ++ show (bigSize env) ++ " FL.sum)") env
796+ [ mkBench ("S.parseMany (Fold.take " ++ show (bigSize env) ++ " Fold.sum)") env
375797 $ \inh _ -> noinline parseManyChunksOfSum (bigSize env) inh
376− , mkBench "S.parseMany (FL.take 1 FL.sum)" env
798+ , mkBench "S.parseMany (Fold.take 1 Fold.sum)" env
377799 $ \inh _ -> inline parseManyChunksOfSum 1 inh
378800 ]
379801
@@ -388,26 +810,38 @@ o_1_space_serial_unfold bound arrays =
388810o_n_heap_serial :: Int -> [Benchmark]
389811o_n_heap_serial value =
390812 [
813+ benchIOSink value "takeEQ" $ takeEQ value
814+ , benchIOSink value "takeGE" $ takeGE value
815+
391816 -- lookahead benchmark holds the entire input till end
392− benchIOSink value "lookAhead" $ lookAhead value
817+ , benchIOSink value "lookAhead" $ lookAhead value
393818
394− -- accumulates the results in a list
395− , benchIOSink value "sequence" $ sequence value
396− , benchIOSink value "sequenceA" $ sequenceA value
819+ -- o-n-heap because of backtracking
820+ , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
821+ $ takeFramedByEsc_ value
397822
398− -- XXX why should this take O(n) heap, it discards the results?
399− , benchIOSink value "sequence_" $ sequence_ value
400− , benchIOSink value "sequenceA_" $ sequenceA_ value
401823 -- non-linear time complexity (parserD)
402824 , benchIOSink value "split_" $ split_ value
403− -- XXX why O(n) heap?
404− , benchIOSink value "choice (asum)" $ choiceAsum value
405− , benchIOSink value "choice" $ choice value
825+ -- XXX Takes lot of space when run on a long stream, why?
826+ , benchIOSink value "monad16" $ monad16 value
406827
407828 -- These show non-linear time complexity.
408829 -- They accumulate the results in a list.
830+ , benchIOSink value "sepBy1" sepBy1
409831 , benchIOSink value "manyAlt" manyAlt
410832 , 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)
411845 ]
412846
413847-------------------------------------------------------------------------------
@@ -416,12 +850,13 @@ o_n_heap_serial value =
416850
417851main :: IO ()
418852main = do
853+#ifndef FUSION_CHECK
419854 env <- mkHandleBenchEnv
420855 runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
421856
422857 where
423858
424− alloc value = IP.toList $ IP.arraysOf 100 $ sourceUnfoldrM value 0
859+ alloc value = Stream.fold Fold.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
425860
426861 allBenchmarks env arrays value =
427862 [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
@@ -431,4 +866,22 @@ main = do
431866 , bgroup (o_1_space_prefix moduleName)
432867 (o_1_space_serial_unfold value arrays)
433868 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
869+ , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
434870 ]
871+#else
872+ -- Enable FUSION_CHECK macro at the beginning of the file
873+ -- Enable one benchmark below, and run the benchmark
874+ -- Check the .dump-simpl output
875+ let value = 100000
876+ -- let input = sourceUnfoldrM value 1
877+ -- manyTill value input
878+ -- deintercalate value input
879+ -- deintercalate1 value input
880+ -- deintercalateAll value input
881+ -- sepByWords input
882+ -- sepByAllWords input
883+ -- sepBy1 input
884+ -- sepByWords1 input
885+ takeFramedByEsc_ value (sourceEscapedFrames value 1)
886+ return ()
887+#endif
benchmark/Streamly/Benchmark/Data/Parser/ParserD.hsdeleted−417
@@ -1,417 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.ParserD
3−-- Copyright : (c) 2020 Composewell Technologies
4−--
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−
8−{-# LANGUAGE FlexibleContexts #-}
9−{-# LANGUAGE ScopedTypeVariables #-}
10−{-# OPTIONS_GHC -fspec-constr-recursive=4 #-}
11−
12−module Main
13− (
14− main
15− ) where
16−
17−import Control.DeepSeq (NFData(..))
18−import Control.Monad.Catch (MonadCatch, MonadThrow)
19−import Data.Foldable (asum)
20−import Data.Functor (($>))
21−import Data.Maybe (fromMaybe)
22−import System.Random (randomRIO)
23−import Prelude hiding (any, all, take, sequence, sequenceA, sequence_, takeWhile, span)
24−
25−import qualified Data.Traversable as TR
26−import qualified Data.Foldable as F
27−import qualified Control.Applicative as AP
28−import qualified Streamly.Prelude as S
29−import qualified Streamly.Internal.Data.Array.Foreign as Array
30−import qualified Streamly.Internal.Data.Fold as FL
31−import qualified Streamly.Internal.Data.Parser.ParserD as PR
32−import qualified Streamly.Internal.Data.Producer as Producer
33−import qualified Streamly.Internal.Data.Producer.Source as Source
34−import qualified Streamly.Internal.Data.Stream.IsStream as IP
35−
36−import Gauge
37−import Streamly.Prelude (SerialT, MonadAsync, IsStream)
38−import Streamly.Benchmark.Common
39−
40−-------------------------------------------------------------------------------
41−-- Utilities
42−-------------------------------------------------------------------------------
43−
44−-- XXX these can be moved to the common module
45−
46−{-# INLINE sourceUnfoldrM #-}
47−sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
48−sourceUnfoldrM value n = S.unfoldrM step n
49− where
50− step cnt =
51− if cnt > n + value
52− then return Nothing
53− else return (Just (cnt, cnt + 1))
54−
55−-- | Takes a fold method, and uses it with a default source.
56−{-# INLINE benchIOSink #-}
57−benchIOSink
58− :: (IsStream t, NFData b)
59− => Int -> String -> (t IO Int -> IO b) -> Benchmark
60−benchIOSink value name f =
61− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
62−
63−-- Make the input unsorted.
64−{-# INLINE benchIOSinkRandom #-}
65−benchIOSinkRandom
66− :: (IsStream t, NFData b)
67− => Int -> String -> (t IO Int -> IO b) -> Benchmark
68−benchIOSinkRandom value name f =
69− bench name $ nfIO $ randomRIO (1,1)
70− >>= f
71− . S.map (\x -> if even x then x + 2 else x)
72− . sourceUnfoldrM value
73−
74−-------------------------------------------------------------------------------
75−-- Parsers
76−-------------------------------------------------------------------------------
77−
78−{-# INLINE drainWhile #-}
79−drainWhile :: MonadThrow m => (a -> Bool) -> PR.Parser m a ()
80−drainWhile p = PR.takeWhile p FL.drain
81−
82−{-# INLINE sliceBeginWith #-}
83−sliceBeginWith :: MonadCatch m => Int -> SerialT m Int -> m ()
84−sliceBeginWith value stream = do
85− stream1 <- return . fromMaybe (S.fromPure (value + 1)) =<< S.tail stream
86− let stream2 = value `S.cons` stream1
87− IP.parseD (PR.sliceBeginWith (== value) FL.drain) stream2
88−
89−{-# INLINE takeWhile #-}
90−takeWhile :: MonadThrow m => Int -> SerialT m Int -> m ()
91−takeWhile value = IP.parseD (drainWhile (<= value))
92−
93−{-# INLINE takeP #-}
94−takeP :: MonadThrow m => Int -> SerialT m a -> m ()
95−takeP value = IP.parseD (PR.takeP value (PR.fromFold FL.drain))
96−
97−{-# INLINE takeBetween #-}
98−takeBetween :: MonadCatch m => Int -> SerialT m a -> m ()
99−takeBetween value = IP.parseD (PR.takeBetween 0 value FL.drain)
100−
101−{-# INLINE groupBy #-}
102−groupBy :: MonadThrow m => SerialT m Int -> m ()
103−groupBy = IP.parseD (PR.groupBy (<=) FL.drain)
104−
105−{-# INLINE groupByRolling #-}
106−groupByRolling :: MonadThrow m => SerialT m Int -> m ()
107−groupByRolling = IP.parseD (PR.groupByRolling (<=) FL.drain)
108−
109−{-# INLINE wordBy #-}
110−wordBy :: MonadThrow m => Int -> SerialT m Int -> m ()
111−wordBy value = IP.parseD (PR.wordBy (>= value) FL.drain)
112−
113−{-# INLINE manyWordByEven #-}
114−manyWordByEven :: MonadCatch m => SerialT m Int -> m ()
115−manyWordByEven =
116− IP.parseD (PR.many (PR.wordBy (Prelude.even) FL.drain) FL.drain)
117−
118−{-# INLINE many #-}
119−many :: MonadCatch m => SerialT m Int -> m Int
120−many = IP.parseD (PR.many (PR.satisfy (> 0)) FL.length)
121−
122−{-# INLINE manyAlt #-}
123−manyAlt :: MonadCatch m => SerialT m Int -> m Int
124−manyAlt xs = do
125− x <- IP.parseD (AP.many (PR.satisfy (> 0))) xs
126− return $ Prelude.length x
127−
128−{-# INLINE some #-}
129−some :: MonadCatch m => SerialT m Int -> m Int
130−some = IP.parseD (PR.some (PR.satisfy (> 0)) FL.length)
131−
132−{-# INLINE someAlt #-}
133−someAlt :: MonadCatch m => SerialT m Int -> m Int
134−someAlt xs = do
135− x <- IP.parseD (AP.some (PR.satisfy (> 0))) xs
136− return $ Prelude.length x
137−
138−{-#INLINE sliceSepByP #-}
139−sliceSepByP :: MonadCatch m => Int -> SerialT m Int -> m ()
140−sliceSepByP value = IP.parseD (PR.sliceSepByP (>= value) (PR.fromFold FL.drain))
141−
142−{-# INLINE manyTill #-}
143−manyTill :: MonadCatch m => Int -> SerialT m Int -> m Int
144−manyTill value =
145− let p = PR.satisfy (> 0)
146− pcond = PR.satisfy (== value)
147− in IP.parseD (PR.manyTill FL.length p pcond)
148−
149−{-# INLINE serialWith #-}
150−serialWith :: MonadThrow m
151− => Int -> SerialT m Int -> m ((), ())
152−serialWith value =
153− IP.parseD
154− ((,)
155− <$> drainWhile (<= (value `div` 2))
156− <*> drainWhile (<= value)
157− )
158−
159−{-# INLINE teeAllAny #-}
160−teeAllAny :: MonadThrow m
161− => Int -> SerialT m Int -> m ((), ())
162−teeAllAny value =
163− IP.parseD
164− (PR.teeWith (,)
165− (drainWhile (<= value))
166− (drainWhile (<= value))
167− )
168−
169−{-# INLINE teeFstAllAny #-}
170−teeFstAllAny :: MonadThrow m
171− => Int -> SerialT m Int -> m ((), ())
172−teeFstAllAny value =
173− IP.parseD
174− (PR.teeWithFst (,)
175− (drainWhile (<= value))
176− (drainWhile (<= value))
177− )
178−
179−{-# INLINE shortestAllAny #-}
180−shortestAllAny :: MonadThrow m
181− => Int -> SerialT m Int -> m ()
182−shortestAllAny value =
183− IP.parseD
184− (PR.shortest
185− (drainWhile (<= value))
186− (drainWhile (<= value))
187− )
188−
189−{-# INLINE longestAllAny #-}
190−longestAllAny :: MonadCatch m
191− => Int -> SerialT m Int -> m ()
192−longestAllAny value =
193− IP.parseD
194− (PR.longest
195− (drainWhile (<= value))
196− (drainWhile (<= value))
197− )
198−
199−-------------------------------------------------------------------------------
200−-- Spanning
201−-------------------------------------------------------------------------------
202−
203−{-# INLINE span #-}
204−span :: MonadThrow m => Int -> SerialT m Int -> m ((), ())
205−span value = IP.parseD (PR.span (<= (value `div` 2)) FL.drain FL.drain)
206−
207−{-# INLINE spanBy #-}
208−spanBy :: MonadThrow m => Int -> SerialT m Int -> m ((), ())
209−spanBy value =
210− IP.parseD (PR.spanBy (\_ i -> i <= (value `div` 2)) FL.drain FL.drain)
211−
212−{-# INLINE spanByRolling #-}
213−spanByRolling :: MonadThrow m => Int -> SerialT m Int -> m ((), ())
214−spanByRolling value =
215− IP.parseD (PR.spanByRolling (\_ i -> i <= value `div` 2) FL.drain FL.drain)
216−
217−-------------------------------------------------------------------------------
218−-- Nested
219−-------------------------------------------------------------------------------
220−
221−{-# INLINE parseMany #-}
222−parseMany :: MonadThrow m => Int -> SerialT m Int -> m ()
223−parseMany value = IP.drain . IP.parseManyD (drainWhile (<= value + 1))
224−
225−{-# INLINE parseManyGroups #-}
226−parseManyGroups :: MonadThrow m => Bool -> SerialT m Int -> m ()
227−parseManyGroups b = IP.drain . IP.parseManyD (PR.groupBy (\_ _ -> b) FL.drain)
228−
229−{-# INLINE parseManyGroupsRolling #-}
230−parseManyGroupsRolling :: MonadThrow m => Bool -> SerialT m Int -> m ()
231−parseManyGroupsRolling b =
232− IP.drain . IP.parseManyD (PR.groupByRolling (\_ _ -> b) FL.drain)
233−
234−{-# INLINE parseManyGroupsRollingEither #-}
235−parseManyGroupsRollingEither :: (MonadThrow m, MonadCatch m) =>
236− (Int -> Int -> Bool) -> SerialT m Int -> m ()
237−parseManyGroupsRollingEither cmp =
238− IP.drain
239− . IP.parseManyD (PR.groupByRollingEither cmp FL.drain FL.drain)
240−
241−-------------------------------------------------------------------------------
242−-- Parsing with unfolds
243−-------------------------------------------------------------------------------
244−
245−{-# INLINE parseManyUnfoldArrays #-}
246−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
247−parseManyUnfoldArrays count arrays = do
248− let src = Source.source (Just (Producer.OuterLoop arrays))
249− let parser = PR.fromFold (FL.take count FL.drain)
250− let readSrc =
251− Source.producer
252− $ Producer.concat Producer.fromList Array.producer
253− let streamParser =
254− Producer.simplify (Source.parseManyD parser readSrc)
255− S.drain $ S.unfold streamParser src
256−
257−-------------------------------------------------------------------------------
258−-- Parsers in which -fspec-constr-recursive=16 is problematic
259−-------------------------------------------------------------------------------
260−
261−-- XXX -fspec-constr-recursive=16 makes GHC go beserk when compiling these.
262−-- We need to fix GHC so that we can have better control over that option or do
263−-- not have to rely on it.
264−--
265−{-# INLINE lookAhead #-}
266−lookAhead :: MonadThrow m => Int -> SerialT m Int -> m ()
267−lookAhead value =
268− IP.parseD (PR.lookAhead (PR.takeWhile (<= value) FL.drain) $> ())
269−
270−{-# INLINE sequenceA_ #-}
271−sequenceA_ :: MonadThrow m => Int -> SerialT m Int -> m ()
272−sequenceA_ value =
273− IP.parseD (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
274−
275−-- quadratic complexity
276−{-# INLINE sequenceA #-}
277−sequenceA :: MonadThrow m => Int -> SerialT m Int -> m Int
278−sequenceA value xs = do
279− x <- IP.parseD (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
280− return $ length x
281−
282−-- quadratic complexity
283−{-# INLINE sequence #-}
284−sequence :: MonadThrow m => Int -> SerialT m Int -> m Int
285−sequence value xs = do
286− x <- IP.parseD (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
287− return $ length x
288−
289−{-# INLINE sequence_ #-}
290−sequence_ :: MonadCatch m => Int -> SerialT m Int -> m ()
291−sequence_ value xs =
292− IP.parseD (foldr f (return ()) (replicate value (PR.takeBetween 0 1 FL.drain))) xs
293−
294− where
295−
296− {-# INLINE f #-}
297− f m k = m >>= (\_ -> k)
298−
299−-- choice using the "Alternative" instance with direct style parser type has
300−-- quadratic performance complexity.
301−--
302−{-# INLINE choiceAsum #-}
303−choiceAsum :: MonadCatch m => Int -> SerialT m Int -> m Int
304−choiceAsum value =
305− IP.parseD (asum (replicate value (PR.satisfy (< 0)))
306− AP.<|> PR.satisfy (> 0))
307−
308−{-# INLINE choice #-}
309−choice :: MonadCatch m => Int -> SerialT m Int -> m Int
310−choice value =
311− IP.parseD
312− (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
313−
314−-------------------------------------------------------------------------------
315−-- Benchmarks
316−-------------------------------------------------------------------------------
317−
318−moduleName :: String
319−moduleName = "Data.Parser.ParserD"
320−
321−o_1_space_serial :: Int -> [Benchmark]
322−o_1_space_serial value =
323− [ benchIOSink value "takeWhile" $ takeWhile value
324− , benchIOSink value "takeP" $ takeP value
325− , benchIOSink value "takeBetween" $ takeBetween value
326− , benchIOSink value "sliceBeginWith" $ sliceBeginWith value
327− , benchIOSink value "groupBy" $ groupBy
328− , benchIOSink value "groupByRolling" $ groupByRolling
329− , benchIOSink value "wordBy" $ wordBy value
330− , benchIOSink value "serialWith" $ serialWith value
331− , benchIOSink value "many" many
332− , benchIOSink value "many (wordBy even)" $ manyWordByEven
333− , benchIOSink value "some" some
334− , benchIOSink value "sliceSepByP" $ sliceSepByP value
335− , benchIOSink value "manyTill" $ manyTill value
336− , benchIOSink value "tee (all,any)" $ teeAllAny value
337− , benchIOSink value "teeFst (all,any)" $ teeFstAllAny value
338− , benchIOSink value "shortest (all,any)" $ shortestAllAny value
339− , benchIOSink value "longest (all,any)" $ longestAllAny value
340− ]
341−
342−o_1_space_serial_spanning :: Int -> [Benchmark]
343−o_1_space_serial_spanning value =
344− [ benchIOSink value "span" $ span value
345− , benchIOSink value "spanBy" $ spanBy value
346− , benchIOSink value "spanByRolling" $ spanByRolling value
347− ]
348−
349−o_1_space_serial_nested :: Int -> [Benchmark]
350−o_1_space_serial_nested value =
351− [ benchIOSink value "parseMany" $ parseMany value
352− , benchIOSink value "parseMany groupBy (bound groups)"
353− $ parseManyGroups False
354− , benchIOSink value "parseMany groupRollingBy (bound groups)"
355− $ parseManyGroupsRolling False
356− , benchIOSink value "parseMany groupBy (1 group)" $ parseManyGroups True
357− , benchIOSink value "parseMany groupRollingBy (1 group)"
358− $ parseManyGroupsRolling True
359− , benchIOSink value "parseMany groupRollingByEither (Left)"
360− $ parseManyGroupsRollingEither (<)
361− , benchIOSink value "parseMany groupRollingByEither (Right)"
362− $ parseManyGroupsRollingEither (>)
363− , benchIOSinkRandom value "parseMany groupRollingByEither (Alternating)"
364− $ parseManyGroupsRollingEither (>)
365− ]
366−
367−o_1_space_serial_unfold :: Int -> [Array.Array Int] -> [Benchmark]
368−o_1_space_serial_unfold bound arrays =
369− [ bench "parseMany/Unfold/1000 arrays/1 parse"
370− $ nfIO $ parseManyUnfoldArrays bound arrays
371− , bench "parseMany/Unfold/1000 arrays/100000 parses"
372− $ nfIO $ parseManyUnfoldArrays 1 arrays
373− ]
374−
375−o_n_heap_serial :: Int -> [Benchmark]
376−o_n_heap_serial value =
377− [
378− -- lookahead benchmark holds the entire input till end
379− benchIOSink value "lookAhead" $ lookAhead value
380−
381− -- These show non-linear time complexity
382− -- They accumulate the results in a list.
383− , benchIOSink value "manyAlt" manyAlt
384− , benchIOSink value "someAlt" someAlt
385− ]
386−
387−-- accumulate results in a list in IO
388−o_n_space_serial :: Int -> [Benchmark]
389−o_n_space_serial value =
390− [ benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100)
391− , benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100)
392− , benchIOSink value "sequence/100" $ sequence (value `div` 100)
393− , benchIOSink value "sequence_/100" $ sequence_ (value `div` 100)
394− , benchIOSink value "choice (asum)/100" $ choiceAsum (value `div` 100)
395− , benchIOSink value "choice/100" $ choice (value `div` 100)
396− ]
397−
398−-------------------------------------------------------------------------------
399−-- Driver
400−-------------------------------------------------------------------------------
401−
402−main :: IO ()
403−main = runWithCLIOptsEnv defaultStreamSize alloc allBenchmarks
404−
405− where
406−
407− alloc value = IP.toList $ IP.arraysOf 100 $ sourceUnfoldrM value 0
408−
409− allBenchmarks arraysSmall value =
410− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
411− , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_spanning value)
412− , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_nested value)
413− , bgroup (o_1_space_prefix moduleName)
414− (o_1_space_serial_unfold value arraysSmall)
415− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
416− , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
417− ]
benchmark/Streamly/Benchmark/Data/Parser/ParserK.hsdeleted−163
@@ -1,163 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.ParserK
3−-- Copyright : (c) 2020 Composewell Technologies
4−--
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−
8−{-# LANGUAGE CPP #-}
9−{-# LANGUAGE FlexibleContexts #-}
10−
11−module Main
12− (
13− main
14− ) where
15−
16−import Control.DeepSeq (NFData(..))
17−import Control.Monad.Catch (MonadCatch)
18−import Data.Foldable (asum)
19−import System.Random (randomRIO)
20−import Prelude hiding (any, all, take, sequence, sequenceA, takeWhile)
21−
22−import qualified Control.Applicative as AP
23−import qualified Data.Foldable as F
24−import qualified Data.Traversable as TR
25−import qualified Streamly.Prelude as S
26−import qualified Streamly.Internal.Data.Fold as FL
27−import qualified Streamly.Internal.Data.Parser.ParserK.Type as PR
28−import qualified Streamly.Internal.Data.Parser.ParserD as PRD
29−import qualified Streamly.Internal.Data.Stream.IsStream as IP
30−
31−import Gauge
32−import Streamly.Prelude (SerialT, MonadAsync, IsStream)
33−import Streamly.Benchmark.Common
34−
35−-------------------------------------------------------------------------------
36−-- Utilities
37−-------------------------------------------------------------------------------
38−
39−-- XXX these can be moved to the common module
40−
41−{-# INLINE sourceUnfoldrM #-}
42−sourceUnfoldrM :: (IsStream t, MonadAsync m) => Int -> Int -> t m Int
43−sourceUnfoldrM value n = S.unfoldrM step n
44− where
45− step cnt =
46− if cnt > n + value
47− then return Nothing
48− else return (Just (cnt, cnt + 1))
49−
50−-- | Takes a fold method, and uses it with a default source.
51−{-# INLINE benchIOSink #-}
52−benchIOSink
53− :: (IsStream t, NFData b)
54− => Int -> String -> (t IO Int -> IO b) -> Benchmark
55−benchIOSink value name f =
56− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
57−
58−-------------------------------------------------------------------------------
59−-- Parsers
60−-------------------------------------------------------------------------------
61−
62−#ifdef FROM_PARSERK
63−#define PARSE_OP (IP.parseD . PRD.fromParserK)
64−#else
65−#define PARSE_OP IP.parseK
66−#endif
67−
68−{-# INLINE satisfy #-}
69−satisfy :: MonadCatch m => (a -> Bool) -> PR.Parser m a a
70−satisfy = PRD.toParserK . PRD.satisfy
71−
72−{-# INLINE takeWhile #-}
73−takeWhile :: MonadCatch m => (a -> Bool) -> PR.Parser m a ()
74−takeWhile p = PRD.toParserK $ PRD.takeWhile p FL.drain
75−
76−{-# INLINE takeWhileK #-}
77−takeWhileK :: MonadCatch m => Int -> SerialT m Int -> m ()
78−takeWhileK value = PARSE_OP (takeWhile (<= value))
79−
80−{-# INLINE splitApp #-}
81−splitApp :: MonadCatch m
82− => Int -> SerialT m Int -> m ((), ())
83−splitApp value =
84− PARSE_OP ((,) <$> takeWhile (<= (value `div` 2)) <*> takeWhile (<= value))
85−
86−{-# INLINE sequenceA #-}
87−sequenceA :: MonadCatch m => Int -> SerialT m Int -> m Int
88−sequenceA value xs = do
89− let parser = satisfy (> 0)
90− list = Prelude.replicate value parser
91− x <- PARSE_OP (TR.sequenceA list) xs
92− return $ Prelude.length x
93−
94−{-# INLINE sequenceA_ #-}
95−sequenceA_ :: MonadCatch m => Int -> SerialT m Int -> m ()
96−sequenceA_ value xs = do
97− let parser = satisfy (> 0)
98− list = Prelude.replicate value parser
99− PARSE_OP (F.sequenceA_ list) xs
100−
101−{-# INLINE sequence #-}
102−sequence :: MonadCatch m => Int -> SerialT m Int -> m Int
103−sequence value xs = do
104− let parser = satisfy (> 0)
105− list = Prelude.replicate value parser
106− x <- PARSE_OP (TR.sequence list) xs
107− return $ Prelude.length x
108−
109−{-# INLINE manyAlt #-}
110−manyAlt :: MonadCatch m => SerialT m Int -> m Int
111−manyAlt xs = do
112− x <- PARSE_OP (AP.many (satisfy (> 0))) xs
113− return $ Prelude.length x
114−
115−{-# INLINE someAlt #-}
116−someAlt :: MonadCatch m => SerialT m Int -> m Int
117−someAlt xs = do
118− x <- PARSE_OP (AP.some (satisfy (> 0))) xs
119− return $ Prelude.length x
120−
121−{-# INLINE choice #-}
122−choice :: MonadCatch m => Int -> SerialT m Int -> m Int
123−choice value =
124− PARSE_OP (asum (replicate value (satisfy (< 0)))
125− AP.<|> satisfy (> 0))
126−
127−-------------------------------------------------------------------------------
128−-- Benchmarks
129−-------------------------------------------------------------------------------
130−
131−moduleName :: String
132−moduleName = "Data.Parser.ParserK"
133−
134−o_1_space_serial :: Int -> [Benchmark]
135−o_1_space_serial value =
136− [ benchIOSink value "takeWhile" $ takeWhileK value
137− , benchIOSink value "splitApp" $ splitApp value
138− ]
139−
140−-- O(n) heap beacuse of accumulation of the list in strict IO monad?
141−o_n_heap_serial :: Int -> [Benchmark]
142−o_n_heap_serial value =
143− [ benchIOSink value "sequenceA" $ sequenceA value
144− , benchIOSink value "sequenceA_" $ sequenceA_ value
145− , benchIOSink value "sequence" $ sequence value
146− , benchIOSink value "manyAlt" manyAlt
147− , benchIOSink value "someAlt" someAlt
148− , benchIOSink value "choice" $ choice value
149− ]
150−
151−-------------------------------------------------------------------------------
152−-- Driver
153−-------------------------------------------------------------------------------
154−
155−main :: IO ()
156−main = runWithCLIOpts defaultStreamSize allBenchmarks
157−
158− where
159−
160− allBenchmarks value =
161− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
162− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
163− ]
benchmark/Streamly/Benchmark/Data/ParserK.hsnew file+437
@@ -0,0 +1,437 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.ParserK
3+-- Copyright : (c) 2020 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+
8+-- BENCH_CHUNKED -> adaptC
9+-- BENCH_CHUNKED_GENERIC -> adaptCG
10+-- BENCH_SINGULAR -> adapt
11+
12+{-# LANGUAGE CPP #-}
13+{-# LANGUAGE FlexibleContexts #-}
14+{-# OPTIONS_GHC -Wno-orphans #-}
15+
16+module Main
17+ (
18+ main
19+ ) where
20+
21+import Control.Applicative ((<|>))
22+import Control.DeepSeq (NFData(..))
23+import Control.Monad.IO.Class (MonadIO)
24+import Data.Foldable (asum)
25+#ifdef BENCH_CHUNKED
26+import Streamly.Data.Array (Array, Unbox)
27+#endif
28+#ifdef BENCH_CHUNKED_GENERIC
29+import Streamly.Data.Array.Generic (Array)
30+import qualified Streamly.Internal.Data.Array.Generic as GenArr (chunksOf)
31+#endif
32+import Streamly.Internal.Data.Fold (Fold(..))
33+import Streamly.Data.StreamK (StreamK)
34+import Streamly.Internal.Data.Parser
35+ (ParseError(..), Parser(..), Initial(..), Step(..))
36+import Streamly.Internal.Data.Stream (Stream)
37+import System.Random (randomRIO)
38+import Prelude hiding
39+ (any, all, take, sequence, sequence_, sequenceA, takeWhile)
40+
41+import qualified Control.Applicative as AP
42+import qualified Data.Foldable as F
43+import qualified Data.Traversable as TR
44+import qualified Streamly.Data.Stream as Stream
45+import qualified Streamly.Data.Fold as FL
46+import qualified Streamly.Internal.Data.Fold as Fold
47+import qualified Streamly.Data.Parser as PRD
48+import qualified Streamly.Internal.Data.ParserK as PR
49+import qualified Streamly.Internal.Data.StreamK as StreamK
50+
51+import Test.Tasty.Bench
52+import Streamly.Benchmark.Common
53+
54+-------------------------------------------------------------------------------
55+-- CPP Helpers
56+-------------------------------------------------------------------------------
57+
58+#ifdef BENCH_CHUNKED
59+
60+#define PARSE_OP StreamK.parseChunks
61+#define FROM_PARSER adaptC
62+#define INPUT (Array a)
63+#define PARSE_ELEM (Array Int)
64+#define CONSTRAINT_IO (MonadIO m, Unbox a)
65+#define CONSTRAINT (Monad m, Unbox a)
66+#define MODULE_NAME "Data.ParserK.Chunked"
67+
68+#endif
69+
70+#ifdef BENCH_CHUNKED_GENERIC
71+
72+#define PARSE_OP StreamK.parseChunksGeneric
73+#define FROM_PARSER adaptCG
74+#define INPUT (Array a)
75+#define PARSE_ELEM (Array Int)
76+#define CONSTRAINT_IO (MonadIO m)
77+#define CONSTRAINT (Monad m)
78+#define MODULE_NAME "Data.ParserK.Chunked.Generic"
79+
80+#endif
81+
82+#ifdef BENCH_SINGULAR
83+
84+#define PARSE_OP StreamK.parse
85+#define FROM_PARSER adapt
86+#define INPUT a
87+#define PARSE_ELEM Int
88+#define CONSTRAINT_IO (MonadIO m)
89+#define CONSTRAINT (Monad m)
90+#define MODULE_NAME "Data.ParserK"
91+
92+#endif
93+
94+-------------------------------------------------------------------------------
95+-- Utilities
96+-------------------------------------------------------------------------------
97+
98+-- XXX these can be moved to the common module
99+
100+{-# INLINE sourceUnfoldrM #-}
101+sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
102+sourceUnfoldrM value n = Stream.unfoldrM step n
103+ where
104+ step cnt =
105+ if cnt > n + value
106+ then return Nothing
107+ else return (Just (cnt, cnt + 1))
108+
109+-- | Takes a fold method, and uses it with a default source.
110+{-# INLINE benchIOSink #-}
111+benchIOSink
112+ :: NFData b
113+ => Int -> String -> (StreamK IO PARSE_ELEM -> IO b) -> Benchmark
114+benchIOSink value name f =
115+ bench name $ nfIO $ randomRIO (1,1)
116+ >>= f
117+ . StreamK.fromStream
118+#ifdef BENCH_CHUNKED
119+ . Stream.chunksOf 4000
120+#endif
121+#ifdef BENCH_CHUNKED_GENERIC
122+ . GenArr.chunksOf 4000
123+#endif
124+ . sourceUnfoldrM value
125+
126+-------------------------------------------------------------------------------
127+-- Parsers
128+-------------------------------------------------------------------------------
129+
130+{-# INLINE one #-}
131+one :: MonadIO m =>
132+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError (Maybe Int))
133+one value = PARSE_OP p
134+
135+ where
136+
137+ p = do
138+ m <- PR.FROM_PARSER (PRD.fromFold FL.one)
139+ case m of
140+ Just i -> if i >= value then pure m else p
141+ Nothing -> pure Nothing
142+
143+{-# INLINE satisfy #-}
144+satisfy :: CONSTRAINT_IO => (a -> Bool) -> PR.ParserK INPUT m a
145+satisfy = PR.FROM_PARSER . PRD.satisfy
146+
147+{-# INLINE takeWhile #-}
148+takeWhile :: CONSTRAINT_IO => (a -> Bool) -> PR.ParserK INPUT m ()
149+takeWhile p = PR.FROM_PARSER $ PRD.takeWhile p FL.drain
150+
151+{-# INLINE takeWhileK #-}
152+takeWhileK :: MonadIO m =>
153+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
154+takeWhileK value = PARSE_OP (takeWhile (<= value))
155+
156+{-# INLINE splitAp2 #-}
157+splitAp2 :: MonadIO m
158+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ((), ()))
159+splitAp2 value =
160+ PARSE_OP
161+ ((,)
162+ <$> takeWhile (<= (value `div` 2))
163+ <*> takeWhile (<= value)
164+ )
165+
166+{-# INLINE splitAp8 #-}
167+splitAp8 :: MonadIO m
168+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
169+splitAp8 value =
170+ PARSE_OP
171+ ( (\() () () () () () () () -> ())
172+ <$> takeWhile (<= ( value `div` 8))
173+ <*> takeWhile (<= ((value * 2) `div` 8))
174+ <*> takeWhile (<= ((value * 3) `div` 8))
175+ <*> takeWhile (<= ((value * 4) `div` 8))
176+ <*> takeWhile (<= ((value * 5) `div` 8))
177+ <*> takeWhile (<= ((value * 6) `div` 8))
178+ <*> takeWhile (<= ((value * 7) `div` 8))
179+ <*> takeWhile (<= value)
180+ )
181+
182+{-# INLINE sequenceA #-}
183+sequenceA :: MonadIO m => Int -> StreamK m PARSE_ELEM -> m Int
184+sequenceA value xs = do
185+ let parser = satisfy (> 0)
186+ list = Prelude.replicate value parser
187+ x <- PARSE_OP (TR.sequenceA list) xs
188+ return $ Prelude.length x
189+
190+{-# INLINE sequenceA_ #-}
191+sequenceA_ :: MonadIO m =>
192+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
193+sequenceA_ value xs = do
194+ let parser = satisfy (> 0)
195+ list = Prelude.replicate value parser
196+ PARSE_OP (F.sequenceA_ list) xs
197+
198+{-# INLINE sequence #-}
199+sequence :: MonadIO m => Int -> StreamK m PARSE_ELEM -> m Int
200+sequence value xs = do
201+ let parser = satisfy (> 0)
202+ list = Prelude.replicate value parser
203+ x <- PARSE_OP (TR.sequence list) xs
204+ return $ Prelude.length x
205+
206+{-# INLINE sequence_ #-}
207+sequence_ :: MonadIO m =>
208+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
209+sequence_ value =
210+ let parser = satisfy (> 0)
211+ list = Prelude.replicate value parser
212+ in PARSE_OP (F.sequence_ list)
213+
214+{-# INLINE takeWhileFailD #-}
215+takeWhileFailD :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
216+takeWhileFailD predicate (Fold fstep finitial _ ffinal) =
217+ Parser step initial extract
218+
219+ where
220+
221+ initial = do
222+ res <- finitial
223+ return $ case res of
224+ Fold.Partial s -> IPartial s
225+ Fold.Done b -> IDone b
226+
227+ step s a =
228+ if predicate a
229+ then do
230+ fres <- fstep s a
231+ return
232+ $ case fres of
233+ Fold.Partial s1 -> Partial 0 s1
234+ Fold.Done b -> Done 0 b
235+ else return $ Error "fail"
236+
237+ extract s = fmap (Done 0) (ffinal s)
238+
239+{-# INLINE takeWhileFail #-}
240+takeWhileFail :: CONSTRAINT =>
241+ (a -> Bool) -> Fold m a b -> PR.ParserK INPUT m b
242+takeWhileFail p f = PR.FROM_PARSER (takeWhileFailD p f)
243+
244+{-# INLINE alt2 #-}
245+alt2 :: MonadIO m
246+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
247+alt2 value =
248+ PARSE_OP
249+ ( takeWhileFail (<= (value `div` 2)) Fold.drain
250+ <|> takeWhile (<= value)
251+ )
252+
253+{-# INLINE alt8 #-}
254+alt8 :: MonadIO m
255+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
256+alt8 value =
257+ PARSE_OP
258+ ( takeWhileFail (<= ( value `div` 8)) Fold.drain
259+ <|> takeWhileFail (<= ((value * 2) `div` 8)) Fold.drain
260+ <|> takeWhileFail (<= ((value * 3) `div` 8)) Fold.drain
261+ <|> takeWhileFail (<= ((value * 4) `div` 8)) Fold.drain
262+ <|> takeWhileFail (<= ((value * 5) `div` 8)) Fold.drain
263+ <|> takeWhileFail (<= ((value * 6) `div` 8)) Fold.drain
264+ <|> takeWhileFail (<= ((value * 7) `div` 8)) Fold.drain
265+ <|> takeWhile (<= value)
266+ )
267+
268+{-# INLINE alt16 #-}
269+alt16 :: MonadIO m
270+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
271+alt16 value =
272+ PARSE_OP
273+ ( takeWhileFail (<= ( value `div` 16)) Fold.drain
274+ <|> takeWhileFail (<= ((value * 2) `div` 16)) Fold.drain
275+ <|> takeWhileFail (<= ((value * 3) `div` 16)) Fold.drain
276+ <|> takeWhileFail (<= ((value * 4) `div` 16)) Fold.drain
277+ <|> takeWhileFail (<= ((value * 5) `div` 16)) Fold.drain
278+ <|> takeWhileFail (<= ((value * 6) `div` 16)) Fold.drain
279+ <|> takeWhileFail (<= ((value * 7) `div` 16)) Fold.drain
280+ <|> takeWhileFail (<= ((value * 8) `div` 16)) Fold.drain
281+ <|> takeWhileFail (<= ((value * 9) `div` 16)) Fold.drain
282+ <|> takeWhileFail (<= ((value * 10) `div` 16)) Fold.drain
283+ <|> takeWhileFail (<= ((value * 11) `div` 16)) Fold.drain
284+ <|> takeWhileFail (<= ((value * 12) `div` 16)) Fold.drain
285+ <|> takeWhileFail (<= ((value * 13) `div` 16)) Fold.drain
286+ <|> takeWhileFail (<= ((value * 14) `div` 16)) Fold.drain
287+ <|> takeWhileFail (<= ((value * 15) `div` 16)) Fold.drain
288+ <|> takeWhile (<= value)
289+ )
290+
291+{-# INLINE manyAlt #-}
292+manyAlt :: MonadIO m => StreamK m PARSE_ELEM -> m Int
293+manyAlt xs = do
294+ x <- PARSE_OP (AP.many (satisfy (> 0))) xs
295+ return $ Prelude.length x
296+
297+{-# INLINE someAlt #-}
298+someAlt :: MonadIO m => StreamK m PARSE_ELEM -> m Int
299+someAlt xs = do
300+ x <- PARSE_OP (AP.some (satisfy (> 0))) xs
301+ return $ Prelude.length x
302+
303+{-# INLINE choice #-}
304+choice :: MonadIO m =>
305+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError Int)
306+choice value =
307+ PARSE_OP (asum (replicate value (satisfy (< 0)))
308+ AP.<|> satisfy (> 0))
309+
310+{-# INLINE monad2 #-}
311+monad2 :: MonadIO m
312+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
313+monad2 value =
314+ PARSE_OP $ do
315+ takeWhile (<= (value `div` 2))
316+ takeWhile (<= value)
317+
318+{-# INLINE monad4 #-}
319+monad4 :: MonadIO m
320+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
321+monad4 value =
322+ PARSE_OP $ do
323+ takeWhile (<= ( value `div` 4))
324+ takeWhile (<= ((value * 2) `div` 4))
325+ takeWhile (<= ((value * 3) `div` 4))
326+ takeWhile (<= value)
327+
328+{-# INLINE monad8 #-}
329+monad8 :: MonadIO m
330+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
331+monad8 value =
332+ PARSE_OP $ do
333+ takeWhile (<= ( value `div` 8))
334+ takeWhile (<= ((value * 2) `div` 8))
335+ takeWhile (<= ((value * 3) `div` 8))
336+ takeWhile (<= ((value * 4) `div` 8))
337+ takeWhile (<= ((value * 5) `div` 8))
338+ takeWhile (<= ((value * 6) `div` 8))
339+ takeWhile (<= ((value * 7) `div` 8))
340+ takeWhile (<= value)
341+
342+{-# INLINE monad16 #-}
343+monad16 :: MonadIO m
344+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
345+monad16 value =
346+ PARSE_OP $ do
347+ takeWhile (<= ( value `div` 16))
348+ takeWhile (<= ((value * 2) `div` 16))
349+ takeWhile (<= ((value * 3) `div` 16))
350+ takeWhile (<= ((value * 4) `div` 16))
351+ takeWhile (<= ((value * 5) `div` 16))
352+ takeWhile (<= ((value * 6) `div` 16))
353+ takeWhile (<= ((value * 7) `div` 16))
354+ takeWhile (<= ((value * 8) `div` 16))
355+ takeWhile (<= ((value * 9) `div` 16))
356+ takeWhile (<= ((value * 10) `div` 16))
357+ takeWhile (<= ((value * 11) `div` 16))
358+ takeWhile (<= ((value * 12) `div` 16))
359+ takeWhile (<= ((value * 13) `div` 16))
360+ takeWhile (<= ((value * 14) `div` 16))
361+ takeWhile (<= ((value * 15) `div` 16))
362+ takeWhile (<= value)
363+
364+-------------------------------------------------------------------------------
365+-- Benchmarks
366+-------------------------------------------------------------------------------
367+
368+moduleName :: String
369+moduleName = MODULE_NAME
370+
371+instance NFData ParseError where
372+ {-# INLINE rnf #-}
373+ rnf (ParseError x) = rnf x
374+
375+o_1_space_serial :: Int -> [Benchmark]
376+o_1_space_serial value =
377+ [ benchIOSink value "drain" (Stream.fold Fold.drain . StreamK.toStream)
378+ , benchIOSink value "takeWhile" $ takeWhileK value
379+ , benchIOSink value "splitAp2" $ splitAp2 value
380+ , benchIOSink value "splitAp8" $ splitAp8 value
381+ , benchIOSink value "alt2" $ alt2 value
382+ , benchIOSink value "alt8" $ alt8 value
383+ , benchIOSink value "alt16" $ alt16 value
384+ , benchIOSink value "monad2" $ monad2 value
385+ , benchIOSink value "monad4" $ monad4 value
386+ , benchIOSink value "monad8" $ monad8 value
387+ , benchIOSink value "monad16" $ monad16 value
388+ ]
389+
390+{-# INLINE sepBy1 #-}
391+sepBy1 :: MonadIO m => StreamK m PARSE_ELEM -> m Int
392+sepBy1 xs = do
393+ x <- PARSE_OP (parser (satisfy odd) (satisfy even)) xs
394+ return $ Prelude.length x
395+
396+ where
397+
398+ parser p sep = do
399+ x <- p
400+ fmap (x :) $ AP.many (sep >> p)
401+
402+-- O(n) heap beacuse of accumulation of the list in strict IO monad?
403+o_n_heap_serial :: Int -> [Benchmark]
404+o_n_heap_serial value =
405+ [
406+ -- accumulates the results in a list
407+ -- XXX why should this take O(n) heap, it discards the results?
408+ benchIOSink value "sequence_" $ sequence_ value
409+ , benchIOSink value "sequenceA_" $ sequenceA_ value
410+ , benchIOSink value "sequence" $ sequence value
411+ , benchIOSink value "sequenceA" $ sequenceA value
412+ , benchIOSink value "manyAlt" manyAlt
413+ , benchIOSink value "sepBy1" sepBy1
414+ , benchIOSink value "someAlt" someAlt
415+ , benchIOSink value "choice" $ choice value
416+ ]
417+
418+-- O(n) heap beacuse of accumulation of the list in strict IO monad?
419+o_1_space_recursive :: Int -> [Benchmark]
420+o_1_space_recursive value =
421+ [ benchIOSink value "one (recursive)" $ one value
422+ ]
423+
424+-------------------------------------------------------------------------------
425+-- Driver
426+-------------------------------------------------------------------------------
427+
428+main :: IO ()
429+main = runWithCLIOpts defaultStreamSize allBenchmarks
430+
431+ where
432+
433+ allBenchmarks value =
434+ [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
435+ , bgroup (o_1_space_prefix moduleName) (o_1_space_recursive value)
436+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
437+ ]
benchmark/Streamly/Benchmark/Data/Ring/Unboxed.hsnew file+69
@@ -0,0 +1,69 @@
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.hsnew file+591
@@ -0,0 +1,591 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+{- HLINT ignore -}
3+
4+#undef FUSION_CHECK
5+#ifdef FUSION_CHECK
6+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
7+#endif
8+
9+-- |
10+-- Module : Streamly.Benchmark.Data.Serialize
11+-- Copyright : (c) 2023 Composewell
12+-- License : BSD-3-Clause
13+-- Maintainer : streamly@composewell.com
14+
15+module Main (main) where
16+
17+-------------------------------------------------------------------------------
18+-- Imports
19+-------------------------------------------------------------------------------
20+
21+import Control.DeepSeq (NFData(..), deepseq)
22+import Control.Monad (when, void)
23+import GHC.Generics (Generic)
24+import System.Random (randomRIO)
25+#ifndef USE_UNBOX
26+import Test.QuickCheck (Arbitrary, arbitrary)
27+#endif
28+
29+import Streamly.Internal.Data.MutByteArray
30+import qualified Streamly.Internal.Data.MutByteArray as MBA
31+#ifdef USE_UNBOX
32+import Data.Proxy (Proxy(..))
33+#else
34+import Control.DeepSeq (force)
35+import Test.QuickCheck (oneof, generate)
36+#endif
37+
38+import Test.Tasty.Bench
39+import Streamly.Benchmark.Common
40+
41+#ifndef USE_UNBOX
42+import Streamly.Benchmark.Data.Serialize.RecCompatible
43+import Streamly.Benchmark.Data.Serialize.RecNonCompatible
44+#endif
45+
46+#ifdef USE_UNBOX
47+#define SERIALIZE_CLASS Unbox
48+#define DERIVE_CLASS(typ) $(deriveUnbox [d|instance Unbox typ|])
49+#define SERIALIZE_OP pokeAt
50+#define DESERIALIZE_OP peekAt
51+#else
52+#define SERIALIZE_CLASS Serialize
53+#define DERIVE_CLASS(typ) $(deriveSerialize [d|instance Serialize typ|])
54+#define SERIALIZE_OP serializeAt
55+#define DESERIALIZE_OP deserializeAt
56+#endif
57+
58+-------------------------------------------------------------------------------
59+-- Types
60+-------------------------------------------------------------------------------
61+
62+data Unit = Unit
63+ deriving (Generic, Show, Eq)
64+
65+#ifndef USE_TH
66+instance SERIALIZE_CLASS Unit
67+#else
68+DERIVE_CLASS(Unit)
69+#endif
70+
71+instance NFData Unit where
72+ {-# INLINE rnf #-}
73+ rnf _ = ()
74+
75+data Sum2
76+ = Sum21
77+ | Sum22
78+ deriving (Generic, Show, Eq)
79+
80+#ifndef USE_TH
81+instance SERIALIZE_CLASS Sum2
82+#else
83+DERIVE_CLASS(Sum2)
84+#endif
85+
86+instance NFData Sum2 where
87+ {-# INLINE rnf #-}
88+ rnf _ = ()
89+
90+data Sum25
91+ = Sum251
92+ | Sum252
93+ | Sum253
94+ | Sum254
95+ | Sum255
96+ | Sum256
97+ | Sum257
98+ | Sum258
99+ | Sum259
100+ | Sum2510
101+ | Sum2511
102+ | Sum2512
103+ | Sum2513
104+ | Sum2514
105+ | Sum2515
106+ | Sum2516
107+ | Sum2517
108+ | Sum2518
109+ | Sum2519
110+ | Sum2520
111+ | Sum2521
112+ | Sum2522
113+ | Sum2523
114+ | Sum2524
115+ | Sum2525
116+ deriving (Generic, Show, Eq)
117+
118+#ifndef USE_TH
119+instance SERIALIZE_CLASS Sum25
120+#else
121+DERIVE_CLASS(Sum25)
122+#endif
123+
124+instance NFData Sum25 where
125+ {-# INLINE rnf #-}
126+ rnf _ = ()
127+
128+data Product25
129+ = Product25
130+ Int
131+ Int
132+ Int
133+ Int
134+ Int
135+ Int
136+ Int
137+ Int
138+ Int
139+ Int
140+ Int
141+ Int
142+ Int
143+ Int
144+ Int
145+ Int
146+ Int
147+ Int
148+ Int
149+ Int
150+ Int
151+ Int
152+ Int
153+ Int
154+ Int
155+ deriving (Generic, Show)
156+
157+#ifndef USE_TH
158+instance SERIALIZE_CLASS Product25
159+#else
160+DERIVE_CLASS(Product25)
161+#endif
162+
163+instance NFData Product25 where
164+ {-# INLINE rnf #-}
165+ rnf
166+ (Product25 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 a16 a17 a18 a19 a20 a21 a22 a23 a24 a25)
167+ = a1
168+ `seq` a2
169+ `seq` a3
170+ `seq` a4
171+ `seq` a5
172+ `seq` a6
173+ `seq` a7
174+ `seq` a8
175+ `seq` a9
176+ `seq` a10
177+ `seq` a11
178+ `seq` a12
179+ `seq` a13
180+ `seq` a14
181+ `seq` a15
182+ `seq` a16
183+ `seq` a17
184+ `seq` a18
185+ `seq` a19
186+ `seq` a20
187+ `seq` a21
188+ `seq` a22
189+ `seq` a23
190+ `seq` a24
191+ `seq` a25
192+ `seq` ()
193+
194+-- XXX derived Eq instance is not inlined
195+instance Eq Product25 where
196+ {-# INLINE (==) #-}
197+ (==)
198+ (Product25 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 a16 a17 a18 a19 a20 a21 a22 a23 a24 a25)
199+ (Product25 b1 b2 b3 b4 b5 b6 b7 b8 b9 b10 b11 b12 b13 b14 b15 b16 b17 b18 b19 b20 b21 b22 b23 b24 b25)
200+ = a1 == b1
201+ && a2 == b2
202+ && a3 == b3
203+ && a4 == b4
204+ && a5 == b5
205+ && a6 == b6
206+ && a7 == b7
207+ && a8 == b8
208+ && a9 == b9
209+ && a10 == b10
210+ && a11 == b11
211+ && a12 == b12
212+ && a13 == b13
213+ && a14 == b14
214+ && a15 == b15
215+ && a16 == b16
216+ && a17 == b17
217+ && a18 == b18
218+ && a19 == b19
219+ && a20 == b20
220+ && a21 == b21
221+ && a22 == b22
222+ && a23 == b23
223+ && a24 == b24
224+ && a25 == b25
225+
226+-------------------------------------------------------------------------------
227+-- Simple non-recursive ADT
228+-------------------------------------------------------------------------------
229+
230+{-
231+data CustomDT1
232+ = CDT1C1
233+ | CDT1C2 Int
234+ | CDT1C3 Int Int
235+ deriving (Generic, Show, Eq)
236+
237+#ifndef USE_TH
238+instance SERIALIZE_CLASS CustomDT1
239+#else
240+DERIVE_CLASS(CustomDT1)
241+#endif
242+
243+instance NFData CustomDT1 where
244+ {-# INLINE rnf #-}
245+ rnf CDT1C1 = ()
246+ rnf (CDT1C2 i) = i `seq` ()
247+ rnf (CDT1C3 i1 i2) = i1 `seq` i2 `seq` ()
248+-}
249+
250+-------------------------------------------------------------------------------
251+-- Recursive ADT
252+-------------------------------------------------------------------------------
253+
254+#ifndef USE_UNBOX
255+data BinTree a
256+ = Tree (BinTree a) (BinTree a)
257+ | Leaf a
258+ deriving (Show, Read, Eq, Generic)
259+
260+#ifndef USE_TH
261+instance Serialize (BinTree a)
262+#else
263+$(deriveSerialize [d|instance Serialize a => Serialize (BinTree a)|])
264+#endif
265+
266+instance NFData a => NFData (BinTree a) where
267+ {-# INLINE rnf #-}
268+ rnf (Leaf a) = rnf a `seq` ()
269+ rnf (Tree l r) = rnf l `seq` rnf r
270+
271+-- XXX This may not terminate, or could become really large.
272+instance Arbitrary a => Arbitrary (BinTree a) where
273+ arbitrary = oneof [Leaf <$> arbitrary, Tree <$> arbitrary <*> arbitrary]
274+
275+mkBinTree :: (Arbitrary a) => Int -> IO (BinTree a)
276+mkBinTree = go (generate arbitrary)
277+
278+ where
279+
280+ go r 0 = Leaf <$> r
281+ go r n = Tree <$> go r (n - 1) <*> go r (n - 1)
282+
283+#endif
284+
285+-------------------------------------------------------------------------------
286+-- Size helpers
287+-------------------------------------------------------------------------------
288+
289+{-# INLINE getSize #-}
290+getSize :: forall a. SERIALIZE_CLASS a => a -> Int
291+#ifdef USE_UNBOX
292+getSize _ = sizeOf (Proxy :: Proxy a)
293+#else
294+getSize = addSizeTo 0
295+#endif
296+
297+-------------------------------------------------------------------------------
298+-- Common helpers
299+-------------------------------------------------------------------------------
300+
301+{- HLINT ignore "Eta reduce" -}
302+-- Parts of "f" that are dependent on val will not be optimized out.
303+{-# INLINE loop #-}
304+loop :: Int -> (a -> IO b) -> a -> IO ()
305+loop count f val = go count val
306+ where
307+
308+ go n x = when (n > 0) $ f x >> go (n-1) x
309+
310+-- The first arg of "f" is the environment which is not threaded around in the
311+-- loop.
312+{-# INLINE loopWith #-}
313+loopWith :: Int -> (e -> a -> IO b) -> e -> a -> IO ()
314+loopWith count f e val = go count val
315+ where
316+
317+ go n x = when (n > 0) $ f e x >> go (n-1) x
318+
319+benchSink :: NFData b => String -> Int -> (Int -> IO b) -> Benchmark
320+benchSink name times f = bench name (nfIO (randomRIO (times, times) >>= f))
321+
322+-------------------------------------------------------------------------------
323+-- Serialization Helpers
324+-------------------------------------------------------------------------------
325+
326+{-
327+{-# INLINE pokeWithSize #-}
328+pokeWithSize :: SERIALIZE_CLASS a => MutByteArray -> a -> IO ()
329+pokeWithSize arr val = do
330+ let n = getSize val
331+ n `seq` SERIALIZE_OP 0 arr val >> return ()
332+
333+{-# INLINE pokeTimesWithSize #-}
334+pokeTimesWithSize :: SERIALIZE_CLASS a => a -> Int -> IO ()
335+pokeTimesWithSize val times = do
336+ let n = getSize val
337+ arr <- MBA.new n
338+ loopWith times pokeWithSize arr val
339+-}
340+
341+{-# INLINE poke #-}
342+poke :: SERIALIZE_CLASS a => MutByteArray -> a -> IO ()
343+poke arr val = void (SERIALIZE_OP 0 arr val)
344+
345+{-# INLINE pokeTimes #-}
346+pokeTimes :: SERIALIZE_CLASS a => a -> Int -> IO ()
347+pokeTimes val times = do
348+ let n = getSize val
349+ arr <- MBA.new n
350+ loopWith times poke arr val
351+
352+{-# INLINE encode #-}
353+encode :: SERIALIZE_CLASS a => a -> IO ()
354+encode val = do
355+ let n = getSize val
356+ arr <- MBA.new n
357+ void (SERIALIZE_OP 0 arr val)
358+
359+{-# INLINE encodeTimes #-}
360+encodeTimes :: SERIALIZE_CLASS a => a -> Int -> IO ()
361+encodeTimes val times = loop times encode val
362+
363+{-# INLINE peek #-}
364+peek :: forall a. (NFData a, SERIALIZE_CLASS a) =>
365+ (a, Int) -> MutByteArray -> IO ()
366+#ifdef USE_UNBOX
367+peek (_val, _) arr = do
368+ (val1 :: a) <- DESERIALIZE_OP 0 arr
369+#else
370+peek (_val, n) arr = do
371+ (_, val1 :: a) <- DESERIALIZE_OP 0 arr n
372+#endif
373+ -- If the datatype is not deeply strict or deepseq is not used then use
374+ -- Equality.
375+ -- Ensure that we are actually constructing the type and using it. This
376+ -- is important, otherwise the structure is created and discarded, the
377+ -- cost of creation of the structure is not accounted. Otherwise we may
378+ -- just read the values and discard them. The comparison adds to the
379+ -- cost though. We could use deepseq but then we need to write
380+ -- instances of NFData and ensure that they are correct and perform
381+ -- well. Equality check also ensures correctness.
382+ {-
383+ if (val1 /= val)
384+ then error "peek: no match"
385+ else return ()
386+ -}
387+ val1 `deepseq` return ()
388+
389+{-# INLINE peekTimes #-}
390+peekTimes :: (NFData a, SERIALIZE_CLASS a) => Int -> a -> Int -> IO ()
391+peekTimes n val times = do
392+ arr <- MBA.new n
393+ _ <- SERIALIZE_OP 0 arr val
394+ loopWith times peek (val, n) arr
395+
396+{-# INLINE trip #-}
397+trip :: forall a. (NFData a, SERIALIZE_CLASS a) => a -> IO ()
398+trip val = do
399+ let n = getSize val
400+ arr <- MBA.new n
401+ _ <- SERIALIZE_OP 0 arr val
402+#ifdef USE_UNBOX
403+ (val1 :: a) <- DESERIALIZE_OP 0 arr
404+#else
405+ (_, val1 :: a) <- DESERIALIZE_OP 0 arr n
406+#endif
407+ -- Do not remove this or use deepseq, see the comments in peek.
408+ {-
409+ if (val1 /= val)
410+ then error "roundtrip: no match"
411+ else return ()
412+ -}
413+ -- Note: deepseq is not needed if the datatype is strict
414+ val1 `deepseq` return ()
415+
416+{-# INLINE roundtrip #-}
417+roundtrip :: (NFData a, SERIALIZE_CLASS a) => a -> Int -> IO ()
418+roundtrip val times = loop times trip val
419+
420+-------------------------------------------------------------------------------
421+-- Benchmarks
422+-------------------------------------------------------------------------------
423+
424+{-# INLINE benchConst #-}
425+benchConst ::
426+ String
427+ -> (forall a. (NFData a, SERIALIZE_CLASS a) =>
428+ Int -> a -> Int -> IO ())
429+ -> Int
430+ -> Benchmark
431+benchConst gname f times =
432+ bgroup gname
433+ [ let !n = getSize Unit
434+ in benchSink "Unit" times (f n Unit)
435+ {-
436+ , let !n = getSize CDT1C1
437+ in benchSink "C1" times (f n CDT1C1)
438+ , let val = CDT1C2 5
439+ !n = getSize val
440+ in benchSink "C2" (times `div` 2) (f n val)
441+ , let val = CDT1C3 5 2
442+ !n = getSize val
443+ in benchSink "C3" (times `div` 3) (f n val)
444+ -}
445+ , let !n = getSize Sum21
446+ in benchSink "Sum2" times (f n Sum21)
447+ , let !n = getSize Sum2525
448+ in benchSink "Sum25" times (f n Sum2525)
449+ , let val = Product25 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
450+ !n = getSize val
451+ in benchSink "Product25" (times `div` 26) (f n val)
452+ ]
453+
454+#ifndef USE_UNBOX
455+{-# INLINE benchVar #-}
456+benchVar ::
457+ String
458+ -> (forall a. (NFData a, SERIALIZE_CLASS a) =>
459+ Int -> a -> Int -> IO ())
460+ -> BinTree Int
461+ -> [Int]
462+ -> Int
463+ -> Benchmark
464+benchVar gname f tInt lInt times =
465+ bgroup gname
466+ [ let !n = getSize tInt
467+ in benchSink "bintree-int" times (f n tInt)
468+ , let !n = getSize lInt
469+ in benchSink "list-int" times (f n lInt)
470+ ]
471+
472+{-
473+{-# INLINE benchGeneric #-}
474+benchGeneric
475+ :: (NFData b, Serialize b)
476+ => String
477+ -> String
478+ -> (forall a. (NFData a, Serialize a) =>
479+ Int -> a -> Int -> IO ())
480+ -> b
481+ -> Int
482+ -> Benchmark
483+benchGeneric gname valId f val times =
484+ bgroup gname
485+ [ let !n = getSize val
486+ in benchSink valId times (f n val)
487+ ]
488+-}
489+
490+{-# INLINE benchLargeRec #-}
491+benchLargeRec ::
492+ String
493+ -> (forall a. (NFData a, Serialize a) =>
494+ Int -> a -> Int -> IO ())
495+ -> RecNonCompatible
496+ -> RecCompatible
497+ -> Int
498+ -> Benchmark
499+benchLargeRec gname f recL recR times =
500+ bgroup gname
501+ [ let !n = getSize recL
502+ in benchSink "RecNonCompatible" times (f n recL)
503+ , let !n = getSize recR
504+ in benchSink "RecCompatible" times (f n recR)
505+ ]
506+#endif
507+
508+-- Times is scaled by the number of constructors to normalize
509+#ifdef USE_UNBOX
510+allBenchmarks :: Int -> [Benchmark]
511+allBenchmarks times =
512+#else
513+allBenchmarks ::
514+ BinTree Int -> [Int] -> RecNonCompatible -> RecCompatible -> Int -> [Benchmark]
515+allBenchmarks tInt lInt recL recR times =
516+#endif
517+ [ bgroup "sizeOf"
518+ [
519+#ifndef USE_UNBOX
520+ bench "bintree-int" $ nf getSize tInt
521+ , bench "list-int" $ nf getSize lInt
522+#endif
523+ ]
524+ , benchConst "poke" (const pokeTimes) times
525+ -- , benchConst "pokeWithSize" (const pokeTimesWithSize) times
526+ , benchConst "encode" (const encodeTimes) times
527+ , benchConst "peek" peekTimes times
528+ , benchConst "roundtrip" (const roundtrip) times
529+#ifndef USE_UNBOX
530+ , benchVar "poke" (const pokeTimes) tInt lInt 1
531+ -- , benchVar "pokeWithSize" (const pokeTimesWithSize) tInt lInt 1
532+ , benchVar "encode" (const encodeTimes) tInt lInt 1
533+ , benchVar "peek" peekTimes tInt lInt 1
534+ , benchVar "roundtrip" (const roundtrip) tInt lInt 1
535+ , benchLargeRec "poke" (const pokeTimes) recL recR times
536+ , benchLargeRec "encode" (const encodeTimes) recL recR times
537+ , benchLargeRec "peek" peekTimes recL recR times
538+ , benchLargeRec "roundtrip" (const roundtrip) recL recR times
539+#endif
540+ ]
541+
542+-------------------------------------------------------------------------------
543+-- Driver
544+-------------------------------------------------------------------------------
545+
546+main :: IO ()
547+main = do
548+#ifndef USE_UNBOX
549+ -- Approximately 100000 constructors
550+ -- Assuming Leaf nodes constitute two constructors (Leaf, Int) and internal
551+ -- nodes 1 level = log_2 (100001/3) + 1 = 16
552+ !(tInt :: BinTree Int) <- force <$> mkBinTree 16
553+
554+ let !recL = valRecNonCompatible
555+ let !recR = valRecCompatible
556+
557+ -- Approximately 100000 constructors, assuming two constructors (Cons, Int)
558+ -- per element.
559+ let lInt = [1..50000 :: Int]
560+ let !len = length lInt -- evaluate the list
561+#endif
562+#ifndef FUSION_CHECK
563+#ifdef USE_UNBOX
564+ runWithCLIOpts defaultStreamSize allBenchmarks
565+#else
566+ len
567+ `seq` runWithCLIOpts
568+ defaultStreamSize
569+ (allBenchmarks tInt lInt recL recR)
570+#endif
571+#else
572+ -- Enable FUSION_CHECK macro at the beginning of the file
573+ -- Enable one benchmark below, and run the benchmark
574+ -- Check the .dump-simpl output
575+ let value = 100000
576+ -- print $ getSize (CDT1C3 4 2)
577+ -- print $ getSize tInt
578+ -- print $ getSize lInt
579+
580+ -- pokeTimes tInt 1
581+
582+ -- peekTimes ((CDT1C2 (5 :: Int)) :: CustomDT1) value
583+ -- peekTimes (Sum2525) value
584+ -- peekTimes (Product25 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25) value
585+ -- peekTimes tInt 1
586+ let !n = getSize lInt
587+ peekTimes n lInt 1
588+
589+ -- roundtrip ((CDT1C2 (5 :: Int)) :: CustomDT1) value
590+ return ()
591+#endif
benchmark/Streamly/Benchmark/Data/Serialize/RecCompatible.hsnew file+24
@@ -0,0 +1,24 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+
3+module Streamly.Benchmark.Data.Serialize.RecCompatible
4+ ( RecCompatible(..)
5+ , valRecCompatible
6+ ) where
7+
8+--------------------------------------------------------------------------------
9+-- Imports
10+--------------------------------------------------------------------------------
11+
12+import Streamly.Internal.Data.MutByteArray (Serialize)
13+import Streamly.Benchmark.Data.Serialize.TH (genLargeRecord)
14+
15+import qualified Streamly.Internal.Data.MutByteArray as Serialize
16+
17+--------------------------------------------------------------------------------
18+-- Code
19+--------------------------------------------------------------------------------
20+
21+$(genLargeRecord "RecCompatible" 50)
22+$(Serialize.deriveSerializeWith
23+ (Serialize.encodeRecordFields True)
24+ [d|instance Serialize RecCompatible|])
benchmark/Streamly/Benchmark/Data/Serialize/RecNonCompatible.hsnew file+21
@@ -0,0 +1,21 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+
3+module Streamly.Benchmark.Data.Serialize.RecNonCompatible
4+ ( RecNonCompatible(..)
5+ , valRecNonCompatible
6+ ) where
7+
8+--------------------------------------------------------------------------------
9+-- Imports
10+--------------------------------------------------------------------------------
11+
12+import Streamly.Benchmark.Data.Serialize.TH (genLargeRecord)
13+
14+import qualified Streamly.Internal.Data.MutByteArray as Serialize
15+
16+--------------------------------------------------------------------------------
17+-- Code
18+--------------------------------------------------------------------------------
19+
20+$(genLargeRecord "RecNonCompatible" 50)
21+$(Serialize.deriveSerialize [d|instance Serialize.Serialize RecNonCompatible|])
benchmark/Streamly/Benchmark/Data/Serialize/TH.hsnew file+76
@@ -0,0 +1,76 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+
3+module Streamly.Benchmark.Data.Serialize.TH (genLargeRecord) where
4+
5+--------------------------------------------------------------------------------
6+-- Imports
7+--------------------------------------------------------------------------------
8+
9+import Language.Haskell.TH
10+
11+import Streamly.Internal.Data.MutByteArray (makeI)
12+import Control.DeepSeq (NFData(..))
13+
14+--------------------------------------------------------------------------------
15+-- Large Record
16+--------------------------------------------------------------------------------
17+
18+genLargeRecord :: String -> Int -> Q [Dec]
19+genLargeRecord tyName numFields =
20+ sequence
21+ [ dataD
22+ (pure [])
23+ (mkName tyName)
24+ []
25+ Nothing
26+ [mkCon tyName]
27+ [derivClause Nothing [conT ''Eq, conT ''Show]]
28+ , mkValueSigDec
29+ , mkValueDec
30+ , nfDataInstance tyName
31+ ]
32+
33+ where
34+
35+ fieldTypeChoices = [conT ''()]
36+ chooseCycle i xs = xs !! (i `mod` length xs)
37+ nfDataInstance nm =
38+ instanceD
39+ (pure [])
40+ (appT (conT ''NFData) (conT (mkName nm)))
41+ [ funD
42+ 'rnf
43+ [ clause
44+ [ conP
45+ (mkName nm)
46+ (varP . makeI <$> [0 .. (numFields - 1)])
47+ ]
48+ (normalB
49+ (foldl
50+ (\b a -> [|rnf $(b) `seq` rnf $(a)|])
51+ [|()|]
52+ (varE . makeI <$> [0 .. (numFields - 1)])))
53+ []
54+ ]
55+ ]
56+ valueName = mkName $ "val" ++ tyName
57+ mkValueSigDec = sigD valueName [t|$(conT (mkName tyName))|]
58+ mkValueDec =
59+ funD
60+ valueName
61+ [ clause
62+ []
63+ (normalB
64+ (foldl
65+ (\b a -> [|$(b) $(a)|])
66+ (conE (mkName tyName))
67+ (conE '() <$ [0 .. (numFields - 1)])))
68+ []
69+ ]
70+ mkCon nm = recC (mkName nm) (mkField <$> [0 .. (numFields - 1)])
71+ mkField i =
72+ varBangType
73+ (mkName ("field" ++ show i))
74+ (bangType
75+ (bang noSourceUnpackedness noSourceStrictness)
76+ (chooseCycle i fieldTypeChoices))
benchmark/Streamly/Benchmark/Data/Stream.hsnew file+114
@@ -0,0 +1,114 @@
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.hsnew file+518
@@ -0,0 +1,518 @@
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.hsnew file+20
@@ -0,0 +1,20 @@
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.hsnew file+208
@@ -0,0 +1,208 @@
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.hsnew file+25
@@ -0,0 +1,25 @@
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.hsnew file+25
@@ -0,0 +1,25 @@
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.hsnew file+25
@@ -0,0 +1,25 @@
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/Prelude/Serial/Elimination.hs → benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hsrenamed+183−121
@@ -1,14 +1,20 @@
11-- |
2−-- Module : Serial.Elimination
2+-- Module : Stream.Eliminate
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 #-}
910{-# LANGUAGE ScopedTypeVariables #-}
1011{-# LANGUAGE RankNTypes #-}
1112
13+{-# OPTIONS_GHC -Wno-orphans #-}
14+#ifdef USE_PRELUDE
15+{-# OPTIONS_GHC -Wno-deprecations #-}
16+#endif
17+
1218#ifdef __HADDOCK_VERSION__
1319#undef INSPECTION
1420#endif
@@ -18,7 +24,7 @@
1824{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
1925#endif
2026
21−module Serial.Elimination (benchmarks) where
27+module Stream.Eliminate (benchmarks) where
2228
2329import Control.DeepSeq (NFData(..))
2430import Data.Functor.Identity (Identity, runIdentity)
@@ -26,28 +32,45 @@ import System.Random (randomRIO)
2632
2733import qualified Data.Foldable as F
2834import qualified GHC.Exts as GHC
35+import qualified Streamly.Internal.Data.Fold as Fold
2936
3037#ifdef INSPECTION
3138import GHC.Types (SPEC(..))
3239import Test.Inspection
33−
34−import qualified Streamly.Internal.Data.Stream.StreamD as D
40+import qualified Streamly.Internal.Data.Stream as D
3541#endif
3642
37−import qualified Streamly.Prelude as S
38−import qualified Streamly.Internal.Data.Stream.IsStream as Internal
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
58+#endif
3959
40−import Gauge
41−import Streamly.Prelude (SerialT, IsStream, fromSerial)
60+import Test.Tasty.Bench
4261import Streamly.Benchmark.Common
43−import Streamly.Benchmark.Prelude
4462import Prelude hiding (length, sum, or, and, any, all, notElem, elem, (!!),
4563 lookup, repeat, minimum, maximum, product, last, mapM_, init)
4664import qualified Prelude
4765
66+#ifdef USE_PRELUDE
67+type Stream = S.SerialT
68+fromStream = id
69+
4870{-# INLINE repeat #-}
4971repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
5072repeat count = S.take count . S.repeat
73+#endif
5174
5275-------------------------------------------------------------------------------
5376-- Elimination
@@ -60,90 +83,92 @@ repeat count = S.take count . S.repeat
6083{-# INLINE foldableFoldl' #-}
6184foldableFoldl' :: Int -> Int -> Int
6285foldableFoldl' value n =
63− F.foldl' (+) 0 (sourceUnfoldr value n :: S.SerialT Identity Int)
86+ F.foldl' (+) 0 (sourceUnfoldr value n :: Stream Identity Int)
6487
6588{-# INLINE foldableFoldrElem #-}
6689foldableFoldrElem :: Int -> Int -> Bool
6790foldableFoldrElem value n =
6891 F.foldr (\x xs -> x == value || xs)
6992 False
70− (sourceUnfoldr value n :: S.SerialT Identity Int)
93+ (sourceUnfoldr value n :: Stream Identity Int)
7194
7295{-# INLINE foldableSum #-}
7396foldableSum :: Int -> Int -> Int
7497foldableSum value n =
75− Prelude.sum (sourceUnfoldr value n :: S.SerialT Identity Int)
98+ Prelude.sum (sourceUnfoldr value n :: Stream Identity Int)
7699
77100{-# INLINE foldableProduct #-}
78101foldableProduct :: Int -> Int -> Int
79102foldableProduct value n =
80− Prelude.product (sourceUnfoldr value n :: S.SerialT Identity Int)
103+ Prelude.product (sourceUnfoldr value n :: Stream Identity Int)
81104
82105{-# INLINE _foldableNull #-}
83106_foldableNull :: Int -> Int -> Bool
84107_foldableNull value n =
85− Prelude.null (sourceUnfoldr value n :: S.SerialT Identity Int)
108+ Prelude.null (sourceUnfoldr value n :: Stream Identity Int)
86109
87110{-# INLINE foldableElem #-}
88111foldableElem :: Int -> Int -> Bool
89112foldableElem value n =
90− value `Prelude.elem` (sourceUnfoldr value n :: S.SerialT Identity Int)
113+ value `Prelude.elem` (sourceUnfoldr value n :: Stream Identity Int)
91114
92115{-# INLINE foldableNotElem #-}
93116foldableNotElem :: Int -> Int -> Bool
94117foldableNotElem value n =
95− value `Prelude.notElem` (sourceUnfoldr value n :: S.SerialT Identity Int)
118+ value `Prelude.notElem` (sourceUnfoldr value n :: Stream Identity Int)
96119
97120{-# INLINE foldableFind #-}
98121foldableFind :: Int -> Int -> Maybe Int
99122foldableFind value n =
100− F.find (== (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
123+ F.find (== (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
101124
102125{-# INLINE foldableAll #-}
103126foldableAll :: Int -> Int -> Bool
104127foldableAll value n =
105− Prelude.all (<= (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
128+ Prelude.all (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
106129
107130{-# INLINE foldableAny #-}
108131foldableAny :: Int -> Int -> Bool
109132foldableAny value n =
110− Prelude.any (> (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
133+ Prelude.any (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
111134
135+{- HLINT ignore "Use all"-}
112136{-# INLINE foldableAnd #-}
113137foldableAnd :: Int -> Int -> Bool
114138foldableAnd value n =
115− Prelude.and $ S.map
116− (<= (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
139+ Prelude.and $ fmap
140+ (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
117141
142+{- HLINT ignore "Use any"-}
118143{-# INLINE foldableOr #-}
119144foldableOr :: Int -> Int -> Bool
120145foldableOr value n =
121− Prelude.or $ S.map
122− (> (value + 1)) (sourceUnfoldr value n :: S.SerialT Identity Int)
146+ Prelude.or $ fmap
147+ (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
123148
124149{-# INLINE foldableLength #-}
125150foldableLength :: Int -> Int -> Int
126151foldableLength value n =
127− Prelude.length (sourceUnfoldr value n :: S.SerialT Identity Int)
152+ Prelude.length (sourceUnfoldr value n :: Stream Identity Int)
128153
129154{-# INLINE foldableMin #-}
130155foldableMin :: Int -> Int -> Int
131156foldableMin value n =
132− Prelude.minimum (sourceUnfoldr value n :: S.SerialT Identity Int)
157+ Prelude.minimum (sourceUnfoldr value n :: Stream Identity Int)
133158
134159{-# INLINE ordInstanceMin #-}
135−ordInstanceMin :: SerialT Identity Int -> SerialT Identity Int
160+ordInstanceMin :: Stream Identity Int -> Stream Identity Int
136161ordInstanceMin src = min src src
137162
138163{-# INLINE foldableMax #-}
139164foldableMax :: Int -> Int -> Int
140165foldableMax value n =
141− Prelude.maximum (sourceUnfoldr value n :: S.SerialT Identity Int)
166+ Prelude.maximum (sourceUnfoldr value n :: Stream Identity Int)
142167
143168{-# INLINE foldableMinBy #-}
144169foldableMinBy :: Int -> Int -> Int
145170foldableMinBy value n =
146− F.minimumBy compare (sourceUnfoldr value n :: S.SerialT Identity Int)
171+ F.minimumBy compare (sourceUnfoldr value n :: Stream Identity Int)
147172
148173{-# INLINE foldableListMinBy #-}
149174foldableListMinBy :: Int -> Int -> Int
@@ -152,30 +177,30 @@ foldableListMinBy value n = F.minimumBy compare [1..value+n]
152177{-# INLINE foldableMaxBy #-}
153178foldableMaxBy :: Int -> Int -> Int
154179foldableMaxBy value n =
155− F.maximumBy compare (sourceUnfoldr value n :: S.SerialT Identity Int)
180+ F.maximumBy compare (sourceUnfoldr value n :: Stream Identity Int)
156181
157182{-# INLINE foldableToList #-}
158183foldableToList :: Int -> Int -> [Int]
159184foldableToList value n =
160− F.toList (sourceUnfoldr value n :: S.SerialT Identity Int)
185+ F.toList (sourceUnfoldr value n :: Stream Identity Int)
161186
162187{-# INLINE foldableMapM_ #-}
163188foldableMapM_ :: Monad m => Int -> Int -> m ()
164189foldableMapM_ value n =
165− F.mapM_ (\_ -> return ()) (sourceUnfoldr value n :: S.SerialT Identity Int)
190+ F.mapM_ (\_ -> return ()) (sourceUnfoldr value n :: Stream Identity Int)
166191
167192{-# INLINE foldableSequence_ #-}
168193foldableSequence_ :: Int -> Int -> IO ()
169194foldableSequence_ value n =
170− F.sequence_ (sourceUnfoldrAction value n :: S.SerialT Identity (IO Int))
195+ F.sequence_ (sourceUnfoldrAction value n :: Stream Identity (IO Int))
171196
172197{-# INLINE _foldableMsum #-}
173198_foldableMsum :: Int -> Int -> IO Int
174199_foldableMsum value n =
175− F.msum (sourceUnfoldrAction value n :: S.SerialT Identity (IO Int))
200+ F.msum (sourceUnfoldrAction value n :: Stream Identity (IO Int))
176201
177202{-# INLINE showInstance #-}
178−showInstance :: SerialT Identity Int -> String
203+showInstance :: Stream Identity Int -> String
179204showInstance = show
180205
181206o_1_space_elimination_foldable :: Int -> [Benchmark]
@@ -192,6 +217,9 @@ o_1_space_elimination_foldable value =
192217 , bench "minimum" $ nf (foldableMin value) 1
193218 , benchPureSink value "min (ord)" ordInstanceMin
194219 , 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
195223 , bench "length . toList"
196224 $ nf (Prelude.length . foldableToList value) 1
197225 , bench "notElem" $ nf (foldableNotElem value) 1
@@ -214,34 +242,25 @@ o_1_space_elimination_foldable value =
214242 ]
215243 ]
216244
217−o_n_space_elimination_foldable :: Int -> [Benchmark]
218−o_n_space_elimination_foldable value =
219− -- Head recursive strict right folds.
220− [ bgroup "foldl"
221− -- XXX the definitions of minimumBy and maximumBy in Data.Foldable use
222− -- foldl1 which does not work in constant memory for our
223− -- implementation. It works in constant memory for lists but even for
224− -- lists it takes 15x more time compared to our foldl' based
225− -- implementation.
226− [ bench "minimumBy" $ nf (`foldableMinBy` 1) value
227− , bench "maximumBy" $ nf (`foldableMaxBy` 1) value
228− , bench "minimumByList" $ nf (`foldableListMinBy` 1) value
229− ]
230− ]
231−
232245-------------------------------------------------------------------------------
233246-- Stream folds
234247-------------------------------------------------------------------------------
235248
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+
236255{-# INLINE benchPureSink #-}
237256benchPureSink :: NFData b
238− => Int -> String -> (SerialT Identity Int -> b) -> Benchmark
257+ => Int -> String -> (Stream Identity Int -> b) -> Benchmark
239258benchPureSink value name = benchPure name (sourceUnfoldr value)
240259
241260{-# INLINE benchHoistSink #-}
242261benchHoistSink
243− :: (IsStream t, NFData b)
244− => Int -> String -> (t Identity Int -> IO b) -> Benchmark
262+ :: (NFData b)
263+ => Int -> String -> (Stream Identity Int -> IO b) -> Benchmark
245264benchHoistSink value name f =
246265 bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldr value
247266
@@ -249,8 +268,8 @@ benchHoistSink value name f =
249268-- we can't use it as it requires MonadAsync constraint.
250269{-# INLINE benchIdentitySink #-}
251270benchIdentitySink
252− :: (IsStream t, NFData b)
253− => Int -> String -> (t Identity Int -> Identity b) -> Benchmark
271+ :: (NFData b)
272+ => Int -> String -> (Stream Identity Int -> Identity b) -> Benchmark
254273benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
255274
256275-------------------------------------------------------------------------------
@@ -258,23 +277,29 @@ benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
258277-------------------------------------------------------------------------------
259278
260279{-# INLINE uncons #-}
261−uncons :: Monad m => SerialT m Int -> m ()
280+#ifdef USE_STREAMK
281+uncons :: Monad m => StreamK m Int -> m ()
282+#else
283+uncons :: Monad m => Stream m Int -> m ()
284+#endif
262285uncons s = do
263− r <- S.uncons s
286+ r <- StreamK.uncons s
264287 case r of
265288 Nothing -> return ()
266289 Just (_, t) -> uncons t
267290
291+#ifdef USE_PRELUDE
268292{-# INLINE init #-}
269−init :: Monad m => SerialT m a -> m ()
293+init :: Monad m => Stream m a -> m ()
270294init s = S.init s >>= Prelude.mapM_ S.drain
271295
272296{-# INLINE mapM_ #-}
273−mapM_ :: Monad m => SerialT m Int -> m ()
297+mapM_ :: Monad m => Stream m Int -> m ()
274298mapM_ = S.mapM_ (\_ -> return ())
299+#endif
275300
276301{-# INLINE foldrMElem #-}
277−foldrMElem :: Monad m => Int -> SerialT m Int -> m Bool
302+foldrMElem :: Monad m => Int -> Stream m Int -> m Bool
278303foldrMElem e =
279304 S.foldrM
280305 (\x xs ->
@@ -283,155 +308,187 @@ foldrMElem e =
283308 else xs)
284309 (return False)
285310
311+#ifdef USE_STREAMK
286312{-# INLINE foldrToStream #-}
287−foldrToStream :: Monad m => SerialT m Int -> m (SerialT Identity Int)
288−foldrToStream = S.foldr S.cons S.nil
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
289320
290321{-# INLINE foldrMBuild #-}
291−foldrMBuild :: Monad m => SerialT m Int -> m [Int]
322+foldrMBuild :: Monad m => Stream m Int -> m [Int]
292323foldrMBuild = S.foldrM (\x xs -> (x :) <$> xs) (return [])
293324
325+#ifdef USE_PRELUDE
294326{-# INLINE foldl'Reduce #-}
295−foldl'Reduce :: Monad m => SerialT m Int -> m Int
327+foldl'Reduce :: Monad m => Stream m Int -> m Int
296328foldl'Reduce = S.foldl' (+) 0
297329
298330{-# INLINE foldl1'Reduce #-}
299−foldl1'Reduce :: Monad m => SerialT m Int -> m (Maybe Int)
331+foldl1'Reduce :: Monad m => Stream m Int -> m (Maybe Int)
300332foldl1'Reduce = S.foldl1' (+)
301333
302334{-# INLINE foldlM'Reduce #-}
303−foldlM'Reduce :: Monad m => SerialT m Int -> m Int
335+foldlM'Reduce :: Monad m => Stream m Int -> m Int
304336foldlM'Reduce = S.foldlM' (\xs a -> return $ a + xs) (return 0)
305337
306338{-# INLINE last #-}
307−last :: Monad m => SerialT m Int -> m (Maybe Int)
339+last :: Monad m => Stream m Int -> m (Maybe Int)
308340last = S.last
309341
310342{-# INLINE _head #-}
311−_head :: Monad m => SerialT m Int -> m (Maybe Int)
343+_head :: Monad m => Stream m Int -> m (Maybe Int)
312344_head = S.head
313345
314346{-# INLINE elem #-}
315−elem :: Monad m => Int -> SerialT m Int -> m Bool
347+elem :: Monad m => Int -> Stream m Int -> m Bool
316348elem value = S.elem (value + 1)
317349
318350{-# INLINE notElem #-}
319−notElem :: Monad m => Int -> SerialT m Int -> m Bool
351+notElem :: Monad m => Int -> Stream m Int -> m Bool
320352notElem value = S.notElem (value + 1)
321353
322354{-# INLINE length #-}
323−length :: Monad m => SerialT m Int -> m Int
355+length :: Monad m => Stream m Int -> m Int
324356length = S.length
325357
326358{-# INLINE all #-}
327−all :: Monad m => Int -> SerialT m Int -> m Bool
359+all :: Monad m => Int -> Stream m Int -> m Bool
328360all value = S.all (<= (value + 1))
329361
330362{-# INLINE any #-}
331−any :: Monad m => Int -> SerialT m Int -> m Bool
363+any :: Monad m => Int -> Stream m Int -> m Bool
332364any value = S.any (> (value + 1))
333365
334366{-# INLINE and #-}
335−and :: Monad m => Int -> SerialT m Int -> m Bool
367+and :: Monad m => Int -> Stream m Int -> m Bool
336368and value = S.and . S.map (<= (value + 1))
337369
338370{-# INLINE or #-}
339−or :: Monad m => Int -> SerialT m Int -> m Bool
371+or :: Monad m => Int -> Stream m Int -> m Bool
340372or value = S.or . S.map (> (value + 1))
341373
342374{-# INLINE find #-}
343−find :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
375+find :: Monad m => Int -> Stream m Int -> m (Maybe Int)
344376find value = S.find (== (value + 1))
345377
346378{-# INLINE findM #-}
347−findM :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
379+findM :: Monad m => Int -> Stream m Int -> m (Maybe Int)
348380findM value = S.findM (\z -> return $ z == (value + 1))
349381
350382{-# INLINE findIndex #-}
351−findIndex :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
383+findIndex :: Monad m => Int -> Stream m Int -> m (Maybe Int)
352384findIndex value = S.findIndex (== (value + 1))
353385
354386{-# INLINE elemIndex #-}
355−elemIndex :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
387+elemIndex :: Monad m => Int -> Stream m Int -> m (Maybe Int)
356388elemIndex value = S.elemIndex (value + 1)
357389
358390{-# INLINE maximum #-}
359−maximum :: Monad m => SerialT m Int -> m (Maybe Int)
391+maximum :: Monad m => Stream m Int -> m (Maybe Int)
360392maximum = S.maximum
361393
362394{-# INLINE minimum #-}
363−minimum :: Monad m => SerialT m Int -> m (Maybe Int)
395+minimum :: Monad m => Stream m Int -> m (Maybe Int)
364396minimum = S.minimum
365397
366398{-# INLINE sum #-}
367−sum :: Monad m => SerialT m Int -> m Int
399+sum :: Monad m => Stream m Int -> m Int
368400sum = S.sum
369401
370402{-# INLINE product #-}
371−product :: Monad m => SerialT m Int -> m Int
403+product :: Monad m => Stream m Int -> m Int
372404product = S.product
373405
374406{-# INLINE minimumBy #-}
375−minimumBy :: Monad m => SerialT m Int -> m (Maybe Int)
407+minimumBy :: Monad m => Stream m Int -> m (Maybe Int)
376408minimumBy = S.minimumBy compare
377409
378410{-# INLINE maximumBy #-}
379−maximumBy :: Monad m => SerialT m Int -> m (Maybe Int)
411+maximumBy :: Monad m => Stream m Int -> m (Maybe Int)
380412maximumBy = S.maximumBy compare
381413
382414{-# INLINE the #-}
383−the :: Monad m => SerialT m Int -> m (Maybe Int)
415+the :: Monad m => Stream m Int -> m (Maybe Int)
384416the = S.the
385417
386418{-# INLINE drainN #-}
387−drainN :: Monad m => Int -> SerialT m Int -> m ()
419+drainN :: Monad m => Int -> Stream m Int -> m ()
388420drainN = S.drainN
389421
390422{-# INLINE drainWhile #-}
391−drainWhile :: Monad m => SerialT m Int -> m ()
423+drainWhile :: Monad m => Stream m Int -> m ()
392424drainWhile = S.drainWhile (const True)
393425
394426{-# INLINE (!!) #-}
395−(!!) :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
396−(!!) = flip (Internal.!!)
427+(!!) :: Monad m => Int -> Stream m Int -> m (Maybe Int)
428+(!!) = flip (S.!!)
397429
398430{-# INLINE lookup #-}
399−lookup :: Monad m => Int -> SerialT m Int -> m (Maybe Int)
431+lookup :: Monad m => Int -> Stream m Int -> m (Maybe Int)
400432lookup val = S.lookup val . S.map (\x -> (x, x))
433+#endif
401434
402435o_1_space_elimination_folds :: Int -> [Benchmark]
403436o_1_space_elimination_folds value =
404437 [ bgroup "elimination"
405438 -- Basic folds
406− [ bgroup "reduce"
439+ [
440+#ifdef USE_PRELUDE
441+ bgroup "reduce"
407442 [ bgroup
408443 "IO"
409444 [ benchIOSink value "foldl'" foldl'Reduce
410445 , benchIOSink value "foldl1'" foldl1'Reduce
411446 , benchIOSink value "foldlM'" foldlM'Reduce
412447 ]
448+
413449 , bgroup
414450 "Identity"
415451 [ benchIdentitySink value "foldl'" foldl'Reduce
416452 , benchIdentitySink value "foldl1'" foldl1'Reduce
417453 , benchIdentitySink value "foldlM'" foldlM'Reduce
418454 ]
419− ]
420− , bgroup "build"
455+ ] ,
456+#endif
457+ bgroup "build"
421458 [ bgroup "IO"
422459 [ benchIOSink value "foldrMElem" (foldrMElem value)
423460 ]
424461 , bgroup "Identity"
425462 [ benchIdentitySink value "foldrMElem" (foldrMElem value)
463+#ifdef USE_STREAMK
426464 , benchIdentitySink value "foldrToStreamLength"
427− (S.length . runIdentity . foldrToStream)
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+ -}
428480 , benchPureSink value "foldrMToListLength"
429481 (Prelude.length . runIdentity . foldrMBuild)
430482 ]
431483 ]
432484
433485 -- deconstruction
434− , benchIOSink value "uncons" uncons
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
435492 , benchIOSink value "init" init
436493
437494 -- draining
@@ -445,8 +502,6 @@ o_1_space_elimination_folds value =
445502 -- , benchIOSink value "head" head
446503 , benchIOSink value "last" last
447504 , benchIOSink value "length" length
448− , benchHoistSink value "length . generally"
449− (length . Internal.generally)
450505 , benchIOSink value "sum" sum
451506 , benchIOSink value "product" product
452507 , benchIOSink value "maximumBy" maximumBy
@@ -470,6 +525,7 @@ o_1_space_elimination_folds value =
470525 , benchIOSink value "any" (any value)
471526 , benchIOSink value "and" (and value)
472527 , benchIOSink value "or" (or value)
528+#endif
473529
474530 -- length is used to check for foldr/build fusion
475531 , benchPureSink value "length . IsList.toList" (Prelude.length . GHC.toList)
@@ -480,12 +536,13 @@ o_1_space_elimination_folds value =
480536-- Buffered Transformations by fold
481537-------------------------------------------------------------------------------
482538
539+#ifdef USE_PRELUDE
483540{-# INLINE foldl'Build #-}
484−foldl'Build :: Monad m => SerialT m Int -> m [Int]
541+foldl'Build :: Monad m => Stream m Int -> m [Int]
485542foldl'Build = S.foldl' (flip (:)) []
486543
487544{-# INLINE foldlM'Build #-}
488−foldlM'Build :: Monad m => SerialT m Int -> m [Int]
545+foldlM'Build :: Monad m => Stream m Int -> m [Int]
489546foldlM'Build = S.foldlM' (\xs x -> return $ x : xs) (return [])
490547
491548o_n_heap_elimination_foldl :: Int -> [Benchmark]
@@ -499,6 +556,7 @@ o_n_heap_elimination_foldl value =
499556 , benchIdentitySink value "foldlM'/build/Identity" foldlM'Build
500557 ]
501558 ]
559+#endif
502560
503561-- For comparisons
504562{-# INLINE showInstanceList #-}
@@ -518,7 +576,7 @@ o_n_heap_elimination_buffered value =
518576 ]
519577
520578{-# INLINE foldrMReduce #-}
521−foldrMReduce :: Monad m => SerialT m Int -> m Int
579+foldrMReduce :: Monad m => Stream m Int -> m Int
522580foldrMReduce = S.foldrM (\x xs -> (x +) <$> xs) (return 0)
523581
524582o_n_space_elimination_foldr :: Int -> [Benchmark]
@@ -534,13 +592,14 @@ o_n_space_elimination_foldr value =
534592 ]
535593 ]
536594
595+#ifdef USE_PRELUDE
537596o_n_heap_elimination_toList :: Int -> [Benchmark]
538597o_n_heap_elimination_toList value =
539598 [ bgroup "toList"
540599 -- Converting the stream to a list or pure stream in a strict monad
541− [ benchIOSink value "toListRev" Internal.toListRev
600+ [ benchIOSink value "toListRev" S.toListRev
542601 , benchIOSink value "toStreamRev"
543− (Internal.toStreamRev :: (SerialT IO Int -> IO (SerialT Identity Int)))
602+ (S.toStreamRev :: (Stream IO Int -> IO (Stream Identity Int)))
544603 ]
545604 ]
546605
@@ -549,10 +608,13 @@ o_n_space_elimination_toList value =
549608 [ bgroup "toList"
550609 -- Converting the stream to a list or pure stream in a strict monad
551610 [ benchIOSink value "toList" S.toList
611+#ifndef USE_PRELUDE
552612 , benchIOSink value "toStream"
553− (Internal.toStream :: (SerialT IO Int -> IO (SerialT Identity Int)))
613+ (S.toStream :: (Stream IO Int -> IO (Stream Identity Int)))
614+#endif
554615 ]
555616 ]
617+#endif
556618
557619-------------------------------------------------------------------------------
558620-- Multi-stream folds
@@ -563,7 +625,7 @@ o_n_space_elimination_toList value =
563625-------------------------------------------------------------------------------
564626
565627{-# INLINE eqBy' #-}
566−eqBy' :: (Monad m, Eq a) => SerialT m a -> m Bool
628+eqBy' :: (Monad m, Eq a) => Stream m a -> m Bool
567629eqBy' src = S.eqBy (==) src src
568630
569631{-# INLINE eqByPure #-}
@@ -577,15 +639,15 @@ inspect $ 'eqByPure `hasNoType` ''D.Step
577639#endif
578640
579641{-# INLINE eqInstance #-}
580−eqInstance :: SerialT Identity Int -> Bool
642+eqInstance :: Stream Identity Int -> Bool
581643eqInstance src = src == src
582644
583645{-# INLINE eqInstanceNotEq #-}
584−eqInstanceNotEq :: SerialT Identity Int -> Bool
646+eqInstanceNotEq :: Stream Identity Int -> Bool
585647eqInstanceNotEq src = src /= src
586648
587649{-# INLINE cmpBy' #-}
588−cmpBy' :: (Monad m, Ord a) => SerialT m a -> m Ordering
650+cmpBy' :: (Monad m, Ord a) => Stream m a -> m Ordering
589651cmpBy' src = S.cmpBy compare src src
590652
591653{-# INLINE cmpByPure #-}
@@ -599,7 +661,7 @@ inspect $ 'cmpByPure `hasNoType` ''D.Step
599661#endif
600662
601663{-# INLINE ordInstance #-}
602−ordInstance :: SerialT Identity Int -> Bool
664+ordInstance :: Stream Identity Int -> Bool
603665ordInstance src = src < src
604666
605667o_1_space_elimination_multi_stream_pure :: Int -> [Benchmark]
@@ -614,15 +676,15 @@ o_1_space_elimination_multi_stream_pure value =
614676 ]
615677
616678{-# INLINE isPrefixOf #-}
617−isPrefixOf :: Monad m => SerialT m Int -> m Bool
679+isPrefixOf :: Monad m => Stream m Int -> m Bool
618680isPrefixOf src = S.isPrefixOf src src
619681
620682{-# INLINE isSubsequenceOf #-}
621−isSubsequenceOf :: Monad m => SerialT m Int -> m Bool
683+isSubsequenceOf :: Monad m => Stream m Int -> m Bool
622684isSubsequenceOf src = S.isSubsequenceOf src src
623685
624686{-# INLINE stripPrefix #-}
625−stripPrefix :: Monad m => SerialT m Int -> m ()
687+stripPrefix :: Monad m => Stream m Int -> m ()
626688stripPrefix src = do
627689 _ <- S.stripPrefix src src
628690 return ()
@@ -673,14 +735,14 @@ benchmarks moduleName size =
673735 , o_1_space_elimination_multi_stream_pure size
674736 , o_1_space_elimination_multi_stream size
675737 ]
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− ]
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
686748 ]
benchmark/Streamly/Benchmark/Prelude/Serial/Exceptions.hs → benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hsrenamed+124−70
@@ -1,5 +1,5 @@
11-- |
2−-- Module : Streamly.Benchmark.Prelude.Serial.Exceptions
2+-- Module : Stream.Exceptions
33-- Copyright : (c) 2019 Composewell Technologies
44-- License : BSD-3-Clause
55-- Maintainer : streamly@composewell.com
@@ -7,8 +7,13 @@
77-- Portability : GHC
88
99{-# LANGUAGE CPP #-}
10+{-# LANGUAGE FlexibleContexts #-}
1011{-# LANGUAGE ScopedTypeVariables #-}
1112
13+#ifdef USE_PRELUDE
14+{-# OPTIONS_GHC -Wno-deprecations #-}
15+#endif
16+
1217#ifdef __HADDOCK_VERSION__
1318#undef INSPECTION
1419#endif
@@ -18,29 +23,63 @@
1823{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
1924#endif
2025
21−module Serial.Exceptions (benchmarks) where
26+module Stream.Exceptions (benchmarks) where
2227
23−import Control.Exception (SomeException, Exception, throwIO)
24−import System.IO (Handle, hClose, hPutChar)
28+import Control.Exception (Exception, throwIO)
29+import Stream.Common (drain)
2530
2631import qualified Data.IORef as Ref
2732import qualified Data.Map.Strict as Map
2833
34+import Control.Exception (SomeException)
35+import System.IO (Handle, hClose, hPutChar)
2936import qualified Streamly.FileSystem.Handle as FH
30−import qualified Streamly.Internal.Data.Unfold as IUF
3137import qualified Streamly.Internal.FileSystem.Handle as IFH
32−import qualified Streamly.Internal.Data.Stream.IsStream as IP
33−import qualified Streamly.Prelude as S
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
3447
35−import Gauge hiding (env)
48+import Test.Tasty.Bench hiding (env)
3649import Prelude hiding (last, length)
3750import Streamly.Benchmark.Common
3851import Streamly.Benchmark.Common.Handle
3952
4053#ifdef INSPECTION
54+import Control.Monad.Catch (MonadCatch)
4155import Test.Inspection
4256
43−import qualified Streamly.Internal.Data.Stream.StreamD as D
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
4483#endif
4584
4685-------------------------------------------------------------------------------
@@ -56,37 +95,41 @@ instance Exception BenchException
5695
5796retryNoneSimple :: Int -> Int -> IO ()
5897retryNoneSimple length from =
59− IP.drain
60− $ IP.retry (Map.singleton BenchException1 length) (const S.nil) source
98+ drain
99+ $ Stream.retry
100+ (Map.singleton BenchException1 length)
101+ (const Stream.nil)
102+ source
61103
62104 where
63105
64− source = S.enumerateFromTo from (from + length)
106+ source = Stream.enumerateFromTo from (from + length)
65107
66108retryNone :: Int -> Int -> IO ()
67109retryNone length from = do
68110 ref <- Ref.newIORef (0 :: Int)
69− IP.drain
70− $ IP.retry (Map.singleton BenchException1 length) (const S.nil)
111+ drain
112+ $ Stream.retry (Map.singleton BenchException1 length) (const Stream.nil)
71113 $ source ref
72114
73115 where
74116
75117 source ref =
76− IP.replicateM (from + length)
118+ Stream.replicateM (from + length)
77119 $ Ref.modifyIORef' ref (+ 1) >> Ref.readIORef ref
78120
79121retryAll :: Int -> Int -> IO ()
80122retryAll length from = do
81123 ref <- Ref.newIORef 0
82− IP.drain
83− $ IP.retry (Map.singleton BenchException1 (length + from)) (const S.nil)
124+ drain
125+ $ Stream.retry
126+ (Map.singleton BenchException1 (length + from)) (const Stream.nil)
84127 $ source ref
85128
86129 where
87130
88131 source ref =
89− IP.fromEffect
132+ Stream.fromEffect
90133 $ do
91134 Ref.modifyIORef' ref (+ 1)
92135 val <- Ref.readIORef ref
@@ -96,13 +139,13 @@ retryAll length from = do
96139
97140retryUnknown :: Int -> Int -> IO ()
98141retryUnknown length from = do
99− IP.drain
100− $ IP.retry (Map.singleton BenchException1 length) (const source)
101− $ throwIO BenchException2 `S.before` S.nil
142+ drain
143+ $ Stream.retry (Map.singleton BenchException1 length) (const source)
144+ $ throwIO BenchException2 `Stream.before` Stream.nil
102145
103146 where
104147
105− source = S.enumerateFromTo from (from + length)
148+ source = Stream.enumerateFromTo from (from + length)
106149
107150
108151o_1_space_serial_exceptions :: Int -> [Benchmark]
@@ -116,6 +159,8 @@ o_1_space_serial_exceptions length =
116159 ]
117160 ]
118161
162+-- XXX Move these to FileSystem.Handle benchmarks
163+
119164-------------------------------------------------------------------------------
120165-- copy stream exceptions
121166-------------------------------------------------------------------------------
@@ -123,8 +168,8 @@ o_1_space_serial_exceptions length =
123168-- | Send the file contents to /dev/null with exception handling
124169readWriteOnExceptionStream :: Handle -> Handle -> IO ()
125170readWriteOnExceptionStream inh devNull =
126− let readEx = S.onException (hClose inh) (S.unfold FH.read inh)
127− in S.fold (FH.write devNull) $ readEx
171+ let readEx = Stream.onException (hClose inh) (Stream.unfold FH.reader inh)
172+ in Stream.fold (FH.write devNull) readEx
128173
129174#ifdef INSPECTION
130175inspect $ hasNoTypeClasses 'readWriteOnExceptionStream
@@ -133,9 +178,10 @@ inspect $ hasNoTypeClasses 'readWriteOnExceptionStream
133178-- | Send the file contents to /dev/null with exception handling
134179readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
135180readWriteHandleExceptionStream inh devNull =
136− let handler (_e :: SomeException) = S.fromEffect (hClose inh >> return 10)
137− readEx = S.handle handler (S.unfold FH.read inh)
138− in S.fold (FH.write devNull) $ readEx
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
139185
140186#ifdef INSPECTION
141187inspect $ hasNoTypeClasses 'readWriteHandleExceptionStream
@@ -144,8 +190,9 @@ inspect $ hasNoTypeClasses 'readWriteHandleExceptionStream
144190-- | Send the file contents to /dev/null with exception handling
145191readWriteFinally_Stream :: Handle -> Handle -> IO ()
146192readWriteFinally_Stream inh devNull =
147− let readEx = IP.finally_ (hClose inh) (S.unfold FH.read inh)
148− in S.fold (FH.write devNull) readEx
193+ let readEx =
194+ finallyUnsafe (hClose inh) (Stream.unfold FH.reader inh)
195+ in Stream.fold (FH.write devNull) readEx
149196
150197#ifdef INSPECTION
151198inspect $ hasNoTypeClasses 'readWriteFinally_Stream
@@ -153,15 +200,15 @@ inspect $ hasNoTypeClasses 'readWriteFinally_Stream
153200
154201readWriteFinallyStream :: Handle -> Handle -> IO ()
155202readWriteFinallyStream inh devNull =
156− let readEx = S.finally (hClose inh) (S.unfold FH.read inh)
157− in S.fold (FH.write devNull) readEx
203+ let readEx = Stream.finally (hClose inh) (Stream.unfold FH.reader inh)
204+ in Stream.fold (FH.write devNull) readEx
158205
159206-- | Send the file contents to /dev/null with exception handling
160207fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
161208fromToBytesBracket_Stream inh devNull =
162− let readEx = IP.bracket_ (return ()) (\_ -> hClose inh)
163− (\_ -> IFH.getBytes inh)
164− in IFH.putBytes devNull $ readEx
209+ let readEx = bracketUnsafe (return ()) (\_ -> hClose inh)
210+ (\_ -> fromStreamD $ IFH.read inh)
211+ in IFH.putBytes devNull (toStreamD readEx)
165212
166213#ifdef INSPECTION
167214inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
@@ -169,16 +216,16 @@ inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
169216
170217fromToBytesBracketStream :: Handle -> Handle -> IO ()
171218fromToBytesBracketStream inh devNull =
172− let readEx = S.bracket (return ()) (\_ -> hClose inh)
173− (\_ -> IFH.getBytes inh)
174− in IFH.putBytes devNull $ readEx
219+ let readEx = Stream.bracket (return ()) (\_ -> hClose inh)
220+ (\_ -> fromStreamD $ IFH.read inh)
221+ in IFH.putBytes devNull (toStreamD readEx)
175222
176223readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
177224readWriteBeforeAfterStream inh devNull =
178225 let readEx =
179− IP.after (hClose inh)
180− $ IP.before (hPutChar devNull 'A') (S.unfold FH.read inh)
181− in S.fold (FH.write devNull) 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
182229
183230#ifdef INSPECTION
184231inspect $ 'readWriteBeforeAfterStream `hasNoType` ''D.Step
@@ -186,8 +233,8 @@ inspect $ 'readWriteBeforeAfterStream `hasNoType` ''D.Step
186233
187234readWriteAfterStream :: Handle -> Handle -> IO ()
188235readWriteAfterStream inh devNull =
189− let readEx = IP.after (hClose inh) (S.unfold FH.read inh)
190− in S.fold (FH.write devNull) readEx
236+ let readEx = Stream.after (hClose inh) (Stream.unfold FH.reader inh)
237+ in Stream.fold (FH.write devNull) readEx
191238
192239#ifdef INSPECTION
193240inspect $ 'readWriteAfterStream `hasNoType` ''D.Step
@@ -195,8 +242,8 @@ inspect $ 'readWriteAfterStream `hasNoType` ''D.Step
195242
196243readWriteAfter_Stream :: Handle -> Handle -> IO ()
197244readWriteAfter_Stream inh devNull =
198− let readEx = IP.after_ (hClose inh) (S.unfold FH.read inh)
199− in S.fold (FH.write devNull) readEx
245+ let readEx = afterUnsafe (hClose inh) (Stream.unfold FH.reader inh)
246+ in Stream.fold (FH.write devNull) readEx
200247
201248#ifdef INSPECTION
202249inspect $ hasNoTypeClasses 'readWriteAfter_Stream
@@ -206,25 +253,25 @@ inspect $ 'readWriteAfter_Stream `hasNoType` ''D.Step
206253o_1_space_copy_stream_exceptions :: BenchEnv -> [Benchmark]
207254o_1_space_copy_stream_exceptions env =
208255 [ bgroup "exceptions"
209− [ mkBenchSmall "S.onException" env $ \inh _ ->
256+ [ mkBenchSmall "Stream.onException" env $ \inh _ ->
210257 readWriteOnExceptionStream inh (nullH env)
211− , mkBenchSmall "S.handle" env $ \inh _ ->
258+ , mkBenchSmall "Stream.handle" env $ \inh _ ->
212259 readWriteHandleExceptionStream inh (nullH env)
213− , mkBenchSmall "S.finally_" env $ \inh _ ->
260+ , mkBenchSmall "Stream.finally_" env $ \inh _ ->
214261 readWriteFinally_Stream inh (nullH env)
215− , mkBenchSmall "S.finally" env $ \inh _ ->
262+ , mkBenchSmall "Stream.finally" env $ \inh _ ->
216263 readWriteFinallyStream inh (nullH env)
217− , mkBenchSmall "S.after . S.before" env $ \inh _ ->
264+ , mkBenchSmall "Stream.after . Stream.before" env $ \inh _ ->
218265 readWriteBeforeAfterStream inh (nullH env)
219− , mkBenchSmall "S.after" env $ \inh _ ->
266+ , mkBenchSmall "Stream.after" env $ \inh _ ->
220267 readWriteAfterStream inh (nullH env)
221− , mkBenchSmall "S.after_" env $ \inh _ ->
268+ , mkBenchSmall "Stream.after_" env $ \inh _ ->
222269 readWriteAfter_Stream inh (nullH env)
223270 ]
224271 , bgroup "exceptions/fromToBytes"
225− [ mkBenchSmall "S.bracket_" env $ \inh _ ->
272+ [ mkBenchSmall "Stream.bracket_" env $ \inh _ ->
226273 fromToBytesBracket_Stream inh (nullH env)
227− , mkBenchSmall "S.bracket" env $ \inh _ ->
274+ , mkBenchSmall "Stream.bracket" env $ \inh _ ->
228275 fromToBytesBracketStream inh (nullH env)
229276 ]
230277 ]
@@ -236,26 +283,34 @@ o_1_space_copy_stream_exceptions env =
236283-- | Send the file contents to /dev/null with exception handling
237284readChunksOnException :: Handle -> Handle -> IO ()
238285readChunksOnException inh devNull =
239− let readEx = IUF.onException (\_ -> hClose inh) FH.readChunks
286+ let readEx = IUF.onException (\_ -> hClose inh) FH.chunkReader
240287 in IUF.fold (IFH.writeChunks devNull) readEx inh
241288
242289#ifdef INSPECTION
290+#if __GLASGOW_HASKELL__ >= 906
291+inspect $ hasNoTypeClassesExcept 'readChunksOnException [''MonadCatch]
292+#else
243293inspect $ hasNoTypeClasses 'readChunksOnException
244294#endif
295+#endif
245296
246297-- | Send the file contents to /dev/null with exception handling
247298readChunksBracket_ :: Handle -> Handle -> IO ()
248299readChunksBracket_ inh devNull =
249− let readEx = IUF.bracket_ return (\_ -> hClose inh) FH.readChunks
300+ let readEx = IUF.bracket_ return (\_ -> hClose inh) FH.chunkReader
250301 in IUF.fold (IFH.writeChunks devNull) readEx inh
251302
252303#ifdef INSPECTION
304+#if __GLASGOW_HASKELL__ >= 906
305+inspect $ hasNoTypeClassesExcept 'readChunksBracket_ [''MonadCatch]
306+#else
253307inspect $ hasNoTypeClasses 'readChunksBracket_
254308#endif
309+#endif
255310
256311readChunksBracket :: Handle -> Handle -> IO ()
257312readChunksBracket inh devNull =
258− let readEx = IUF.bracket return (\_ -> hClose inh) FH.readChunks
313+ let readEx = IUF.bracket return (\_ -> hClose inh) FH.chunkReader
259314 in IUF.fold (IFH.writeChunks devNull) readEx inh
260315
261316o_1_space_copy_exceptions_readChunks :: BenchEnv -> [Benchmark]
@@ -277,11 +332,11 @@ o_1_space_copy_exceptions_readChunks env =
277332-- | Send the file contents to /dev/null with exception handling
278333toChunksBracket_ :: Handle -> Handle -> IO ()
279334toChunksBracket_ inh devNull =
280− let readEx = IP.bracket_
335+ let readEx = bracketUnsafe
281336 (return ())
282337 (\_ -> hClose inh)
283− (\_ -> IFH.getChunks inh)
284− in S.fold (IFH.writeChunks devNull) $ readEx
338+ (\_ -> fromStreamD $ IFH.readChunks inh)
339+ in Stream.fold (IFH.writeChunks devNull) readEx
285340
286341#ifdef INSPECTION
287342inspect $ hasNoTypeClasses 'toChunksBracket_
@@ -289,29 +344,28 @@ inspect $ hasNoTypeClasses 'toChunksBracket_
289344
290345toChunksBracket :: Handle -> Handle -> IO ()
291346toChunksBracket inh devNull =
292− let readEx = S.bracket
347+ let readEx = Stream.bracket
293348 (return ())
294349 (\_ -> hClose inh)
295− (\_ -> IFH.getChunks inh)
296− in S.fold (IFH.writeChunks devNull) $ readEx
350+ (\_ -> fromStreamD $ IFH.readChunks inh)
351+ in Stream.fold (IFH.writeChunks devNull) readEx
297352
298353o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
299354o_1_space_copy_exceptions_toChunks env =
300355 [ bgroup "exceptions/toChunks"
301− [ mkBench "S.bracket_" env $ \inH _ ->
356+ [ mkBench "Stream.bracket_" env $ \inH _ ->
302357 toChunksBracket_ inH (nullH env)
303− , mkBench "S.bracket" env $ \inH _ ->
358+ , mkBench "Stream.bracket" env $ \inH _ ->
304359 toChunksBracket inH (nullH env)
305360 ]
306361 ]
307362
308−
309363benchmarks :: String -> BenchEnv -> Int -> [Benchmark]
310−benchmarks moduleName env size =
364+benchmarks moduleName _env size =
311365 [ bgroup (o_1_space_prefix moduleName) $ concat
312− [ o_1_space_copy_exceptions_readChunks env
313− , o_1_space_copy_exceptions_toChunks env
314− , o_1_space_copy_stream_exceptions env
315− , o_1_space_serial_exceptions size
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
316370 ]
317371 ]
benchmark/Streamly/Benchmark/Prelude/Serial/NestedStream.hs → benchmark/Streamly/Benchmark/Data/Stream/Expand.hsrenamed+217−156
@@ -1,5 +1,5 @@
11-- |
2−-- Module : Serial.NestedStream
2+-- Module : Stream.Expand
33-- Copyright : (c) 2018 Composewell Technologies
44-- License : BSD-3-Clause
55-- Maintainer : streamly@composewell.com
@@ -8,6 +8,11 @@
88{-# LANGUAGE FlexibleContexts #-}
99{-# LANGUAGE ScopedTypeVariables #-}
1010{-# LANGUAGE RankNTypes #-}
11+{-# LANGUAGE TupleSections #-}
12+
13+#ifdef USE_PRELUDE
14+{-# OPTIONS_GHC -Wno-deprecations #-}
15+#endif
1116
1217#ifdef __HADDOCK_VERSION__
1318#undef INSPECTION
@@ -18,33 +23,47 @@
1823{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
1924#endif
2025
21−module Serial.NestedStream (benchmarks) where
22−
23−import Control.Monad.Trans.Class (lift)
24−
25−import qualified Control.Applicative as AP
26+module Stream.Expand (benchmarks) where
2627
2728#ifdef INSPECTION
2829import GHC.Types (SPEC(..))
2930import Test.Inspection
3031
31−import qualified Streamly.Internal.Data.Stream.StreamD as D
32+import qualified Streamly.Internal.Data.Stream as D
3233#endif
3334
34−import qualified Streamly.Prelude as S
35−import qualified Streamly.Internal.Data.Stream.IsStream as Internal
35+import qualified Stream.Common as Common
3636import qualified Streamly.Internal.Data.Unfold as UF
3737
38−import Gauge
39−import Streamly.Prelude (SerialT, fromSerial, serial)
40−import Streamly.Benchmark.Common
38+#ifdef USE_PRELUDE
39+import qualified Streamly.Internal.Data.Stream.IsStream as S
40+import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
4141import 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
59+import Streamly.Benchmark.Common
4260import Prelude hiding (concatMap)
4361
4462-------------------------------------------------------------------------------
4563-- Iteration/looping utilities
4664-------------------------------------------------------------------------------
4765
66+#ifdef USE_STREAMK
4867{-# INLINE iterateN #-}
4968iterateN :: (Int -> a -> a) -> a -> Int -> a
5069iterateN g initial count = f count initial
@@ -56,13 +75,18 @@ iterateN g initial count = f count initial
5675
5776-- Iterate a transformation over a singleton stream
5877{-# INLINE iterateSingleton #-}
59−iterateSingleton :: S.MonadAsync m
60− => (Int -> SerialT m Int -> SerialT m Int)
78+iterateSingleton :: Applicative m =>
79+ (Int -> CrossStreamK m Int -> CrossStreamK m Int)
6180 -> Int
6281 -> Int
63− -> SerialT m Int
64−iterateSingleton g count n = iterateN g (return n) count
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
6588
89+{-
6690-- XXX need to check why this is slower than the explicit recursion above, even
6791-- if the above code is written in a foldr like head recursive way. We also
6892-- need to try this with foldlM' once #150 is fixed.
@@ -70,12 +94,13 @@ iterateSingleton g count n = iterateN g (return n) count
7094-- foldrM and any related fusion issues.
7195{-# INLINE _iterateSingleton #-}
7296_iterateSingleton ::
73− S.MonadAsync m
74− => (Int -> SerialT m Int -> SerialT m Int)
97+ Monad m
98+ => (Int -> Stream m Int -> Stream m Int)
7599 -> Int
76100 -> Int
77− -> SerialT m Int
101+ -> Stream m Int
78102_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
103+-}
79104
80105-------------------------------------------------------------------------------
81106-- Multi-Stream
@@ -88,50 +113,28 @@ _iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
88113{-# INLINE serial2 #-}
89114serial2 :: Int -> Int -> IO ()
90115serial2 count n =
91− S.drain $
92− S.serial (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
116+ drain $ toStream $
117+ Common.append
118+ (fromStream $ sourceUnfoldrM count n)
119+ (fromStream $ sourceUnfoldrM count (n + 1))
93120
94121{-# INLINE serial4 #-}
95122serial4 :: Int -> Int -> IO ()
96123serial4 count n =
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
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)))
127132
128133o_1_space_joining :: Int -> [Benchmark]
129134o_1_space_joining value =
130135 [ bgroup "joining"
131136 [ benchIOSrc1 "serial (2,x/2)" (serial2 (value `div` 2))
132− , benchIOSrc1 "append (2,x/2)" (append2 (value `div` 2))
133137 , benchIOSrc1 "serial (2,2,x/4)" (serial4 (value `div` 4))
134− , benchIOSrc1 "append (2,2,x/4)" (append4 (value `div` 4))
135138 ]
136139 ]
137140
@@ -139,22 +142,24 @@ o_1_space_joining value =
139142-- Concat Foldable containers
140143-------------------------------------------------------------------------------
141144
145+#ifdef USE_PRELUDE
142146o_1_space_concatFoldable :: Int -> [Benchmark]
143147o_1_space_concatFoldable value =
144148 [ bgroup "concat-foldable"
145− [ benchIOSrc fromSerial "foldMapWith (<>) (List)"
149+ [ benchIOSrc "foldMapWith (<>) (List)"
146150 (sourceFoldMapWith value)
147− , benchIOSrc fromSerial "foldMapWith (<>) (Stream)"
151+ , benchIOSrc "foldMapWith (<>) (Stream)"
148152 (sourceFoldMapWithStream value)
149− , benchIOSrc fromSerial "foldMapWithM (<>) (List)"
153+ , benchIOSrc "foldMapWithM (<>) (List)"
150154 (sourceFoldMapWithM value)
151− , benchIOSrc fromSerial "S.concatFoldableWith (<>) (List)"
155+ , benchIOSrc "S.concatFoldableWith (<>) (List)"
152156 (concatFoldableWith value)
153− , benchIOSrc fromSerial "S.concatForFoldableWith (<>) (List)"
157+ , benchIOSrc "S.concatForFoldableWith (<>) (List)"
154158 (concatForFoldableWith value)
155− , benchIOSrc fromSerial "foldMapM (List)" (sourceFoldMapM value)
159+ , benchIOSrc "foldMapM (List)" (sourceFoldMapM value)
156160 ]
157161 ]
162+#endif
158163
159164-------------------------------------------------------------------------------
160165-- Concat
@@ -165,14 +170,15 @@ o_1_space_concatFoldable value =
165170{-# INLINE concatMap #-}
166171concatMap :: Int -> Int -> Int -> IO ()
167172concatMap outer inner n =
168− S.drain $ S.concatMap
169− (\_ -> sourceUnfoldrM inner n)
170− (sourceUnfoldrM outer n)
173+ drain $ toStream $ StreamK.concatMap
174+ (\_ -> fromStream $ sourceUnfoldrM inner n)
175+ (fromStream $ sourceUnfoldrM outer n)
171176
177+#ifndef USE_STREAMK
172178{-# INLINE concatMapM #-}
173179concatMapM :: Int -> Int -> Int -> IO ()
174180concatMapM outer inner n =
175− S.drain $ S.concatMapM
181+ drain $ S.concatMapM
176182 (\_ -> return $ sourceUnfoldrM inner n)
177183 (sourceUnfoldrM outer n)
178184
@@ -180,18 +186,23 @@ concatMapM outer inner n =
180186inspect $ hasNoTypeClasses 'concatMap
181187inspect $ 'concatMap `hasNoType` ''SPEC
182188#endif
189+#endif
183190
184191-- concatMap unfoldr/unfoldr
185192
186193{-# INLINE concatMapPure #-}
187194concatMapPure :: Int -> Int -> Int -> IO ()
188195concatMapPure outer inner n =
189− S.drain $ S.concatMap
190− (\_ -> sourceUnfoldr inner n)
191− (sourceUnfoldr outer n)
196+ drain $ toStream $ StreamK.concatMap
197+ (\_ -> fromStream $ sourceUnfoldr inner n)
198+ (fromStream $ sourceUnfoldr outer n)
192199
193200#ifdef INSPECTION
201+#if __GLASGOW_HASKELL__ >= 906
202+inspect $ hasNoTypeClassesExcept 'concatMapPure [''Applicative]
203+#else
194204inspect $ hasNoTypeClasses 'concatMapPure
205+#endif
195206inspect $ 'concatMapPure `hasNoType` ''SPEC
196207#endif
197208
@@ -200,42 +211,53 @@ inspect $ 'concatMapPure `hasNoType` ''SPEC
200211{-# INLINE concatMapRepl #-}
201212concatMapRepl :: Int -> Int -> Int -> IO ()
202213concatMapRepl outer inner n =
203− S.drain $ S.concatMap (S.replicate inner) (sourceUnfoldrM outer n)
214+ drain $ toStream $ StreamK.concatMap
215+ (fromStream . S.replicate inner) (fromStream $ sourceUnfoldrM outer n)
204216
205217#ifdef INSPECTION
218+#if __GLASGOW_HASKELL__ >= 906
219+inspect $ hasNoTypeClassesExcept 'concatMapRepl [''Applicative]
220+#else
206221inspect $ hasNoTypeClasses 'concatMapRepl
222+#endif
207223inspect $ 'concatMapRepl `hasNoType` ''SPEC
208224#endif
209225
210226-- concatMapWith
211227
228+#ifdef USE_STREAMK
212229{-# INLINE concatMapWithSerial #-}
213230concatMapWithSerial :: Int -> Int -> Int -> IO ()
214−concatMapWithSerial = concatStreamsWith S.serial
231+concatMapWithSerial = concatStreamsWith Common.append
215232
216233#ifdef INSPECTION
217234inspect $ hasNoTypeClasses 'concatMapWithSerial
218235inspect $ 'concatMapWithSerial `hasNoType` ''SPEC
219236#endif
220237
238+{-
221239{-# INLINE concatMapWithAppend #-}
222240concatMapWithAppend :: Int -> Int -> Int -> IO ()
223−concatMapWithAppend = concatStreamsWith Internal.append
241+concatMapWithAppend = concatStreamsWith Common.append2
224242
225243#ifdef INSPECTION
226244inspect $ hasNoTypeClasses 'concatMapWithAppend
227245inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
228246#endif
247+-}
229248
230−-- concatPairWith
249+-- mergeMapWith
231250
232−{-# INLINE concatPairWithSerial #-}
233−concatPairWithSerial :: Int -> Int -> Int -> IO ()
234−concatPairWithSerial = concatPairsWith Internal.serial
251+{-# INLINE mergeMapWithSerial #-}
252+mergeMapWithSerial :: Int -> Int -> Int -> IO ()
253+mergeMapWithSerial = mergeMapWith Common.append
235254
236−{-# INLINE concatPairWithAppend #-}
237−concatPairWithAppend :: Int -> Int -> Int -> IO ()
238−concatPairWithAppend = concatPairsWith Internal.append
255+{-
256+{-# INLINE mergeMapWithAppend #-}
257+mergeMapWithAppend :: Int -> Int -> Int -> IO ()
258+mergeMapWithAppend = mergeMapWith Common.append2
259+-}
260+#endif
239261
240262-- unfoldMany
241263
@@ -244,10 +266,11 @@ concatPairWithAppend = concatPairsWith Internal.append
244266{-# INLINE unfoldManyRepl #-}
245267unfoldManyRepl :: Int -> Int -> Int -> IO ()
246268unfoldManyRepl outer inner n =
247− S.drain
269+ drain
248270 $ S.unfoldMany
249− (UF.lmap return (UF.replicateM inner))
250− (sourceUnfoldrM outer n)
271+ UF.replicateM
272+ (fmap ((inner,) . return) (sourceUnfoldrM outer n))
273+
251274
252275#ifdef INSPECTION
253276inspect $ hasNoTypeClasses 'unfoldManyRepl
@@ -265,10 +288,6 @@ o_1_space_concat value = sqrtVal `seq`
265288 , benchIOSrc1 "concatMapPure (1 of n)"
266289 (concatMapPure 1 value)
267290
268− -- This is for comparison with foldMapWith
269− , benchIOSrc fromSerial "concatMapId (n of 1) (fromFoldable)"
270− (S.concatMap id . sourceConcatMapId value)
271−
272291 , benchIOSrc1 "concatMap (n of 1)"
273292 (concatMap value 1)
274293 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
@@ -276,16 +295,25 @@ o_1_space_concat value = sqrtVal `seq`
276295 , benchIOSrc1 "concatMap (1 of n)"
277296 (concatMap 1 value)
278297
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+
279303 , benchIOSrc1 "concatMapM (n of 1)"
280304 (concatMapM value 1)
281305 , benchIOSrc1 "concatMapM (sqrt n of sqrt n)"
282306 (concatMapM sqrtVal sqrtVal)
283307 , benchIOSrc1 "concatMapM (1 of n)"
284308 (concatMapM 1 value)
309+#endif
285310
311+#ifdef USE_STREAMK
312+ {-
286313 -- This is for comparison with foldMapWith
287− , benchIOSrc fromSerial "concatMapWithId (n of 1) (fromFoldable)"
288− (S.concatMapWith serial id . sourceConcatMapId value)
314+ , benchIOSrc "concatMapWithId (n of 1) (fromFoldable)"
315+ (toStream . S.concatMapWith Common.append id . sourceConcatMapId value)
316+ -}
289317
290318 , benchIOSrc1 "concatMapWith (n of 1)"
291319 (concatMapWithSerial value 1)
@@ -294,9 +322,12 @@ o_1_space_concat value = sqrtVal `seq`
294322 , benchIOSrc1 "concatMapWith (1 of n)"
295323 (concatMapWithSerial 1 value)
296324
325+ {-
297326 -- quadratic with number of outer streams
298327 , benchIOSrc1 "concatMapWithAppend (2 of n/2)"
299328 (concatMapWithAppend 2 (value `div` 2))
329+ -}
330+#endif
300331
301332 -- concatMap vs unfoldMany
302333 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
@@ -310,31 +341,35 @@ o_1_space_concat value = sqrtVal `seq`
310341
311342 sqrtVal = round $ sqrt (fromIntegral value :: Double)
312343
313−o_n_space_concat :: Int -> [Benchmark]
314−o_n_space_concat value = sqrtVal `seq`
344+#ifdef USE_STREAMK
345+o_n_space_merge :: Int -> [Benchmark]
346+o_n_space_merge value = sqrtVal `seq`
315347 [ bgroup "concat"
316348 [
317− -------------------concatPairsWith-----------------
349+ -------------------mergeMapWith-----------------
318350
319351 -- Use large number of streams to check scalability
320352
321− benchIOSrc1 "concatPairWithSerial (n of 1)"
322− (concatPairWithSerial value 1)
323− , benchIOSrc1 "concatPairWithSerial (sqrtVal of sqrtVal)"
324− (concatPairWithSerial sqrtVal sqrtVal)
325− , benchIOSrc1 "concatPairWithSerial (2 of n/2)"
326− (concatPairWithSerial 2 (value `div` 2))
327−
328− , benchIOSrc1 "concatPairWithAppend (n of 1)"
329− (concatPairWithAppend value 1)
330− , benchIOSrc1 "concatPairWithAppend (sqrtVal of sqrtVal)"
331− (concatPairWithAppend sqrtVal sqrtVal)
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+ -}
332366 ]
333367 ]
334368
335369 where
336370
337371 sqrtVal = round $ sqrt (fromIntegral value :: Double)
372+#endif
338373
339374-------------------------------------------------------------------------------
340375-- Applicative
@@ -343,26 +378,28 @@ o_n_space_concat value = sqrtVal `seq`
343378o_1_space_applicative :: Int -> [Benchmark]
344379o_1_space_applicative value =
345380 [ bgroup "Applicative"
346− [ benchIO "(*>) (sqrt n x sqrt n)" $ apDiscardFst value fromSerial
347− , benchIO "(<*) (sqrt n x sqrt n)" $ apDiscardSnd value fromSerial
348− , benchIO "(<*>) (sqrt n x sqrt n)" $ toNullAp value fromSerial
349− , benchIO "liftA2 (sqrt n x sqrt n)" $ apLiftA2 value fromSerial
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
350385 ]
351386 ]
352387
388+#ifdef USE_STREAMK
353389o_n_space_applicative :: Int -> [Benchmark]
354390o_n_space_applicative value =
355− [ bgroup "Applicative"
356− [ benchIOSrc fromSerial "(*>) (n times)" $
391+ [ bgroup "iterated"
392+ [ benchIOSrc "(*>) (n times)" $
357393 iterateSingleton ((*>) . pure) value
358− , benchIOSrc fromSerial "(<*) (n times)" $
394+ , benchIOSrc "(<*) (n times)" $
359395 iterateSingleton (\x xs -> xs <* pure x) value
360− , benchIOSrc fromSerial "(<*>) (n times)" $
396+ , benchIOSrc "(<*>) (n times)" $
361397 iterateSingleton (\x xs -> pure (+ x) <*> xs) value
362− , benchIOSrc fromSerial "liftA2 (n times)" $
398+ , benchIOSrc "liftA2 (n times)" $
363399 iterateSingleton (AP.liftA2 (+) . pure) value
364400 ]
365401 ]
402+#endif
366403
367404-------------------------------------------------------------------------------
368405-- Monad
@@ -371,45 +408,61 @@ o_n_space_applicative value =
371408o_1_space_monad :: Int -> [Benchmark]
372409o_1_space_monad value =
373410 [ bgroup "Monad"
374− [ benchIO "(>>) (sqrt n x sqrt n)" $ monadThen value fromSerial
375− , benchIO "(>>=) (sqrt n x sqrt n)" $ toNullM value fromSerial
411+ [ benchIO "(>>) (sqrt n x sqrt n)" $ monadThen value
412+ , benchIO "(>>=) (sqrt n x sqrt n)" $ toNullM value
376413 , benchIO "(>>=) (sqrt n x sqrt n) (filterAllOut)" $
377− filterAllOutM value fromSerial
414+ filterAllOutM value
378415 , benchIO "(>>=) (sqrt n x sqrt n) (filterAllIn)" $
379− filterAllInM value fromSerial
416+ filterAllInM value
380417 , benchIO "(>>=) (sqrt n x sqrt n) (filterSome)" $
381− filterSome value fromSerial
418+ filterSome value
382419 , benchIO "(>>=) (sqrt n x sqrt n) (breakAfterSome)" $
383− breakAfterSome value fromSerial
420+ breakAfterSome value
384421 , benchIO "(>>=) (cubert n x cubert n x cubert n)" $
385− toNullM3 value fromSerial
422+ toNullM3 value
386423 ]
387424 ]
388425
426+#ifdef USE_STREAMK
389427-- This is a good benchmark but inefficient way to compute primes. As we see a
390428-- new prime we keep appending a division filter for all the future numbers.
391429{-# INLINE sieve #-}
392−sieve :: Monad m => SerialT m Int -> SerialT m Int
393−sieve s = do
394− r <- lift $ S.uncons s
430+sieve :: Monad m => StreamK m Int -> StreamK m Int
431+sieve s = StreamK.concatEffect $ do
432+ r <- StreamK.uncons s
395433 case r of
396434 Just (prime, rest) ->
397− prime `S.cons` sieve (S.filter (\n -> n `mod` prime /= 0) rest)
398− Nothing -> S.nil
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
399458
400459o_n_space_monad :: Int -> [Benchmark]
401460o_n_space_monad value =
402461 [ bgroup "Monad"
403− [ benchIOSrc fromSerial "(>>) (n times)" $
404− iterateSingleton ((>>) . pure) value
405− , benchIOSrc fromSerial "(>>=) (n times)" $
406− iterateSingleton (\x xs -> xs >>= \y -> return (x + y)) value
407− , benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
408− toListM value fromSerial
462+ [ benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
463+ toListM value
409464 , benchIO "(>>=) (sqrt n x sqrt n) (toListSome)" $
410− toListSome value fromSerial
411− , benchIO "naive prime sieve (n/4)"
412− (\n -> S.sum $ sieve $ S.enumerateFromTo 2 (value `div` 4 + n))
465+ toListSome value
413466 ]
414467 ]
415468
@@ -417,26 +470,27 @@ o_n_space_monad value =
417470-- Joining
418471-------------------------------------------------------------------------------
419472
473+{-
420474toKv :: Int -> (Int, Int)
421475toKv p = (p, p)
422476
423477{-# INLINE joinWith #-}
424−joinWith :: (S.MonadAsync m) =>
425− ((Int -> Int -> Bool) -> SerialT m Int -> SerialT m Int -> SerialT m b)
478+joinWith :: Common.MonadAsync m =>
479+ ((Int -> Int -> Bool) -> Stream m Int -> Stream m Int -> Stream m b)
426480 -> Int
427481 -> Int
428482 -> m ()
429483joinWith j val i =
430− S.drain $ j (==) (sourceUnfoldrM val i) (sourceUnfoldrM val (val `div` 2))
484+ drain $ j (==) (sourceUnfoldrM val i) (sourceUnfoldrM val (val `div` 2))
431485
432486{-# INLINE joinMapWith #-}
433−joinMapWith :: (S.MonadAsync m) =>
434− (SerialT m (Int, Int) -> SerialT m (Int, Int) -> SerialT m b)
487+joinMapWith :: Common.MonadAsync m =>
488+ (Stream m (Int, Int) -> Stream m (Int, Int) -> Stream m b)
435489 -> Int
436490 -> Int
437491 -> m ()
438492joinMapWith j val i =
439− S.drain
493+ drain
440494 $ j
441495 (fmap toKv (sourceUnfoldrM val i))
442496 (fmap toKv (sourceUnfoldrM val (val `div` 2)))
@@ -445,22 +499,22 @@ o_n_heap_buffering :: Int -> [Benchmark]
445499o_n_heap_buffering value =
446500 [ bgroup "buffered"
447501 [
448− benchIOSrc1 "joinInner (sqrtVal)"
449− $ joinWith Internal.joinInner sqrtVal
450− , benchIOSrc1 "joinInnerMap"
451− $ joinMapWith Internal.joinInnerMap halfVal
452− , benchIOSrc1 "joinLeft (sqrtVal)"
453− $ joinWith Internal.joinLeft sqrtVal
454− , benchIOSrc1 "joinLeftMap "
455− $ joinMapWith Internal.joinLeftMap halfVal
456− , benchIOSrc1 "joinOuter (sqrtVal)"
457− $ joinWith Internal.joinOuter sqrtVal
458− , benchIOSrc1 "joinOuterMap"
459− $ joinMapWith Internal.joinOuterMap halfVal
460− , benchIOSrc1 "intersectBy (sqrtVal)"
461− $ joinWith Internal.intersectBy sqrtVal
462− , benchIOSrc1 "intersectBySorted"
463− $ joinMapWith (Internal.intersectBySorted compare) halfVal
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
464518 ]
465519 ]
466520
@@ -468,6 +522,7 @@ o_n_heap_buffering value =
468522
469523 halfVal = value `div` 2
470524 sqrtVal = round $ sqrt (fromIntegral value :: Double)
525+-}
471526
472527-------------------------------------------------------------------------------
473528-- Main
@@ -476,27 +531,33 @@ o_n_heap_buffering value =
476531-- In addition to gauge options, the number of elements in the stream can be
477532-- passed using the --stream-size option.
478533--
534+{-# ANN benchmarks "HLint: ignore" #-}
479535benchmarks :: String -> Int -> [Benchmark]
480536benchmarks moduleName size =
481537 [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
482538 [
483539 -- multi-stream
484540 o_1_space_joining size
541+#ifdef USE_PRELUDE
485542 , o_1_space_concatFoldable size
543+#endif
486544 , o_1_space_concat size
487−
488545 , o_1_space_applicative size
489546 , o_1_space_monad size
490−
491547 ]
492548 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
493549 [
494550 -- multi-stream
495− o_n_space_applicative size
496− , o_n_space_monad size
497− , o_n_space_concat size
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
498557 ]
558+ {-
499559 , bgroup (o_n_heap_prefix moduleName) $
500560 -- multi-stream
501561 o_n_heap_buffering size
562+ -}
502563 ]
benchmark/Streamly/Benchmark/Data/Stream/Generate.hsnew file+278
@@ -0,0 +1,278 @@
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.hsnew file+146
@@ -0,0 +1,146 @@
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.hsnew file+588
@@ -0,0 +1,588 @@
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/Prelude/Serial/Split.hs → benchmark/Streamly/Benchmark/Data/Stream/Split.hsrenamed+25−12
@@ -1,5 +1,7 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
2−-- Module : Streamly.Benchmark.Prelude.Serial.Split
4+-- Module : Stream.Split
35-- Copyright : (c) 2019 Composewell Technologies
46-- License : BSD-3-Clause
57-- Maintainer : streamly@composewell.com
@@ -18,14 +20,14 @@
1820{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
1921#endif
2022
21−module Serial.Split (benchmarks) where
23+module Stream.Split (benchmarks) where
2224
2325import Data.Char (ord)
2426import Data.Word (Word8)
2527import System.IO (Handle)
2628
2729import qualified Streamly.FileSystem.Handle as FH
28−import qualified Streamly.Internal.Data.Array.Foreign as A
30+import qualified Streamly.Internal.Data.Array as A
2931import qualified Streamly.Internal.Data.Fold as FL
3032import qualified Streamly.Internal.Data.Parser as PR
3133import qualified Streamly.Internal.Data.Stream.IsStream as IP
@@ -33,15 +35,15 @@ import qualified Streamly.Internal.FileSystem.Handle as IFH
3335import qualified Streamly.Internal.Unicode.Stream as IUS
3436import qualified Streamly.Prelude as S
3537
36−import Gauge hiding (env)
38+import Test.Tasty.Bench hiding (env)
3739import Prelude hiding (last, length)
3840import Streamly.Benchmark.Common
3941import Streamly.Benchmark.Common.Handle
4042
4143#ifdef INSPECTION
42−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
44+import Streamly.Internal.Data.Stream (Step(..))
4345
44−import qualified Streamly.Internal.Data.Array.Foreign.Mut.Type as MA
46+import qualified Streamly.Internal.Data.MutArray as MA
4547import qualified Streamly.Internal.Data.Unfold as IUF
4648
4749import Test.Inspection
@@ -67,7 +69,7 @@ splitOn inh =
6769inspect $ hasNoTypeClasses 'splitOn
6870inspect $ 'splitOn `hasNoType` ''Step
6971inspect $ 'splitOn `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
70−inspect $ 'splitOn `hasNoType` ''MA.ReadUState -- FH.read/A.read
72+inspect $ 'splitOn `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
7173#endif
7274
7375-- | Split suffix on line feed.
@@ -80,7 +82,7 @@ splitOnSuffix inh =
8082inspect $ hasNoTypeClasses 'splitOnSuffix
8183inspect $ 'splitOnSuffix `hasNoType` ''Step
8284inspect $ 'splitOnSuffix `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
83−inspect $ 'splitOnSuffix `hasNoType` ''MA.ReadUState -- FH.read/A.read
85+inspect $ 'splitOnSuffix `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
8486#endif
8587
8688-- | Split suffix with line feed.
@@ -93,7 +95,7 @@ splitWithSuffix inh =
9395inspect $ hasNoTypeClasses 'splitWithSuffix
9496inspect $ 'splitWithSuffix `hasNoType` ''Step
9597inspect $ 'splitWithSuffix `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
96−inspect $ 'splitWithSuffix `hasNoType` ''MA.ReadUState -- FH.read/A.read
98+inspect $ 'splitWithSuffix `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
9799#endif
98100
99101-- | Split on line feed.
@@ -124,7 +126,7 @@ wordsBy inh =
124126inspect $ hasNoTypeClasses 'wordsBy
125127inspect $ 'wordsBy `hasNoType` ''Step
126128inspect $ 'wordsBy `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
127−inspect $ 'wordsBy `hasNoType` ''MA.ReadUState -- FH.read/A.read
129+inspect $ 'wordsBy `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
128130#endif
129131
130132-- | Split on a word8 sequence.
@@ -141,7 +143,7 @@ splitOnSeq str inh =
141143-- | Split on a word8 sequence.
142144splitOnSeq100k :: Handle -> IO Int
143145splitOnSeq100k inh = do
144− arr <- A.fromStream $ S.replicate 100000 123
146+ arr <- A.fromStream $ IP.toStream $ S.fromSerial $ S.replicate 100000 123
145147 (S.length $ IP.splitOnSeq arr FL.drain
146148 $ S.unfold FH.read inh) -- >>= print
147149
@@ -156,6 +158,12 @@ splitOnSuffixSeq str inh =
156158-- inspect $ 'splitOnSuffixSeq `hasNoType` ''Step
157159#endif
158160
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+
159167o_1_space_reduce_read_split :: BenchEnv -> [Benchmark]
160168o_1_space_reduce_read_split env =
161169 [ bgroup "split"
@@ -185,6 +193,8 @@ o_1_space_reduce_read_split env =
185193 splitOnSeq "\r\n" inh
186194 , mkBench "S.splitOnSuffixSeq \"\\r\\n\" FL.drain" env $ \inh _ ->
187195 splitOnSuffixSeq "\r\n" inh
196+ , mkBench "S.splitWithSuffixSeq \"\\r\\n\" FL.drain" env $ \inh _ ->
197+ splitWithSuffixSeq "\r\n" inh
188198 , mkBench "S.splitOnSeq \"aa\" FL.drain" env $ \inh _ ->
189199 splitOnSeq "aa" inh
190200 , mkBench "S.splitOnSeq \"aaaa\" FL.drain" env $ \inh _ ->
@@ -201,6 +211,8 @@ o_1_space_reduce_read_split env =
201211 env $ \inh _ -> splitOnSeq100k inh
202212 , mkBenchSmall "S.splitOnSuffixSeq \"abcdefghijklmnopqrstuvwxyz\" FL.drain"
203213 env $ \inh _ -> splitOnSuffixSeq "abcdefghijklmnopqrstuvwxyz" inh
214+ , mkBenchSmall "S.splitWithSuffixSeq \"abcdefghijklmnopqrstuvwxyz\" FL.drain"
215+ env $ \inh _ -> splitWithSuffixSeq "abcdefghijklmnopqrstuvwxyz" inh
204216 ]
205217 ]
206218
@@ -208,8 +220,9 @@ o_1_space_reduce_read_split env =
208220splitOnSeqUtf8 :: String -> Handle -> IO Int
209221splitOnSeqUtf8 str inh =
210222 (S.length $ IP.splitOnSeq (A.fromList str) FL.drain
223+ $ IP.fromStream
211224 $ IUS.decodeUtf8Arrays
212− $ IFH.getChunks inh) -- >>= print
225+ $ IFH.readChunks inh) -- >>= print
213226
214227o_1_space_reduce_toChunks_split :: BenchEnv -> [Benchmark]
215228o_1_space_reduce_toChunks_split env =
benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+46−5
@@ -8,6 +8,8 @@
88{-# LANGUAGE CPP #-}
99{-# LANGUAGE FlexibleContexts #-}
1010{-# LANGUAGE ScopedTypeVariables #-}
11+{-# LANGUAGE TupleSections #-}
12+{-# OPTIONS_GHC -Wno-orphans #-}
1113
1214#ifdef __HADDOCK_VERSION__
1315#undef INSPECTION
@@ -20,15 +22,19 @@
2022
2123module Main (main) where
2224
25+#if !MIN_VERSION_base(4,18,0)
26+import Control.Applicative (liftA2)
27+#endif
2328import Control.Monad (when)
2429import Data.Maybe (isJust)
25−import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
30+import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
2631import System.Random (randomRIO)
2732import Prelude hiding (tail, mapM_, foldl, last, map, mapM, concatMap, zip)
2833
2934import qualified Prelude as P
30−import qualified Streamly.Internal.Data.Stream.StreamD as S
35+import qualified Streamly.Internal.Data.Stream as S
3136import qualified Streamly.Internal.Data.Unfold as UF
37+import qualified Streamly.Internal.Data.Fold as FL
3238
3339import Streamly.Benchmark.Common
3440
@@ -125,6 +131,12 @@ uncons s = do
125131 Nothing -> return ()
126132 Just (_, t) -> uncons t
127133
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+
128140{-# INLINE tail #-}
129141tail :: Monad m => Stream m a -> m ()
130142tail s = S.tail s >>= P.mapM_ tail
@@ -314,6 +326,34 @@ filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
314326-- Nested Composition
315327-------------------------------------------------------------------------------
316328
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+
317357{-# INLINE toNullApNested #-}
318358toNullApNested :: Monad m => Stream m Int -> m ()
319359toNullApNested s = runStream $ do
@@ -409,8 +449,8 @@ unfoldManyRepl :: Int -> Int -> Int -> IO ()
409449unfoldManyRepl outer inner n =
410450 S.drain
411451 $ S.unfoldMany
412− (UF.lmap return (UF.replicateM inner))
413− (sourceUnfoldrMN outer n)
452+ UF.replicateM
453+ (S.map ((inner,) . return) (sourceUnfoldrMN outer n))
414454
415455#ifdef INSPECTION
416456inspect $ hasNoTypeClasses 'unfoldManyRepl
@@ -423,7 +463,7 @@ inspect $ 'unfoldManyRepl `hasNoType` ''SPEC
423463-------------------------------------------------------------------------------
424464
425465moduleName :: String
426−moduleName = "Data.Stream.StreamD"
466+moduleName = "Data.StreamD"
427467
428468o_1_space :: [Benchmark]
429469o_1_space =
@@ -439,6 +479,7 @@ o_1_space =
439479 [ benchFold "toNull" toNull sourceUnfoldrM
440480 , benchFold "mapM_" mapM_ sourceUnfoldrM
441481 , benchFold "uncons" uncons sourceUnfoldrM
482+ , benchFold "foldBreak" foldBreak sourceUnfoldrM
442483 , benchFold "foldl'" foldl sourceUnfoldrM
443484 , benchFold "last" last sourceUnfoldrM
444485 ]
benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs+61−33
@@ -8,6 +8,7 @@
88{-# LANGUAGE CPP #-}
99{-# LANGUAGE FlexibleContexts #-}
1010{-# LANGUAGE ScopedTypeVariables #-}
11+{-# OPTIONS_GHC -Wno-orphans #-}
1112
1213#ifdef __HADDOCK_VERSION__
1314#undef INSPECTION
@@ -20,22 +21,23 @@
2021
2122module Main (main) where
2223
24+#if !MIN_VERSION_base(4,18,0)
25+import Control.Applicative (liftA2)
26+#endif
2327import Control.Monad (when)
2428import Data.Maybe (isJust)
2529import System.Random (randomRIO)
2630import Prelude hiding
27− ( tail, mapM_, foldl, last, map, mapM, concatMap, zipWith, init, iterate
31+ ( Foldable(..), tail, mapM_, last, map, mapM, concatMap, zipWith, init, iterate
2832 , repeat, replicate
2933 )
3034
3135import qualified Prelude as P
3236import qualified Data.List as List
3337
34−import qualified Streamly.Internal.Control.Concurrent as S
35−import qualified Streamly.Internal.Data.Stream.StreamK.Type as S
36−import qualified Streamly.Internal.Data.Stream.StreamK as S
38+import qualified Streamly.Internal.Data.StreamK as S
3739
38−import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
40+import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
3941
4042import Streamly.Benchmark.Common
4143
@@ -115,7 +117,7 @@ Benchmarks that need to be added
115117-- Stream generation and elimination
116118-------------------------------------------------------------------------------
117119
118−type Stream m a = S.Stream m a
120+type Stream m a = S.StreamK m a
119121
120122{-# INLINE unfoldr #-}
121123unfoldr :: Int -> Int -> Stream m Int
@@ -127,7 +129,7 @@ unfoldr streamLen n = S.unfoldr step n
127129 else Just (cnt, cnt + 1)
128130
129131{-# INLINE unfoldrM #-}
130−unfoldrM :: S.MonadAsync m => Int -> Int -> Stream m Int
132+unfoldrM :: Monad m => Int -> Int -> Stream m Int
131133unfoldrM streamLen n = S.unfoldrMWith S.consM step n
132134 where
133135 step cnt =
@@ -140,7 +142,7 @@ repeat :: Int -> Int -> Stream m Int
140142repeat streamLen = S.take streamLen . S.repeat
141143
142144{-# INLINE repeatM #-}
143−repeatM :: S.MonadAsync m => Int -> Int -> Stream m Int
145+repeatM :: Monad m => Int -> Int -> Stream m Int
144146repeatM streamLen = S.take streamLen . S.repeatM . return
145147
146148{-# INLINE replicate #-}
@@ -148,7 +150,7 @@ replicate :: Int -> Int -> Stream m Int
148150replicate = S.replicate
149151
150152{-# INLINE replicateM #-}
151−replicateM :: S.MonadAsync m => Int -> Int -> Stream m Int
153+replicateM :: Monad m => Int -> Int -> Stream m Int
152154replicateM streamLen = S.replicateMWith S.consM streamLen . return
153155
154156{-# INLINE iterate #-}
@@ -156,7 +158,7 @@ iterate :: Int -> Int -> Stream m Int
156158iterate streamLen = S.take streamLen . S.iterate (+1)
157159
158160{-# INLINE iterateM #-}
159−iterateM :: S.MonadAsync m => Int -> Int -> Stream m Int
161+iterateM :: Monad m => Int -> Int -> Stream m Int
160162iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
161163
162164{-# INLINE fromFoldable #-}
@@ -164,26 +166,27 @@ fromFoldable :: Int -> Int -> Stream m Int
164166fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
165167
166168{-# INLINE fromFoldableM #-}
167−fromFoldableM :: S.MonadAsync m => Int -> Int -> Stream m Int
169+fromFoldableM :: Monad m => Int -> Int -> Stream m Int
168170fromFoldableM streamLen n =
169− Prelude.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
171+ List.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
170172
171173{-# INLINABLE concatMapFoldableWith #-}
172−concatMapFoldableWith :: Foldable f
174+concatMapFoldableWith :: P.Foldable f
173175 => (Stream m b -> Stream m b -> Stream m b)
174176 -> (a -> Stream m b)
175177 -> f a
176178 -> Stream m b
177−concatMapFoldableWith f g = Prelude.foldr (f . g) S.nil
179+concatMapFoldableWith f g = P.foldr (f . g) S.nil
178180
179181{-# INLINE concatMapFoldableSerial #-}
180182concatMapFoldableSerial :: Int -> Int -> Stream m Int
181−concatMapFoldableSerial streamLen n = concatMapFoldableWith S.serial S.fromPure [n..n+streamLen]
183+concatMapFoldableSerial streamLen n =
184+ concatMapFoldableWith S.append S.fromPure [n..n+streamLen]
182185
183186{-# INLINE concatMapFoldableSerialM #-}
184187concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
185188concatMapFoldableSerialM streamLen n =
186− concatMapFoldableWith S.serial (S.fromEffect . return) [n..n+streamLen]
189+ concatMapFoldableWith S.append (S.fromEffect . return) [n..n+streamLen]
187190
188191-------------------------------------------------------------------------------
189192-- Elimination
@@ -268,11 +271,11 @@ fmapK :: Monad m => Int -> Stream m Int -> m ()
268271fmapK n = composeN n $ P.fmap (+ 1)
269272
270273{-# INLINE mapM #-}
271−mapM :: S.MonadAsync m => Int -> Stream m Int -> m ()
274+mapM :: Monad m => Int -> Stream m Int -> m ()
272275mapM n = composeN n $ S.mapMWith S.consM return
273276
274277{-# INLINE mapMSerial #-}
275−mapMSerial :: S.MonadAsync m => Int -> Stream m Int -> m ()
278+mapMSerial :: Monad m => Int -> Stream m Int -> m ()
276279mapMSerial n = composeN n $ S.mapMSerial return
277280
278281{-# INLINE filterEven #-}
@@ -324,7 +327,7 @@ foldlS :: Monad m => Int -> Stream m Int -> m ()
324327foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
325328
326329{-# INLINE intersperse #-}
327−intersperse :: S.MonadAsync m => Int -> Int -> Stream m Int -> m ()
330+intersperse :: Monad m => Int -> Int -> Stream m Int -> m ()
328331intersperse streamLen n = composeN n $ S.intersperse streamLen
329332
330333-------------------------------------------------------------------------------
@@ -333,8 +336,7 @@ intersperse streamLen n = composeN n $ S.intersperse streamLen
333336
334337{-# INLINE iterateSource #-}
335338iterateSource
336− :: S.MonadAsync m
337− => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
339+ :: Monad m => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
338340iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
339341 where
340342 f (0 :: Int) m = g m
@@ -342,37 +344,37 @@ iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
342344
343345-- this is quadratic
344346{-# INLINE iterateScan #-}
345−iterateScan :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
347+iterateScan :: Monad m => Int -> Int -> Int -> Stream m Int
346348iterateScan iterStreamLen maxIters =
347349 iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
348350
349351-- this is quadratic
350352{-# INLINE iterateDropWhileFalse #-}
351−iterateDropWhileFalse :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
353+iterateDropWhileFalse :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
352354iterateDropWhileFalse streamLen iterStreamLen maxIters =
353355 iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
354356
355357{-# INLINE iterateMapM #-}
356−iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
358+iterateMapM :: Monad m => Int -> Int -> Int -> Stream m Int
357359iterateMapM iterStreamLen =
358360 iterateSource iterStreamLen (S.mapMWith S.consM return)
359361
360362{-# INLINE iterateFilterEven #-}
361−iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
363+iterateFilterEven :: Monad m => Int -> Int -> Int -> Stream m Int
362364iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
363365
364366{-# INLINE iterateTakeAll #-}
365−iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
367+iterateTakeAll :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
366368iterateTakeAll streamLen iterStreamLen =
367369 iterateSource iterStreamLen (S.take streamLen)
368370
369371{-# INLINE iterateDropOne #-}
370−iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
372+iterateDropOne :: Monad m => Int -> Int -> Int -> Stream m Int
371373iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
372374
373375{-# INLINE iterateDropWhileTrue #-}
374−iterateDropWhileTrue :: S.MonadAsync m =>
375− Int -> Int -> Int -> Int -> Stream m Int
376+iterateDropWhileTrue ::
377+ Monad m => Int -> Int -> Int -> Int -> Stream m Int
376378iterateDropWhileTrue streamLen iterStreamLen =
377379 iterateSource iterStreamLen (S.dropWhile (<= streamLen))
378380
@@ -390,7 +392,7 @@ zipWithM src = drain $ S.zipWithM (curry return) src src
390392
391393{-# INLINE sortByK #-}
392394sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
393−sortByK f = S.concatPairsWith (S.mergeBy f) S.fromPure
395+sortByK f = S.mergeMapWith (S.mergeBy f) S.fromPure
394396
395397{-# INLINE sortBy #-}
396398sortBy :: Monad m => Stream m Int -> m ()
@@ -492,7 +494,7 @@ sourceConcatMapId val n =
492494{-# INLINE concatMapBySerial #-}
493495concatMapBySerial :: Int -> Int -> Int -> IO ()
494496concatMapBySerial outer inner n =
495− S.drain $ S.concatMapWith S.serial
497+ S.drain $ S.concatMapWith S.append
496498 (unfoldrM inner)
497499 (unfoldrM outer n)
498500
@@ -500,6 +502,32 @@ concatMapBySerial outer inner n =
500502-- Nested Composition
501503-------------------------------------------------------------------------------
502504
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+
503531{-# INLINE drainApplicative #-}
504532drainApplicative :: Monad m => Stream m Int -> m ()
505533drainApplicative s = drain $ do
@@ -606,7 +634,7 @@ filterAllInNestedList str = do
606634-------------------------------------------------------------------------------
607635
608636moduleName :: String
609−moduleName = "Data.Stream.StreamK"
637+moduleName = "Data.StreamK"
610638
611639o_1_space_generation :: Int -> Benchmark
612640o_1_space_generation streamLen =
@@ -703,7 +731,7 @@ o_1_space_concat streamLen =
703731 -- This is for comparison with concatMapFoldableWith
704732 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
705733 (S.drain
706− . S.concatMapWith S.serial id
734+ . S.concatMapWith S.append id
707735 . sourceConcatMapId streamLen)
708736
709737 , benchIOSrc1 "concatMapBy serial (n of 1)"
benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs → benchmark/Streamly/Benchmark/Data/Stream/StreamKAlt.hsrenamed+5−3
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Streamly.Benchmark.Data.Stream.StreamDK
35-- Copyright : (c) 2018 Composewell Technologies
@@ -16,12 +18,12 @@ import Prelude hiding ()
1618-- import qualified Prelude as P
1719-- import qualified Data.List as List
1820
19−import qualified Streamly.Internal.Data.Stream.StreamDK as S
21+import qualified Streamly.Internal.Data.StreamK.Alt as S
2022-- import qualified Streamly.Internal.Data.Stream.Common as SP
2123-- import qualified Streamly.Internal.Data.SVar as S
2224
2325import Streamly.Benchmark.Common
24−import Gauge (bgroup, Benchmark, defaultMain)
26+import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
2527
2628value :: Int
2729value = 100000
@@ -450,4 +452,4 @@ o_1_space =
450452 ]
451453
452454main :: IO ()
453−main = defaultMain $ concat [o_1_space]
455+main = defaultMain [o_1_space]
benchmark/Streamly/Benchmark/Data/Stream/ToStreamK.hsnew file+938
@@ -0,0 +1,938 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.StreamK
3+-- Copyright : (c) 2018 Composewell Technologies
4+--
5+-- License : BSD3
6+-- Maintainer : streamly@composewell.com
7+
8+{-# LANGUAGE CPP #-}
9+{-# LANGUAGE FlexibleContexts #-}
10+{-# LANGUAGE ScopedTypeVariables #-}
11+{-# OPTIONS_GHC -Wno-orphans #-}
12+
13+#ifdef __HADDOCK_VERSION__
14+#undef INSPECTION
15+#endif
16+
17+#ifdef INSPECTION
18+{-# LANGUAGE TemplateHaskell #-}
19+{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
20+#endif
21+
22+module Main (main) where
23+
24+-- import Control.Applicative (liftA2)
25+-- import Control.Monad (when)
26+-- import Data.Maybe (isJust)
27+-- import System.Random (randomRIO)
28+import Prelude hiding
29+ ( tail, mapM_, foldl, last, map, mapM, concatMap, zipWith, init, iterate
30+ , repeat, replicate
31+ )
32+
33+import qualified Prelude as P
34+-- import qualified Data.List as List
35+
36+import qualified Streamly.Internal.Data.StreamK as S
37+import qualified Streamly.Internal.Data.Stream as D
38+import qualified Streamly.Internal.Data.Fold as Fold
39+
40+import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
41+
42+import Streamly.Benchmark.Common
43+
44+#ifdef INSPECTION
45+import Test.Inspection
46+#endif
47+
48+-------------------------------------------------------------------------------
49+-- Stream generation and elimination
50+-------------------------------------------------------------------------------
51+
52+type Stream m a = S.Stream m a
53+
54+{-# INLINE unfoldrD #-}
55+unfoldrD :: Monad m => Int -> Int -> Stream m Int
56+unfoldrD streamLen n = D.toStreamK (D.unfoldr step n)
57+ where
58+ step cnt =
59+ if cnt > n + streamLen
60+ then Nothing
61+ else Just (cnt, cnt + 1)
62+
63+{-# INLINE unfoldrMD #-}
64+unfoldrMD :: Monad m => Int -> Int -> Stream m Int
65+unfoldrMD streamLen n = D.toStreamK (D.unfoldrM step n)
66+ where
67+ step cnt =
68+ if cnt > n + streamLen
69+ then return Nothing
70+ else return (Just (cnt, cnt + 1))
71+
72+{-
73+{-# INLINE unfoldrK #-}
74+unfoldrK :: Int -> Int -> Stream m Int
75+unfoldrK streamLen n = S.unfoldr step n
76+ where
77+ step cnt =
78+ if cnt > n + streamLen
79+ then Nothing
80+ else Just (cnt, cnt + 1)
81+-}
82+
83+{-# INLINE unfoldrMK #-}
84+unfoldrMK :: Monad m => Int -> Int -> Stream m Int
85+unfoldrMK streamLen n = S.unfoldrMWith S.consM step n
86+ where
87+ step cnt =
88+ if cnt > n + streamLen
89+ then return Nothing
90+ else return (Just (cnt, cnt + 1))
91+
92+{-# INLINE repeat #-}
93+repeat :: Monad m => Int -> Int -> Stream m Int
94+repeat streamLen = S.take streamLen . D.toStreamK . D.repeat
95+
96+{-# INLINE repeatM #-}
97+repeatM :: Monad m => Int -> Int -> Stream m Int
98+repeatM streamLen = S.take streamLen . D.toStreamK . D.repeatM . return
99+
100+{-# INLINE replicate #-}
101+replicate :: Monad m => Int -> Int -> Stream m Int
102+replicate x y = D.toStreamK $ D.replicate x y
103+
104+{-# INLINE replicateM #-}
105+replicateM :: Monad m => Int -> Int -> Stream m Int
106+replicateM streamLen = D.toStreamK . D.replicateM streamLen . return
107+
108+{-# INLINE iterate #-}
109+iterate :: Monad m => Int -> Int -> Stream m Int
110+iterate streamLen = S.take streamLen . D.toStreamK . D.iterate (+1)
111+
112+{-# INLINE iterateM #-}
113+iterateM :: Monad m => Int -> Int -> Stream m Int
114+iterateM streamLen = S.take streamLen . D.toStreamK . D.iterateM (return . (+1)) . return
115+
116+{-# INLINE fromFoldable #-}
117+fromFoldable :: Int -> Int -> Stream m Int
118+fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
119+
120+{-# INLINE fromFoldableM #-}
121+fromFoldableM :: Monad m => Int -> Int -> Stream m Int
122+fromFoldableM streamLen n =
123+ Prelude.foldr (S.consM . return) S.nil [n .. n + streamLen]
124+
125+{-
126+{-# INLINABLE concatMapFoldableWith #-}
127+concatMapFoldableWith :: Foldable f
128+ => (Stream m b -> Stream m b -> Stream m b)
129+ -> (a -> Stream m b)
130+ -> f a
131+ -> Stream m b
132+concatMapFoldableWith f g = Prelude.foldr (f . g) S.nil
133+-}
134+
135+{-# INLINE concatMapFoldableSerial #-}
136+concatMapFoldableSerial :: Monad m => Int -> Int -> Stream m Int
137+concatMapFoldableSerial streamLen n =
138+ D.toStreamK $ D.concatMap D.fromPure $ D.fromStreamK $ S.fromList [n..n+streamLen]
139+
140+{-# INLINE concatMapFoldableSerialM #-}
141+concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
142+concatMapFoldableSerialM streamLen n =
143+ -- concatMapFoldableWith S.serial (S.fromEffect . return) [n..n+streamLen]
144+ D.toStreamK $ D.concatMap (D.fromEffect . return) $ D.fromStreamK $ S.fromList [n..n+streamLen]
145+
146+-------------------------------------------------------------------------------
147+-- Elimination
148+-------------------------------------------------------------------------------
149+
150+{-# INLINE drainD #-}
151+drainD :: Monad m => Stream m a -> m ()
152+drainD = D.drain . D.fromStreamK
153+
154+{-# INLINE drain #-}
155+drain :: Monad m => Stream m a -> m ()
156+drain = S.drain
157+
158+{-# INLINE mapM_ #-}
159+mapM_ :: Monad m => Stream m a -> m ()
160+mapM_ s = D.mapM_ (\_ -> return ()) $ D.fromStreamK s
161+
162+{-
163+{-# INLINE uncons #-}
164+uncons :: Monad m => Stream m Int -> m ()
165+uncons s = do
166+ r <- D.uncons $ D.fromStreamK s
167+ case r of
168+ Nothing -> return ()
169+ Just (_, t) -> uncons (D.toStreamK t)
170+
171+{-# INLINE init #-}
172+init :: Monad m => Stream m a -> m ()
173+init s = do
174+ t <- S.init s
175+ P.mapM_ S.drain t
176+
177+{-# INLINE tail #-}
178+tail :: Monad m => Stream m a -> m ()
179+tail s = S.tail s >>= P.mapM_ tail
180+
181+{-# INLINE nullTail #-}
182+nullTail :: Monad m => Stream m Int -> m ()
183+nullTail s = do
184+ r <- S.null s
185+ when (not r) $ S.tail s >>= P.mapM_ nullTail
186+
187+{-# INLINE headTail #-}
188+headTail :: Monad m => Stream m Int -> m ()
189+headTail s = do
190+ h <- S.head s
191+ when (isJust h) $ S.tail s >>= P.mapM_ headTail
192+-}
193+
194+{-# INLINE toList #-}
195+toList :: Monad m => Stream m Int -> m [Int]
196+toList = D.fold Fold.toList . D.fromStreamK
197+
198+{-# INLINE foldl' #-}
199+foldl' :: Monad m => Stream m Int -> m Int
200+foldl' = D.fold (Fold.foldl' (+) 0) . D.fromStreamK
201+
202+{-# INLINE last #-}
203+last :: Monad m => Stream m Int -> m (Maybe Int)
204+last = D.fold Fold.latest . D.fromStreamK
205+
206+-------------------------------------------------------------------------------
207+-- Transformation
208+-------------------------------------------------------------------------------
209+
210+{-# INLINE composeN #-}
211+composeN
212+ :: Monad m
213+ => Int -> (Stream m Int -> Stream m Int) -> Stream m Int -> m ()
214+composeN n f =
215+ case n of
216+ 1 -> drain . f
217+ 2 -> drain . f . f
218+ 3 -> drain . f . f . f
219+ 4 -> drain . f . f . f . f
220+ _ -> undefined
221+
222+{-# INLINE scanl' #-}
223+scanl' :: Monad m => Int -> Stream m Int -> m ()
224+scanl' n =
225+ composeN n (D.toStreamK . D.scan (Fold.foldl' (+) 0) . D.fromStreamK)
226+
227+{-# INLINE map #-}
228+map :: Monad m => Int -> Stream m Int -> m ()
229+map n = composeN n (D.toStreamK . D.map (+ 1) . D.fromStreamK)
230+
231+{-
232+{-# INLINE fmapK #-}
233+fmapK :: Monad m => Int -> Stream m Int -> m ()
234+fmapK n = composeN n $ P.fmap (+ 1)
235+-}
236+
237+{-# INLINE mapM #-}
238+mapM :: Monad m => Int -> Stream m Int -> m ()
239+mapM n = composeN n (D.toStreamK . D.mapM return . D.fromStreamK)
240+
241+{-
242+{-# INLINE mapMSerial #-}
243+mapMSerial :: S.MonadAsync m => Int -> Stream m Int -> m ()
244+mapMSerial n = composeN n $ S.mapMSerial return
245+-}
246+
247+{-# INLINE filterEven #-}
248+filterEven :: Monad m => Int -> Stream m Int -> m ()
249+filterEven n = composeN n (D.toStreamK . D.filter even . D.fromStreamK)
250+
251+{-
252+{-# INLINE filterAllOut #-}
253+filterAllOut :: Monad m => Int -> Int -> Stream m Int -> m ()
254+filterAllOut streamLen n = composeN n $ S.filter (> streamLen)
255+
256+{-# INLINE filterAllIn #-}
257+filterAllIn :: Monad m => Int -> Int -> Stream m Int -> m ()
258+filterAllIn streamLen n = composeN n $ S.filter (<= streamLen)
259+
260+{-# INLINE _takeOne #-}
261+_takeOne :: Monad m => Int -> Stream m Int -> m ()
262+_takeOne n = composeN n $ S.take 1
263+
264+{-# INLINE takeAll #-}
265+takeAll :: Monad m => Int -> Int -> Stream m Int -> m ()
266+takeAll streamLen n = composeN n $ S.take streamLen
267+
268+{-# INLINE takeWhileTrue #-}
269+takeWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
270+takeWhileTrue streamLen n = composeN n $ S.takeWhile (<= streamLen)
271+
272+{-# INLINE dropOne #-}
273+dropOne :: Monad m => Int -> Stream m Int -> m ()
274+dropOne n = composeN n $ S.drop 1
275+
276+{-# INLINE dropAll #-}
277+dropAll :: Monad m => Int -> Int -> Stream m Int -> m ()
278+dropAll streamLen n = composeN n $ S.drop streamLen
279+
280+{-# INLINE dropWhileTrue #-}
281+dropWhileTrue :: Monad m => Int -> Int -> Stream m Int -> m ()
282+dropWhileTrue streamLen n = composeN n $ S.dropWhile (<= streamLen)
283+
284+{-# INLINE dropWhileFalse #-}
285+dropWhileFalse :: Monad m => Int -> Stream m Int -> m ()
286+dropWhileFalse n = composeN n $ S.dropWhile (<= 1)
287+-}
288+
289+{-
290+{-# INLINE foldrS #-}
291+foldrS :: Monad m => Int -> Stream m Int -> m ()
292+foldrS n = composeN n $ S.foldrS S.cons S.nil
293+
294+{-# INLINE foldlS #-}
295+foldlS :: Monad m => Int -> Stream m Int -> m ()
296+foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
297+-}
298+
299+{-
300+{-# INLINE intersperse #-}
301+intersperse :: S.MonadAsync m => Int -> Int -> Stream m Int -> m ()
302+intersperse streamLen n = composeN n $ S.intersperse streamLen
303+-}
304+
305+-------------------------------------------------------------------------------
306+-- Iteration
307+-------------------------------------------------------------------------------
308+
309+{-
310+{-# INLINE iterateSource #-}
311+iterateSource
312+ :: S.MonadAsync m
313+ => Int -> (Stream m Int -> Stream m Int) -> Int -> Int -> Stream m Int
314+iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
315+ where
316+ f (0 :: Int) m = g m
317+ f x m = g (f (x P.- 1) m)
318+
319+-- this is quadratic
320+{-# INLINE iterateScan #-}
321+iterateScan :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
322+iterateScan iterStreamLen maxIters =
323+ iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
324+
325+-- this is quadratic
326+{-# INLINE iterateDropWhileFalse #-}
327+iterateDropWhileFalse :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
328+iterateDropWhileFalse streamLen iterStreamLen maxIters =
329+ iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
330+
331+{-# INLINE iterateMapM #-}
332+iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
333+iterateMapM iterStreamLen =
334+ iterateSource iterStreamLen (S.mapMWith S.consM return)
335+
336+{-# INLINE iterateFilterEven #-}
337+iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
338+iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
339+
340+{-# INLINE iterateTakeAll #-}
341+iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
342+iterateTakeAll streamLen iterStreamLen =
343+ iterateSource iterStreamLen (S.take streamLen)
344+
345+{-# INLINE iterateDropOne #-}
346+iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
347+iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
348+
349+{-# INLINE iterateDropWhileTrue #-}
350+iterateDropWhileTrue :: S.MonadAsync m =>
351+ Int -> Int -> Int -> Int -> Stream m Int
352+iterateDropWhileTrue streamLen iterStreamLen =
353+ iterateSource iterStreamLen (S.dropWhile (<= streamLen))
354+-}
355+
356+-------------------------------------------------------------------------------
357+-- Zipping
358+-------------------------------------------------------------------------------
359+
360+{-
361+{-# INLINE zipWith #-}
362+zipWith :: Monad m => Stream m Int -> m ()
363+zipWith src = drain $ S.zipWith (,) src src
364+
365+{-# INLINE zipWithM #-}
366+zipWithM :: Monad m => Stream m Int -> m ()
367+zipWithM src = drain $ S.zipWithM (curry return) src src
368+
369+{-# INLINE sortByK #-}
370+sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
371+sortByK f = S.concatPairsWith (S.mergeBy f) S.fromPure
372+
373+{-# INLINE sortBy #-}
374+sortBy :: Monad m => Stream m Int -> m ()
375+sortBy = drain . sortByK compare
376+
377+-------------------------------------------------------------------------------
378+-- Mixed Composition
379+-------------------------------------------------------------------------------
380+
381+{-# INLINE scanMap #-}
382+scanMap :: Monad m => Int -> Stream m Int -> m ()
383+scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
384+
385+{-# INLINE dropMap #-}
386+dropMap :: Monad m => Int -> Stream m Int -> m ()
387+dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
388+
389+{-# INLINE dropScan #-}
390+dropScan :: Monad m => Int -> Stream m Int -> m ()
391+dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
392+
393+{-# INLINE takeDrop #-}
394+takeDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
395+takeDrop streamLen n = composeN n $ S.drop 1 . S.take streamLen
396+
397+{-# INLINE takeScan #-}
398+takeScan :: Monad m => Int -> Int -> Stream m Int -> m ()
399+takeScan streamLen n = composeN n $ S.scanl' (+) 0 . S.take streamLen
400+
401+{-# INLINE takeMap #-}
402+takeMap :: Monad m => Int -> Int -> Stream m Int -> m ()
403+takeMap streamLen n = composeN n $ S.map (subtract 1) . S.take streamLen
404+
405+{-# INLINE filterDrop #-}
406+filterDrop :: Monad m => Int -> Int -> Stream m Int -> m ()
407+filterDrop streamLen n = composeN n $ S.drop 1 . S.filter (<= streamLen)
408+
409+{-# INLINE filterTake #-}
410+filterTake :: Monad m => Int -> Int -> Stream m Int -> m ()
411+filterTake streamLen n = composeN n $ S.take streamLen . S.filter (<= streamLen)
412+
413+{-# INLINE filterScan #-}
414+filterScan :: Monad m => Int -> Stream m Int -> m ()
415+filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
416+
417+{-# INLINE filterMap #-}
418+filterMap :: Monad m => Int -> Int -> Stream m Int -> m ()
419+filterMap streamLen n = composeN n $ S.map (subtract 1) . S.filter (<= streamLen)
420+-}
421+
422+-------------------------------------------------------------------------------
423+-- ConcatMap
424+-------------------------------------------------------------------------------
425+
426+-- concatMap unfoldrM/unfoldrM
427+
428+{-# INLINE concatMap #-}
429+concatMap :: Int -> Int -> Int -> IO ()
430+concatMap outer inner n =
431+ S.drain $ D.toStreamK $ D.concatMap
432+ (\_ -> D.fromStreamK $ unfoldrMK inner n)
433+ (D.fromStreamK $ unfoldrMK outer n)
434+
435+#ifdef INSPECTION
436+inspect $ hasNoTypeClasses 'concatMap
437+#endif
438+
439+-- concatMap unfoldr/unfoldr
440+
441+{-
442+{-# INLINE concatMapPure #-}
443+concatMapPure :: Int -> Int -> Int -> IO ()
444+concatMapPure outer inner n =
445+ S.drain $ S.concatMap
446+ (\_ -> unfoldr inner n)
447+ (unfoldr outer n)
448+
449+#ifdef INSPECTION
450+inspect $ hasNoTypeClasses 'concatMapPure
451+#endif
452+
453+-- concatMap replicate/unfoldrM
454+
455+{-# INLINE concatMapRepl #-}
456+concatMapRepl :: Int -> Int -> Int -> IO ()
457+concatMapRepl outer inner n =
458+ S.drain $ S.concatMap (S.replicate inner) (unfoldrM outer n)
459+
460+#ifdef INSPECTION
461+inspect $ hasNoTypeClasses 'concatMapRepl
462+#endif
463+
464+-- concatMapWith
465+
466+{-# INLINE sourceConcatMapId #-}
467+sourceConcatMapId :: Monad m
468+ => Int -> Int -> Stream m (Stream m Int)
469+sourceConcatMapId val n =
470+ S.fromFoldable $ fmap (S.fromEffect . return) [n..n+val]
471+
472+{-# INLINE concatMapBySerial #-}
473+concatMapBySerial :: Int -> Int -> Int -> IO ()
474+concatMapBySerial outer inner n =
475+ S.drain $ S.concatMapWith S.serial
476+ (unfoldrM inner)
477+ (unfoldrM outer n)
478+-}
479+
480+{-
481+-------------------------------------------------------------------------------
482+-- Nested Composition
483+-------------------------------------------------------------------------------
484+
485+instance Monad m => Applicative (S.Stream m) where
486+ {-# INLINE pure #-}
487+ pure = S.fromPure
488+
489+ {-# INLINE (<*>) #-}
490+ (<*>) = S.crossApply
491+
492+ {-# INLINE liftA2 #-}
493+ liftA2 f x = (<*>) (fmap f x)
494+
495+ {-# INLINE (*>) #-}
496+ (*>) = S.crossApplySnd
497+
498+ {-# INLINE (<*) #-}
499+ (<*) = S.crossApplyFst
500+
501+-- NOTE: even though concatMap for StreamD is 3x faster compared to StreamK,
502+-- the monad instance of StreamD is slower than StreamK after foldr/build
503+-- fusion.
504+instance Monad m => Monad (S.Stream m) where
505+ {-# INLINE return #-}
506+ return = pure
507+
508+ {-# INLINE (>>=) #-}
509+ (>>=) = flip S.concatMap
510+
511+{-# INLINE drainApplicative #-}
512+drainApplicative :: Monad m => Stream m Int -> m ()
513+drainApplicative s = drain $ do
514+ (+) <$> s <*> s
515+
516+{-# INLINE drainMonad #-}
517+drainMonad :: Monad m => Stream m Int -> m ()
518+drainMonad s = drain $ do
519+ x <- s
520+ y <- s
521+ return $ x + y
522+
523+{-# INLINE drainMonad3 #-}
524+drainMonad3 :: Monad m => Stream m Int -> m ()
525+drainMonad3 s = drain $ do
526+ x <- s
527+ y <- s
528+ z <- s
529+ return $ x + y + z
530+
531+{-# INLINE filterAllOutMonad #-}
532+filterAllOutMonad
533+ :: Monad m
534+ => Stream m Int -> m ()
535+filterAllOutMonad str = drain $ do
536+ x <- str
537+ y <- str
538+ let s = x + y
539+ if s < 0
540+ then return s
541+ else S.nil
542+
543+{-# INLINE filterAllInMonad #-}
544+filterAllInMonad
545+ :: Monad m
546+ => Stream m Int -> m ()
547+filterAllInMonad str = drain $ do
548+ x <- str
549+ y <- str
550+ let s = x + y
551+ if s > 0
552+ then return s
553+ else S.nil
554+
555+-------------------------------------------------------------------------------
556+-- Nested Composition Pure lists
557+-------------------------------------------------------------------------------
558+
559+-- There are several list benchmarks here for comparison with lists. It is easy
560+-- and convenient to see the comparisons when they are here, otherwise we'll
561+-- have to add a separate module for list benchmarks with the same names and
562+-- then add a comparison in bench.sh.
563+
564+{-# INLINE unfoldrList #-}
565+unfoldrList :: Int -> Int -> [Int]
566+unfoldrList maxval n = List.unfoldr step n
567+ where
568+ step cnt =
569+ if cnt > n + maxval
570+ then Nothing
571+ else Just (cnt, cnt + 1)
572+
573+{-# INLINE toNullApNestedList #-}
574+toNullApNestedList :: [Int] -> [Int]
575+toNullApNestedList s = (+) <$> s <*> s
576+
577+{-# INLINE toNullNestedList #-}
578+toNullNestedList :: [Int] -> [Int]
579+toNullNestedList s = do
580+ x <- s
581+ y <- s
582+ return $ x + y
583+
584+{-# INLINE toNullNestedList3 #-}
585+toNullNestedList3 :: [Int] -> [Int]
586+toNullNestedList3 s = do
587+ x <- s
588+ y <- s
589+ z <- s
590+ return $ x + y + z
591+
592+{-# INLINE filterAllOutNestedList #-}
593+filterAllOutNestedList :: [Int] -> [Int]
594+filterAllOutNestedList str = do
595+ x <- str
596+ y <- str
597+ let s = x + y
598+ if s < 0
599+ then return s
600+ else []
601+
602+{-# INLINE filterAllInNestedList #-}
603+filterAllInNestedList :: [Int] -> [Int]
604+filterAllInNestedList str = do
605+ x <- str
606+ y <- str
607+ let s = x + y
608+ if s > 0
609+ then return s
610+ else []
611+ -}
612+
613+-------------------------------------------------------------------------------
614+-- Benchmarks
615+-------------------------------------------------------------------------------
616+
617+moduleName :: String
618+moduleName = "Data.Stream.ToStreamK"
619+
620+-- Generation of StreamK using StreamD generation functions and eleminating
621+-- using StreamK drain.
622+o_1_space_generation :: Int -> Benchmark
623+o_1_space_generation streamLen =
624+ bgroup "generation"
625+ [ benchFold "unfoldr" drain (unfoldrD streamLen)
626+ , benchFold "unfoldrM" drain (unfoldrMD streamLen)
627+ , benchFold "repeat" drain (repeat streamLen)
628+ , benchFold "repeatM" drain (repeatM streamLen)
629+ , benchFold "replicate" drain (replicate streamLen)
630+ , benchFold "replicateM" drain (replicateM streamLen)
631+ , benchFold "iterate" drain (iterate streamLen)
632+ , benchFold "iterateM" drain (iterateM streamLen)
633+
634+ , benchFold "fromFoldable" drain (fromFoldable streamLen)
635+ , benchFold "fromFoldableM" drain (fromFoldableM streamLen)
636+
637+ -- appends
638+ , benchFold "concatMapFoldableWith" drain (concatMapFoldableSerial streamLen)
639+ , benchFold "concatMapFoldableWithM" drain (concatMapFoldableSerialM streamLen)
640+ ]
641+
642+-- Generating using StreamK and eliminating using StreamD folds.
643+o_1_space_elimination :: Int -> Benchmark
644+o_1_space_elimination streamLen =
645+ bgroup "elimination"
646+ [ benchFold "toNull" drainD (unfoldrMK streamLen)
647+ , benchFold "mapM_" mapM_ (unfoldrMK streamLen)
648+ -- , benchFold "uncons" uncons (unfoldrMK streamLen)
649+ -- , benchFold "init" init (unfoldrM streamLen)
650+ , benchFold "foldl'" foldl' (unfoldrMK streamLen)
651+ , benchFold "last" last (unfoldrMK streamLen)
652+ ]
653+
654+{-
655+o_1_space_nested :: Int -> Benchmark
656+o_1_space_nested streamLen =
657+ bgroup "nested"
658+ [ benchFold "drainApplicative" drainApplicative (unfoldrM streamLen2)
659+ , benchFold "drainMonad" drainMonad (unfoldrM streamLen2)
660+ , benchFold "drainMonad3" drainMonad3 (unfoldrM streamLen3)
661+ , benchFold "filterAllInMonad" filterAllInMonad (unfoldrM streamLen2)
662+ , benchFold "filterAllOutMonad" filterAllOutMonad (unfoldrM streamLen2)
663+ , benchFold "drainApplicative (pure)" drainApplicative (unfoldr streamLen2)
664+ , benchFold "drainMonad (pure)" drainMonad (unfoldr streamLen2)
665+ , benchFold "drainMonad3 (pure)" drainMonad3 (unfoldr streamLen3)
666+ , benchFold "filterAllInMonad (pure)" filterAllInMonad (unfoldr streamLen2)
667+ , benchFold "filterAllOutMonad (pure)" filterAllOutMonad (unfoldr streamLen2)
668+ ]
669+ where
670+ streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
671+ streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
672+-}
673+
674+-- Generate using StreamK and transform using StreamD transformation functions
675+-- and then drain using StreamK.
676+o_1_space_transformation :: Int -> Benchmark
677+o_1_space_transformation streamLen =
678+ bgroup "transformation"
679+ [ -- benchFold "foldrS" (foldrS 1) (unfoldrM streamLen)
680+ benchFold "scanl'" (scanl' 1) (unfoldrMK streamLen)
681+ , benchFold "map" (map 1) (unfoldrMK streamLen)
682+ -- , benchFold "fmap" (fmapK 1) (unfoldrM streamLen)
683+ , benchFold "mapM" (mapM 1) (unfoldrMK streamLen)
684+ -- , benchFold "mapMSerial" (mapMSerial 1) (unfoldrM streamLen)
685+ ]
686+
687+o_1_space_transformationX4 :: Int -> Benchmark
688+o_1_space_transformationX4 streamLen =
689+ bgroup "transformationX4"
690+ [ benchFold "scanl'" (scanl' 4) (unfoldrMK streamLen)
691+ , benchFold "map" (map 4) (unfoldrMK streamLen)
692+ -- , benchFold "fmap" (fmapK 4) (unfoldrMK streamLen)
693+ , benchFold "mapM" (mapM 4) (unfoldrMK streamLen)
694+ -- , benchFold "mapMSerial" (mapMSerial 4) (unfoldrM streamLen)
695+ -- XXX this is horribly slow
696+ -- , benchFold "concatMap" (concatMap 4) (unfoldrM streamLen16)
697+ ]
698+
699+-- Generate using K, fold using K, concat using D.concatMap
700+o_1_space_concat :: Int -> Benchmark
701+o_1_space_concat streamLen =
702+ bgroup "concat"
703+ [ {- benchIOSrc1 "concatMapPure (n of 1)"
704+ (concatMapPure streamLen 1)
705+ , benchIOSrc1 "concatMapPure (sqrt n of sqrt n)"
706+ (concatMapPure streamLen2 streamLen2)
707+ , benchIOSrc1 "concatMapPure (1 of n)"
708+ (concatMapPure 1 streamLen)
709+ -}
710+
711+ benchIOSrc1 "concatMap (n of 1)"
712+ (concatMap streamLen 1)
713+ , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
714+ (concatMap streamLen2 streamLen2)
715+ , benchIOSrc1 "concatMap (1 of n)"
716+ (concatMap 1 streamLen)
717+
718+{-
719+ , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
720+ (concatMapRepl streamLen2 streamLen2)
721+
722+ -- This is for comparison with concatMapFoldableWith
723+ , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
724+ (S.drain
725+ . S.concatMapWith S.serial id
726+ . sourceConcatMapId streamLen)
727+
728+ , benchIOSrc1 "concatMapBy serial (n of 1)"
729+ (concatMapBySerial streamLen 1)
730+ , benchIOSrc1 "concatMapBy serial (sqrt n of sqrt n)"
731+ (concatMapBySerial streamLen2 streamLen2)
732+ , benchIOSrc1 "concatMapBy serial (1 of n)"
733+ (concatMapBySerial 1 streamLen)
734+ , benchFold "sortBy" sortBy (unfoldrM streamLen)
735+ -}
736+ ]
737+ where
738+ streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
739+
740+o_1_space_filtering :: Int -> Benchmark
741+o_1_space_filtering streamLen =
742+ bgroup "filtering"
743+ [ benchFold "filter-even" (filterEven 1) (unfoldrMK streamLen)
744+ {-
745+ , benchFold "filter-all-out" (filterAllOut streamLen 1) (unfoldrM streamLen)
746+ , benchFold "filter-all-in" (filterAllIn streamLen 1) (unfoldrM streamLen)
747+ , benchFold "take-all" (takeAll streamLen 1) (unfoldrM streamLen)
748+ , benchFold "takeWhile-true" (takeWhileTrue streamLen 1) (unfoldrM streamLen)
749+ , benchFold "drop-one" (dropOne 1) (unfoldrM streamLen)
750+ , benchFold "drop-all" (dropAll streamLen 1) (unfoldrM streamLen)
751+ , benchFold "dropWhile-true" (dropWhileTrue streamLen 1) (unfoldrM streamLen)
752+ , benchFold "dropWhile-false" (dropWhileFalse 1) (unfoldrM streamLen)
753+ -}
754+ ]
755+
756+o_1_space_filteringX4 :: Int -> Benchmark
757+o_1_space_filteringX4 streamLen =
758+ bgroup "filteringX4"
759+ [ benchFold "filter-even" (filterEven 4) (unfoldrMK streamLen)
760+ {-
761+ , benchFold "filter-all-out" (filterAllOut streamLen 4) (unfoldrM streamLen)
762+ , benchFold "filter-all-in" (filterAllIn streamLen 4) (unfoldrM streamLen)
763+ , benchFold "take-all" (takeAll streamLen 4) (unfoldrM streamLen)
764+ , benchFold "takeWhile-true" (takeWhileTrue streamLen 4) (unfoldrM streamLen)
765+ , benchFold "drop-one" (dropOne 4) (unfoldrM streamLen)
766+ , benchFold "drop-all" (dropAll streamLen 4) (unfoldrM streamLen)
767+ , benchFold "dropWhile-true" (dropWhileTrue streamLen 4) (unfoldrM streamLen)
768+ , benchFold "dropWhile-false" (dropWhileFalse 4) (unfoldrM streamLen)
769+ -}
770+ ]
771+
772+{-
773+o_1_space_zipping :: Int -> Benchmark
774+o_1_space_zipping streamLen =
775+ bgroup "zipping"
776+ [ benchFold "zipWith" zipWith (unfoldrM streamLen)
777+ , benchFold "zipWithM" zipWithM (unfoldrM streamLen)
778+ ]
779+
780+o_1_space_mixed :: Int -> Benchmark
781+o_1_space_mixed streamLen =
782+ bgroup "mixed"
783+ [ benchFold "scan-map" (scanMap 1) (unfoldrM streamLen)
784+ , benchFold "drop-map" (dropMap 1) (unfoldrM streamLen)
785+ , benchFold "drop-scan" (dropScan 1) (unfoldrM streamLen)
786+ , benchFold "take-drop" (takeDrop streamLen 1) (unfoldrM streamLen)
787+ , benchFold "take-scan" (takeScan streamLen 1) (unfoldrM streamLen)
788+ , benchFold "take-map" (takeMap streamLen 1) (unfoldrM streamLen)
789+ , benchFold "filter-drop" (filterDrop streamLen 1) (unfoldrM streamLen)
790+ , benchFold "filter-take" (filterTake streamLen 1) (unfoldrM streamLen)
791+ , benchFold "filter-scan" (filterScan 1) (unfoldrM streamLen)
792+ , benchFold "filter-map" (filterMap streamLen 1) (unfoldrM streamLen)
793+ ]
794+
795+o_1_space_mixedX2 :: Int -> Benchmark
796+o_1_space_mixedX2 streamLen =
797+ bgroup "mixedX2"
798+ [ benchFold "scan-map" (scanMap 2) (unfoldrM streamLen)
799+ , benchFold "drop-map" (dropMap 2) (unfoldrM streamLen)
800+ , benchFold "drop-scan" (dropScan 2) (unfoldrM streamLen)
801+ , benchFold "take-drop" (takeDrop streamLen 2) (unfoldrM streamLen)
802+ , benchFold "take-scan" (takeScan streamLen 2) (unfoldrM streamLen)
803+ , benchFold "take-map" (takeMap streamLen 2) (unfoldrM streamLen)
804+ , benchFold "filter-drop" (filterDrop streamLen 2) (unfoldrM streamLen)
805+ , benchFold "filter-take" (filterTake streamLen 2) (unfoldrM streamLen)
806+ , benchFold "filter-scan" (filterScan 2) (unfoldrM streamLen)
807+ , benchFold "filter-map" (filterMap streamLen 2) (unfoldrM streamLen)
808+ ]
809+
810+o_1_space_mixedX4 :: Int -> Benchmark
811+o_1_space_mixedX4 streamLen =
812+ bgroup "mixedX4"
813+ [ benchFold "scan-map" (scanMap 4) (unfoldrM streamLen)
814+ , benchFold "drop-map" (dropMap 4) (unfoldrM streamLen)
815+ , benchFold "drop-scan" (dropScan 4) (unfoldrM streamLen)
816+ , benchFold "take-drop" (takeDrop streamLen 4) (unfoldrM streamLen)
817+ , benchFold "take-scan" (takeScan streamLen 4) (unfoldrM streamLen)
818+ , benchFold "take-map" (takeMap streamLen 4) (unfoldrM streamLen)
819+ , benchFold "filter-drop" (filterDrop streamLen 4) (unfoldrM streamLen)
820+ , benchFold "filter-take" (filterTake streamLen 4) (unfoldrM streamLen)
821+ , benchFold "filter-scan" (filterScan 4) (unfoldrM streamLen)
822+ , benchFold "filter-map" (filterMap streamLen 4) (unfoldrM streamLen)
823+ ]
824+ -}
825+
826+{-
827+o_1_space_list :: Int -> Benchmark
828+o_1_space_list streamLen =
829+ bgroup "list"
830+ [ bgroup "elimination"
831+ [ benchList "last" (\xs -> [List.last xs]) (unfoldrList streamLen)
832+ ]
833+ , bgroup "nested"
834+ [ benchList "toNullAp" toNullApNestedList (unfoldrList streamLen2)
835+ , benchList "toNull" toNullNestedList (unfoldrList streamLen2)
836+ , benchList "toNull3" toNullNestedList3 (unfoldrList streamLen3)
837+ , benchList "filterAllIn" filterAllInNestedList (unfoldrList streamLen2)
838+ , benchList "filterAllOut" filterAllOutNestedList (unfoldrList streamLen2)
839+ ]
840+ ]
841+ where
842+
843+ streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
844+ streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
845+-}
846+
847+o_1_space :: Int -> Benchmark
848+o_1_space streamLen =
849+ bgroup (o_1_space_prefix moduleName)
850+ [ o_1_space_generation streamLen
851+ , o_1_space_elimination streamLen
852+ -- , o_1_space_nested streamLen
853+ , o_1_space_transformation streamLen
854+ , o_1_space_transformationX4 streamLen
855+ , o_1_space_concat streamLen
856+ , o_1_space_filtering streamLen
857+ , o_1_space_filteringX4 streamLen
858+ -- , o_1_space_zipping streamLen
859+ -- , o_1_space_mixed streamLen
860+ -- , o_1_space_mixedX2 streamLen
861+ -- , o_1_space_mixedX4 streamLen
862+ -- , o_1_space_list streamLen
863+ ]
864+
865+{-
866+o_n_heap :: Int -> Benchmark
867+o_n_heap streamLen =
868+ bgroup (o_n_heap_prefix moduleName)
869+ [ bgroup "transformation"
870+ [ benchFold "foldlS" (foldlS 1) (unfoldrM streamLen)
871+ ]
872+ ]
873+
874+{-# INLINE benchK #-}
875+benchK :: P.String -> (Int -> Stream P.IO Int) -> Benchmark
876+benchK name f = bench name $ nfIO $ randomRIO (1,1) >>= drain . f
877+
878+o_n_stack :: Int -> Int -> Int -> Benchmark
879+o_n_stack streamLen iterStreamLen maxIters =
880+ bgroup (o_n_stack_prefix moduleName)
881+ [ bgroup "elimination"
882+ [ benchFold "tail" tail (unfoldrM streamLen)
883+ , benchFold "nullTail" nullTail (unfoldrM streamLen)
884+ , benchFold "headTail" headTail (unfoldrM streamLen)
885+ ]
886+ , bgroup "transformation"
887+ [
888+ -- XXX why do these need so much stack
889+ benchFold "intersperse" (intersperse streamLen 1) (unfoldrM streamLen2)
890+ , benchFold "interspersePure" (intersperse streamLen 1) (unfoldr streamLen2)
891+ ]
892+ , bgroup "transformationX4"
893+ [
894+ benchFold "intersperse" (intersperse streamLen 4) (unfoldrM streamLen16)
895+ ]
896+ , bgroup "iterated"
897+ [ benchK "mapM" (iterateMapM iterStreamLen maxIters)
898+ , benchK "scan(1/10)" (iterateScan iterStreamLen maxIters)
899+ , benchK "filterEven" (iterateFilterEven iterStreamLen maxIters)
900+ , benchK "takeAll" (iterateTakeAll streamLen iterStreamLen maxIters)
901+ , benchK "dropOne" (iterateDropOne iterStreamLen maxIters)
902+ , benchK "dropWhileFalse(1/10)" (iterateDropWhileFalse streamLen iterStreamLen maxIters)
903+ , benchK "dropWhileTrue" (iterateDropWhileTrue streamLen iterStreamLen maxIters)
904+ ]
905+ ]
906+ where
907+ streamLen2 = round (P.fromIntegral streamLen**(1/2::P.Double)) -- double nested loop
908+ streamLen16 = round (P.fromIntegral streamLen**(1/16::P.Double)) -- triple nested loop
909+-}
910+
911+o_n_space :: Int -> Benchmark
912+o_n_space streamLen =
913+ bgroup (o_n_space_prefix moduleName)
914+ [ bgroup "elimination"
915+ [ benchFold "toList" toList (unfoldrMK streamLen)
916+ ]
917+ ]
918+
919+{-
920+{-# INLINE benchList #-}
921+benchList :: P.String -> ([Int] -> [Int]) -> (Int -> [Int]) -> Benchmark
922+benchList name run f = bench name $ nfIO $ randomRIO (1,1) >>= return . run . f
923+-}
924+
925+main :: IO ()
926+main =
927+ defaultMain
928+ [ o_1_space streamLen
929+ -- , o_n_stack streamLen iterStreamLen maxIters
930+ -- , o_n_heap streamLen
931+ , o_n_space streamLen
932+ ]
933+
934+ where
935+
936+ streamLen = 100000
937+ -- maxIters = 10000
938+ -- iterStreamLen = 10
benchmark/Streamly/Benchmark/Prelude/Serial/Transformation.hs → benchmark/Streamly/Benchmark/Data/Stream/Transform.hsrenamed+284−173
@@ -1,14 +1,20 @@
11-- |
2−-- Module : Serial.Transformation
2+-- Module : Stream.Transform
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 #-}
910{-# LANGUAGE ScopedTypeVariables #-}
1011{-# LANGUAGE RankNTypes #-}
1112
13+{-# OPTIONS_GHC -Wno-orphans #-}
14+#ifdef USE_PRELUDE
15+{-# OPTIONS_GHC -Wno-deprecations #-}
16+#endif
17+
1218#ifdef __HADDOCK_VERSION__
1319#undef INSPECTION
1420#endif
@@ -18,31 +24,48 @@
1824{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
1925#endif
2026
21−module Serial.Transformation (benchmarks) where
27+module Stream.Transform (benchmarks) where
2228
23−import Control.DeepSeq (NFData(..))
2429import Control.Monad.IO.Class (MonadIO(..))
25−import Data.Functor.Identity (Identity)
26−import Data.IORef (newIORef, modifyIORef')
27−import System.Random (randomRIO)
2830
29−#ifdef INSPECTION
30−import Test.Inspection
31−#endif
31+import System.Random (randomRIO)
3232
33−import qualified Streamly.Prelude as S
34−import qualified Streamly.Internal.Data.Stream.Serial as Serial
35−import qualified Streamly.Internal.Data.Stream.IsStream as Internal
3633import qualified Streamly.Internal.Data.Fold as FL
34+
35+import qualified Stream.Common as Common
3736import 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(..))
3854import 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
3960
40−import Gauge
41−import Streamly.Prelude (SerialT, fromSerial, MonadAsync)
61+import Test.Tasty.Bench
62+import Stream.Common hiding (scanl')
4263import Streamly.Benchmark.Common
43−import Streamly.Benchmark.Prelude
44−import Streamly.Internal.Data.Time.Units
45−import Prelude hiding (sequence, mapM, fmap)
64+import Prelude hiding (sequence, mapM)
65+
66+#ifdef USE_PRELUDE
67+type Stream = Stream.SerialT
68+#endif
4669
4770-------------------------------------------------------------------------------
4871-- Pipelines (stream-to-stream transformations)
@@ -56,28 +79,36 @@ import Prelude hiding (sequence, mapM, fmap)
5679-- Traversable Instance
5780-------------------------------------------------------------------------------
5881
82+#ifdef USE_STREAMK
5983{-# INLINE traversableTraverse #-}
60−traversableTraverse :: SerialT Identity Int -> IO (SerialT Identity Int)
84+traversableTraverse :: StreamK Identity Int -> IO (StreamK Identity Int)
6185traversableTraverse = traverse return
6286
6387{-# INLINE traversableSequenceA #-}
64−traversableSequenceA :: SerialT Identity Int -> IO (SerialT Identity Int)
88+traversableSequenceA :: StreamK Identity Int -> IO (StreamK Identity Int)
6589traversableSequenceA = sequenceA . Prelude.fmap return
6690
6791{-# INLINE traversableMapM #-}
68−traversableMapM :: SerialT Identity Int -> IO (SerialT Identity Int)
92+traversableMapM :: StreamK Identity Int -> IO (StreamK Identity Int)
6993traversableMapM = Prelude.mapM return
7094
7195{-# INLINE traversableSequence #-}
72−traversableSequence :: SerialT Identity Int -> IO (SerialT Identity Int)
96+traversableSequence :: StreamK Identity Int -> IO (StreamK Identity Int)
7397traversableSequence = Prelude.sequence . Prelude.fmap return
7498
7599{-# INLINE benchPureSinkIO #-}
76100benchPureSinkIO
77101 :: NFData b
78− => Int -> String -> (SerialT Identity Int -> IO b) -> Benchmark
102+ => Int -> String -> (StreamK Identity Int -> IO b) -> Benchmark
79103benchPureSinkIO value name f =
80− bench name $ nfIO $ randomRIO (1, 1) >>= f . sourceUnfoldr value
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)
81112
82113o_n_space_traversable :: Int -> [Benchmark]
83114o_n_space_traversable value =
@@ -90,113 +121,124 @@ o_n_space_traversable value =
90121 , benchPureSinkIO value "sequence" traversableSequence
91122 ]
92123 ]
124+#endif
93125
94126-------------------------------------------------------------------------------
95127-- maps and scans
96128-------------------------------------------------------------------------------
97129
130+#ifdef USE_PRELUDE
98131{-# INLINE scanl' #-}
99−scanl' :: MonadIO m => Int -> SerialT m Int -> m ()
100−scanl' n = composeN n $ S.scanl' (+) 0
132+scanl' :: MonadIO m => Int -> Stream m Int -> m ()
133+scanl' n = composeN n $ Stream.scanl' (+) 0
101134
102135{-# INLINE scanlM' #-}
103−scanlM' :: MonadIO m => Int -> SerialT m Int -> m ()
104−scanlM' n = composeN n $ S.scanlM' (\b a -> return $ b + a) (return 0)
136+scanlM' :: MonadIO m => Int -> Stream m Int -> m ()
137+scanlM' n = composeN n $ Stream.scanlM' (\b a -> return $ b + a) (return 0)
105138
106139{-# INLINE scanl1' #-}
107−scanl1' :: MonadIO m => Int -> SerialT m Int -> m ()
108−scanl1' n = composeN n $ S.scanl1' (+)
140+scanl1' :: MonadIO m => Int -> Stream m Int -> m ()
141+scanl1' n = composeN n $ Stream.scanl1' (+)
109142
110143{-# INLINE scanl1M' #-}
111−scanl1M' :: MonadIO m => Int -> SerialT m Int -> m ()
112−scanl1M' n = composeN n $ S.scanl1M' (\b a -> return $ b + a)
144+scanl1M' :: MonadIO m => Int -> Stream m Int -> m ()
145+scanl1M' n = composeN n $ Stream.scanl1M' (\b a -> return $ b + a)
146+#endif
113147
114148{-# INLINE scan #-}
115−scan :: MonadIO m => Int -> SerialT m Int -> m ()
116−scan n = composeN n $ S.scan FL.sum
149+scan :: MonadIO m => Int -> Stream m Int -> m ()
150+scan n = composeN n $ Stream.scan FL.sum
117151
152+#ifdef USE_PRELUDE
118153{-# INLINE postscanl' #-}
119−postscanl' :: MonadIO m => Int -> SerialT m Int -> m ()
120−postscanl' n = composeN n $ S.postscanl' (+) 0
154+postscanl' :: MonadIO m => Int -> Stream m Int -> m ()
155+postscanl' n = composeN n $ Stream.postscanl' (+) 0
121156
122157{-# INLINE postscanlM' #-}
123−postscanlM' :: MonadIO m => Int -> SerialT m Int -> m ()
124−postscanlM' n = composeN n $ S.postscanlM' (\b a -> return $ b + a) (return 0)
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
125161
126162{-# INLINE postscan #-}
127−postscan :: MonadIO m => Int -> SerialT m Int -> m ()
128−postscan n = composeN n $ S.postscan FL.sum
163+postscan :: MonadIO m => Int -> Stream m Int -> m ()
164+postscan n = composeN n $ Stream.postscan FL.sum
129165
130166{-# INLINE sequence #-}
131−sequence ::
132− (S.IsStream t, S.MonadAsync m)
133− => (t m Int -> S.SerialT m Int)
134− -> t m (m Int)
135− -> m ()
136−sequence t = S.drain . t . S.sequence
167+sequence :: MonadAsync m => Stream m (m Int) -> m ()
168+sequence = Common.drain . Stream.sequence
137169
138170{-# INLINE tap #-}
139−tap :: MonadIO m => Int -> SerialT m Int -> m ()
140−tap n = composeN n $ S.tap FL.sum
141−
142−{-# INLINE tapRate #-}
143−tapRate :: Int -> SerialT IO Int -> IO ()
144−tapRate n str = do
145− cref <- newIORef 0
146− composeN n (Internal.tapRate 1 (\c -> modifyIORef' cref (c +))) str
171+tap :: MonadIO m => Int -> Stream m Int -> m ()
172+tap n = composeN n $ Stream.tap FL.sum
147173
174+#ifdef USE_PRELUDE
148175{-# INLINE pollCounts #-}
149−pollCounts :: Int -> SerialT IO Int -> IO ()
176+pollCounts :: Int -> Stream IO Int -> IO ()
150177pollCounts n =
151− composeN n (Internal.pollCounts (const True) f FL.drain)
178+ composeN n (Stream.pollCounts (const True) f)
152179
153180 where
154181
155− f = Internal.rollingMap2 (-) . Internal.delayPost 1
182+ f = Stream.drain . Stream.rollingMap2 (-) . Stream.delayPost 1
156183
157184{-# INLINE timestamped #-}
158−timestamped :: (S.MonadAsync m) => SerialT m Int -> m ()
159−timestamped = S.drain . Internal.timestamped
185+timestamped :: (MonadAsync m) => Stream m Int -> m ()
186+timestamped = Stream.drain . Stream.timestamped
187+#endif
160188
189+#ifdef USE_STREAMK
161190{-# INLINE foldrS #-}
162−foldrS :: MonadIO m => Int -> SerialT m Int -> m ()
163−foldrS n = composeN n $ Internal.foldrS S.cons S.nil
191+foldrS :: MonadIO m => Int -> Stream m Int -> m ()
192+foldrS n =
193+ composeN n (toStream . StreamK.foldrS StreamK.cons StreamK.nil . fromStream)
164194
165195{-# INLINE foldrSMap #-}
166−foldrSMap :: MonadIO m => Int -> SerialT m Int -> m ()
167−foldrSMap n = composeN n $ Internal.foldrS (\x xs -> x + 1 `S.cons` xs) S.nil
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
168204
205+{-
169206{-# INLINE foldrT #-}
170−foldrT :: MonadIO m => Int -> SerialT m Int -> m ()
171−foldrT n = composeN n $ Internal.foldrT S.cons S.nil
207+foldrT :: MonadIO m => Int -> Stream m Int -> m ()
208+foldrT n = composeN n (unCrossStream . Stream.foldrT cns (CrossStream Stream.nil))
172209
173−{-# INLINE foldrTMap #-}
174−foldrTMap :: MonadIO m => Int -> SerialT m Int -> m ()
175−foldrTMap n = composeN n $ Internal.foldrT (\x xs -> x + 1 `S.cons` xs) S.nil
210+ where cns x (CrossStream xs) = CrossStream (Stream.cons x xs)
176211
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+-}
177216
178217{-# INLINE trace #-}
179−trace :: MonadAsync m => Int -> SerialT m Int -> m ()
180−trace n = composeN n $ Internal.trace return
218+trace :: MonadAsync m => Int -> Stream m Int -> m ()
219+trace n = composeN n $ Stream.trace return
181220
182221o_1_space_mapping :: Int -> [Benchmark]
183222o_1_space_mapping value =
184223 [ bgroup
185224 "mapping"
186225 [
226+#ifdef USE_STREAMK
187227 -- Right folds
188228 benchIOSink value "foldrS" (foldrS 1)
189229 , benchIOSink value "foldrSMap" (foldrSMap 1)
190− , benchIOSink value "foldrT" (foldrT 1)
191− , benchIOSink value "foldrTMap" (foldrTMap 1)
230+ ,
231+#endif
232+ -- , benchIOSink value "foldrT" (foldrT 1)
233+ -- , benchIOSink value "foldrTMap" (foldrTMap 1)
192234
193235 -- Mapping
194− , benchIOSink value "map" (mapN fromSerial 1)
236+ benchIOSink value "map" (mapN 1)
195237 , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
196− sequence fromSerial (sourceUnfoldrAction value n)
197− , benchIOSink value "mapM" (mapM fromSerial 1)
238+ sequence (sourceUnfoldrAction value n)
239+ , benchIOSink value "mapM" (mapM 1)
198240 , benchIOSink value "tap" (tap 1)
199− , benchIOSink value "tapRate 1 second" (tapRate 1)
241+#ifdef USE_PRELUDE
200242 , benchIOSink value "pollCounts 1 second" (pollCounts 1)
201243 , benchIOSink value "timestamped" timestamped
202244
@@ -207,7 +249,7 @@ o_1_space_mapping value =
207249 , benchIOSink value "scanl1M'" (scanl1M' 1)
208250 , benchIOSink value "postscanl'" (postscanl' 1)
209251 , benchIOSink value "postscanlM'" (postscanlM' 1)
210−
252+#endif
211253 , benchIOSink value "scan" (scan 1)
212254 , benchIOSink value "postscan" (postscan 1)
213255 ]
@@ -216,36 +258,37 @@ o_1_space_mapping value =
216258o_1_space_mappingX4 :: Int -> [Benchmark]
217259o_1_space_mappingX4 value =
218260 [ bgroup "mappingX4"
219− [ benchIOSink value "map" (mapN fromSerial 4)
220− , benchIOSink value "mapM" (mapM fromSerial 4)
261+ [ benchIOSink value "map" (mapN 4)
262+ , benchIOSink value "mapM" (mapM 4)
221263 , benchIOSink value "trace" (trace 4)
222264
265+#ifdef USE_PRELUDE
223266 , benchIOSink value "scanl'" (scanl' 4)
224267 , benchIOSink value "scanl1'" (scanl1' 4)
225268 , benchIOSink value "scanlM'" (scanlM' 4)
226269 , benchIOSink value "scanl1M'" (scanl1M' 4)
227270 , benchIOSink value "postscanl'" (postscanl' 4)
228271 , benchIOSink value "postscanlM'" (postscanlM' 4)
229−
272+#endif
230273 ]
231274 ]
232275
233276{-# INLINE sieveScan #-}
234−sieveScan :: Monad m => SerialT m Int -> SerialT m Int
277+sieveScan :: Monad m => Stream m Int -> Stream m Int
235278sieveScan =
236− S.mapMaybe snd
237− . S.scanlM' (\(primes, _) n -> do
279+ Stream.mapMaybe snd
280+ . Stream.scan (FL.foldlM' (\(primes, _) n -> do
238281 return $
239282 let ps = takeWhile (\p -> p * p <= n) primes
240283 in if all (\p -> n `mod` p /= 0) ps
241284 then (primes ++ [n], Just n)
242− else (primes, Nothing)) (return ([2], Just 2))
285+ else (primes, Nothing)) (return ([2], Just 2)))
243286
244287o_n_space_mapping :: Int -> [Benchmark]
245288o_n_space_mapping value =
246289 [ bgroup "mapping"
247290 [ benchIO "naive prime sieve"
248− (\n -> S.sum $ sieveScan $ S.enumerateFromTo 2 (value + n))
291+ (\n -> Stream.fold FL.sum $ sieveScan $ Stream.enumerateFromTo 2 (value + n))
249292 ]
250293 ]
251294
@@ -256,8 +299,75 @@ o_n_space_mapping value =
256299o_1_space_functor :: Int -> [Benchmark]
257300o_1_space_functor value =
258301 [ bgroup "Functor"
259− [ benchIOSink value "fmap" (fmapN fromSerial 1)
260− , benchIOSink value "fmap x 4" (fmapN fromSerial 4)
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+ -}
261371 ]
262372 ]
263373
@@ -266,125 +376,129 @@ o_1_space_functor value =
266376-------------------------------------------------------------------------------
267377
268378{-# INLINE filterEven #-}
269−filterEven :: MonadIO m => Int -> SerialT m Int -> m ()
270−filterEven n = composeN n $ S.filter even
379+filterEven :: MonadIO m => Int -> Stream m Int -> m ()
380+filterEven n = composeN n $ Stream.filter even
271381
272382{-# INLINE filterAllOut #-}
273−filterAllOut :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
274−filterAllOut value n = composeN n $ S.filter (> (value + 1))
383+filterAllOut :: MonadIO m => Int -> Int -> Stream m Int -> m ()
384+filterAllOut value n = composeN n $ Stream.filter (> (value + 1))
275385
276386{-# INLINE filterAllIn #-}
277−filterAllIn :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
278−filterAllIn value n = composeN n $ S.filter (<= (value + 1))
387+filterAllIn :: MonadIO m => Int -> Int -> Stream m Int -> m ()
388+filterAllIn value n = composeN n $ Stream.filter (<= (value + 1))
279389
280390{-# INLINE filterMEven #-}
281−filterMEven :: MonadIO m => Int -> SerialT m Int -> m ()
282−filterMEven n = composeN n $ S.filterM (return . even)
391+filterMEven :: MonadIO m => Int -> Stream m Int -> m ()
392+filterMEven n = composeN n $ Stream.filterM (return . even)
283393
284394{-# INLINE filterMAllOut #-}
285−filterMAllOut :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
286−filterMAllOut value n = composeN n $ S.filterM (\x -> return $ x > (value + 1))
395+filterMAllOut :: MonadIO m => Int -> Int -> Stream m Int -> m ()
396+filterMAllOut value n = composeN n $ Stream.filterM (\x -> return $ x > (value + 1))
287397
288398{-# INLINE filterMAllIn #-}
289−filterMAllIn :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
290−filterMAllIn value n = composeN n $ S.filterM (\x -> return $ x <= (value + 1))
291−
292−{-# INLINE foldFilterEven #-}
293−foldFilterEven :: MonadIO m => Int -> SerialT m Int -> m ()
294−foldFilterEven n = composeN n $ Serial.foldFilter (FL.satisfy even)
399+filterMAllIn :: MonadIO m => Int -> Int -> Stream m Int -> m ()
400+filterMAllIn value n = composeN n $ Stream.filterM (\x -> return $ x <= (value + 1))
295401
296402{-# INLINE _takeOne #-}
297−_takeOne :: MonadIO m => Int -> SerialT m Int -> m ()
298−_takeOne n = composeN n $ S.take 1
403+_takeOne :: MonadIO m => Int -> Stream m Int -> m ()
404+_takeOne n = composeN n $ Stream.take 1
299405
300406{-# INLINE takeAll #-}
301−takeAll :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
302−takeAll value n = composeN n $ S.take (value + 1)
407+takeAll :: MonadIO m => Int -> Int -> Stream m Int -> m ()
408+takeAll value n = composeN n $ Stream.take (value + 1)
303409
304410{-# INLINE takeWhileTrue #-}
305−takeWhileTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
306−takeWhileTrue value n = composeN n $ S.takeWhile (<= (value + 1))
411+takeWhileTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
412+takeWhileTrue value n = composeN n $ Stream.takeWhile (<= (value + 1))
307413
308414{-# INLINE takeWhileMTrue #-}
309−takeWhileMTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
310−takeWhileMTrue value n = composeN n $ S.takeWhileM (return . (<= (value + 1)))
415+takeWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
416+takeWhileMTrue value n = composeN n $ Stream.takeWhileM (return . (<= (value + 1)))
311417
418+#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
312419{-# INLINE takeInterval #-}
313−takeInterval :: NanoSecond64 -> Int -> SerialT IO Int -> IO ()
314−takeInterval i n = composeN n (Internal.takeInterval i)
420+takeInterval :: Double -> Int -> Stream IO Int -> IO ()
421+takeInterval i n = composeN n (Stream.takeInterval i)
315422
423+-- Inspection testing is disabled for takeInterval
424+-- Enable it when looking at it throughly
316425#ifdef INSPECTION
317426-- inspect $ hasNoType 'takeInterval ''SPEC
318−inspect $ hasNoTypeClasses 'takeInterval
427+-- inspect $ hasNoTypeClasses 'takeInterval
319428-- inspect $ 'takeInterval `hasNoType` ''D.Step
320429#endif
321430
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+
322443{-# INLINE dropOne #-}
323−dropOne :: MonadIO m => Int -> SerialT m Int -> m ()
324−dropOne n = composeN n $ S.drop 1
444+dropOne :: MonadIO m => Int -> Stream m Int -> m ()
445+dropOne n = composeN n $ Stream.drop 1
325446
326447{-# INLINE dropAll #-}
327−dropAll :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
328−dropAll value n = composeN n $ S.drop (value + 1)
448+dropAll :: MonadIO m => Int -> Int -> Stream m Int -> m ()
449+dropAll value n = composeN n $ Stream.drop (value + 1)
329450
330451{-# INLINE dropWhileTrue #-}
331−dropWhileTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
332−dropWhileTrue value n = composeN n $ S.dropWhile (<= (value + 1))
452+dropWhileTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
453+dropWhileTrue value n = composeN n $ Stream.dropWhile (<= (value + 1))
333454
334455{-# INLINE dropWhileMTrue #-}
335−dropWhileMTrue :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
336−dropWhileMTrue value n = composeN n $ S.dropWhileM (return . (<= (value + 1)))
456+dropWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
457+dropWhileMTrue value n = composeN n $ Stream.dropWhileM (return . (<= (value + 1)))
337458
338459{-# INLINE dropWhileFalse #-}
339−dropWhileFalse :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
340−dropWhileFalse value n = composeN n $ S.dropWhile (> (value + 1))
460+dropWhileFalse :: MonadIO m => Int -> Int -> Stream m Int -> m ()
461+dropWhileFalse value n = composeN n $ Stream.dropWhile (> (value + 1))
341462
463+#ifdef USE_PRELUDE
342464-- XXX Decide on the time interval
343465{-# INLINE _intervalsOfSum #-}
344−_intervalsOfSum :: MonadAsync m => Double -> Int -> SerialT m Int -> m ()
345−_intervalsOfSum i n = composeN n (S.intervalsOf i FL.sum)
346−
347−{-# INLINE dropInterval #-}
348−dropInterval :: NanoSecond64 -> Int -> SerialT IO Int -> IO ()
349−dropInterval i n = composeN n (Internal.dropInterval i)
350−
351−#ifdef INSPECTION
352−inspect $ hasNoTypeClasses 'dropInterval
353−-- inspect $ 'dropInterval `hasNoType` ''D.Step
466+_intervalsOfSum :: MonadAsync m => Double -> Int -> Stream m Int -> m ()
467+_intervalsOfSum i n = composeN n (Stream.intervalsOf i FL.sum)
354468#endif
355469
356470{-# INLINE findIndices #-}
357−findIndices :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
358−findIndices value n = composeN n $ S.findIndices (== (value + 1))
471+findIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
472+findIndices value n = composeN n $ Stream.findIndices (== (value + 1))
359473
360474{-# INLINE elemIndices #-}
361−elemIndices :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
362−elemIndices value n = composeN n $ S.elemIndices (value + 1)
475+elemIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
476+elemIndices value n = composeN n $ Stream.elemIndices (value + 1)
363477
364478{-# INLINE deleteBy #-}
365−deleteBy :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
366−deleteBy value n = composeN n $ S.deleteBy (>=) (value + 1)
479+deleteBy :: MonadIO m => Int -> Int -> Stream m Int -> m ()
480+deleteBy value n = composeN n $ Stream.deleteBy (>=) (value + 1)
367481
368482-- uniq . uniq == uniq, composeN 2 ~ composeN 1
369483{-# INLINE uniq #-}
370−uniq :: MonadIO m => Int -> SerialT m Int -> m ()
371−uniq n = composeN n S.uniq
484+uniq :: MonadIO m => Int -> Stream m Int -> m ()
485+uniq n = composeN n Stream.uniq
372486
373487{-# INLINE mapMaybe #-}
374−mapMaybe :: MonadIO m => Int -> SerialT m Int -> m ()
488+mapMaybe :: MonadIO m => Int -> Stream m Int -> m ()
375489mapMaybe n =
376490 composeN n $
377− S.mapMaybe
491+ Stream.mapMaybe
378492 (\x ->
379493 if odd x
380494 then Nothing
381495 else Just x)
382496
383497{-# INLINE mapMaybeM #-}
384−mapMaybeM :: S.MonadAsync m => Int -> SerialT m Int -> m ()
498+mapMaybeM :: MonadAsync m => Int -> Stream m Int -> m ()
385499mapMaybeM n =
386500 composeN n $
387− S.mapMaybeM
501+ Stream.mapMaybeM
388502 (\x ->
389503 if odd x
390504 then return Nothing
@@ -401,22 +515,16 @@ o_1_space_filtering value =
401515 , benchIOSink value "filterM-all-out" (filterMAllOut value 1)
402516 , benchIOSink value "filterM-all-in" (filterMAllIn value 1)
403517
404− , benchIOSink value "foldFilter-even" (foldFilterEven 1)
405−
406518 -- Trimming
407519 , benchIOSink value "take-all" (takeAll value 1)
408− , benchIOSink
409− value
410− "takeInterval-all"
411− (takeInterval (NanoSecond64 maxBound) 1)
412520 , benchIOSink value "takeWhile-true" (takeWhileTrue value 1)
413521 -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
414522 , benchIOSink value "drop-one" (dropOne 1)
415523 , benchIOSink value "drop-all" (dropAll value 1)
416− , benchIOSink
417− value
418− "dropInterval-all"
419− (dropInterval (NanoSecond64 maxBound) 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
420528 , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
421529 -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
422530 , benchIOSink
@@ -448,8 +556,6 @@ o_1_space_filteringX4 value =
448556 , benchIOSink value "filterM-all-out" (filterMAllOut value 4)
449557 , benchIOSink value "filterM-all-in" (filterMAllIn value 4)
450558
451− , benchIOSink value "foldFilter-even" (foldFilterEven 4)
452−
453559 -- trimming
454560 , benchIOSink value "take-all" (takeAll value 4)
455561 , benchIOSink value "takeWhile-true" (takeWhileTrue value 4)
@@ -481,26 +587,26 @@ o_1_space_filteringX4 value =
481587-------------------------------------------------------------------------------
482588
483589{-# INLINE intersperse #-}
484−intersperse :: S.MonadAsync m => Int -> Int -> SerialT m Int -> m ()
485−intersperse value n = composeN n $ S.intersperse (value + 1)
590+intersperse :: MonadAsync m => Int -> Int -> Stream m Int -> m ()
591+intersperse value n = composeN n $ Stream.intersperse (value + 1)
486592
487593{-# INLINE intersperseM #-}
488−intersperseM :: S.MonadAsync m => Int -> Int -> SerialT m Int -> m ()
489−intersperseM value n = composeN n $ S.intersperseM (return $ value + 1)
594+intersperseM :: MonadAsync m => Int -> Int -> Stream m Int -> m ()
595+intersperseM value n = composeN n $ Stream.intersperseM (return $ value + 1)
490596
491597{-# INLINE insertBy #-}
492−insertBy :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
493−insertBy value n = composeN n $ S.insertBy compare (value + 1)
598+insertBy :: MonadIO m => Int -> Int -> Stream m Int -> m ()
599+insertBy value n = composeN n $ Stream.insertBy compare (value + 1)
494600
495601{-# INLINE interposeSuffix #-}
496−interposeSuffix :: S.MonadAsync m => Int -> Int -> SerialT m Int -> m ()
602+interposeSuffix :: Monad m => Int -> Int -> Stream m Int -> m ()
497603interposeSuffix value n =
498− composeN n $ Internal.interposeSuffix (value + 1) Unfold.identity
604+ composeN n $ Stream.interposeSuffix (value + 1) Unfold.identity
499605
500606{-# INLINE intercalateSuffix #-}
501−intercalateSuffix :: S.MonadAsync m => Int -> Int -> SerialT m Int -> m ()
607+intercalateSuffix :: Monad m => Int -> Int -> Stream m Int -> m ()
502608intercalateSuffix value n =
503− composeN n $ Internal.intercalateSuffix Unfold.identity (value + 1)
609+ composeN n $ Stream.intercalateSuffix Unfold.identity (value + 1)
504610
505611o_1_space_inserting :: Int -> [Benchmark]
506612o_1_space_inserting value =
@@ -526,12 +632,12 @@ o_1_space_insertingX4 value =
526632-------------------------------------------------------------------------------
527633
528634{-# INLINE indexed #-}
529−indexed :: MonadIO m => Int -> SerialT m Int -> m ()
530−indexed n = composeN n (S.map snd . S.indexed)
635+indexed :: MonadIO m => Int -> Stream m Int -> m ()
636+indexed n = composeN n (fmap snd . Stream.indexed)
531637
532638{-# INLINE indexedR #-}
533−indexedR :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
534−indexedR value n = composeN n (S.map snd . S.indexedR value)
639+indexedR :: MonadIO m => Int -> Int -> Stream m Int -> m ()
640+indexedR value n = composeN n (fmap snd . Stream.indexedR value)
535641
536642o_1_space_indexing :: Int -> [Benchmark]
537643o_1_space_indexing value =
@@ -570,7 +676,12 @@ benchmarks moduleName size =
570676 , o_1_space_indexingX4 size
571677 ]
572678 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
573− [ o_n_space_traversable size
574− , o_n_space_mapping size
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
575686 ]
576687 ]
benchmark/Streamly/Benchmark/Data/Unfold.hs+46−36
@@ -31,17 +31,18 @@ import qualified Prelude
3131import qualified Streamly.FileSystem.Handle as FH
3232import qualified Streamly.Internal.Data.Fold as FL
3333import qualified Streamly.Internal.Data.Unfold as UF
34−import qualified Streamly.Internal.Data.Stream.IsStream as S
35−import qualified Streamly.Internal.Data.Stream.StreamD as D
36−import qualified Streamly.Internal.Data.Stream.StreamK as K
37−import qualified Streamly.Prelude as SP
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
3838
39−import Gauge hiding (env)
40−import Prelude hiding (concat, take, filter, zipWith, map, mapM, takeWhile)
39+import Test.Tasty.Bench hiding (env)
40+import Prelude hiding (take, filter, zipWith, map, mapM, takeWhile)
4141import Streamly.Benchmark.Common
4242import Streamly.Benchmark.Common.Handle
4343
4444#ifdef INSPECTION
45+import Control.Monad.Catch (MonadCatch)
4546import Test.Inspection
4647#endif
4748
@@ -161,7 +162,7 @@ swap size start =
161162{-# INLINE fromStream #-}
162163fromStream :: Int -> Int -> IO ()
163164fromStream size start =
164− drainGeneration UF.fromStream (S.replicate size start :: S.SerialT IO Int)
165+ drainGeneration UF.fromStream (S.replicate size start :: S.Stream IO Int)
165166
166167-- XXX INVESTIGATE: Although the performance of this should be equivalant to
167168-- fromStream, this is considerably worse. More than 4x worse.
@@ -231,7 +232,7 @@ _fromProducer = undefined
231232
232233{-# INLINE replicateM #-}
233234replicateM :: Monad m => Int -> Int -> m ()
234−replicateM size start = drainGeneration (UF.replicateM size) (return start)
235+replicateM size start = drainGeneration UF.replicateM (size, return start)
235236
236237{-# INLINE repeatM #-}
237238repeatM :: Monad m => Int -> Int -> m ()
@@ -304,12 +305,12 @@ mapM :: Monad m => Int -> Int -> m ()
304305mapM size start =
305306 drainTransformationDefault (size + start) (UF.mapM (return . (+) 1)) start
306307
307−{-# INLINE mapMWithInput #-}
308−mapMWithInput :: Monad m => Int -> Int -> m ()
309−mapMWithInput size start =
308+{-# INLINE mapM2 #-}
309+mapM2 :: Monad m => Int -> Int -> m ()
310+mapM2 size start =
310311 drainTransformationDefault
311312 size
312− (UF.mapMWithInput (\a b -> return $ a + b))
313+ (UF.mapM2 (\a b -> return $ a + b))
313314 start
314315
315316-------------------------------------------------------------------------------
@@ -417,13 +418,16 @@ teeZipWith size start =
417418-- Applicative
418419-------------------------------------------------------------------------------
419420
421+nthRoot :: Double -> Int -> Int
422+nthRoot n value = round (fromIntegral value**(1/n))
423+
420424{-# INLINE toNullAp #-}
421425toNullAp :: Monad m => Int -> Int -> m ()
422426toNullAp value start =
423427 let end = start + nthRoot 2 value
424428 s = source end
425429 -- in UF.fold ((+) <$> s <*> s) FL.drain start
426− in UF.fold FL.drain ((+) `fmap` s `UF.apply` s) start
430+ in UF.fold FL.drain ((+) `fmap` s `UF.crossApply` s) start
427431
428432{-# INLINE _apDiscardFst #-}
429433_apDiscardFst :: Int -> Int -> m ()
@@ -437,9 +441,6 @@ _apDiscardSnd = undefined
437441-- Monad
438442-------------------------------------------------------------------------------
439443
440−nthRoot :: Double -> Int -> Int
441−nthRoot n value = round (fromIntegral value**(1/n))
442−
443444{-# INLINE concatMapM #-}
444445concatMapM :: Monad m => Int -> Int -> m ()
445446concatMapM value start =
@@ -600,9 +601,9 @@ concatCount :: Int -> Int
600601concatCount linearCount =
601602 round (((1 + 8 * fromIntegral linearCount)**(1/2::Double) - 1) / 2)
602603
603−{-# INLINE concat #-}
604−concat :: Monad m => Int -> Int -> m ()
605−concat linearCount start = do
604+{-# INLINE many #-}
605+many :: Monad m => Int -> Int -> m ()
606+many linearCount start = do
606607 let end = start + concatCount linearCount
607608 UF.fold FL.drain (UF.many (source end) (source end)) start
608609
@@ -667,7 +668,7 @@ o_1_space_transformation size =
667668 "transformation"
668669 [ benchIO "map" $ map size
669670 , benchIO "mapM" $ mapM size
670− , benchIO "mapMWithInput" $ mapMWithInput size
671+ , benchIO "mapM2" $ mapM2 size
671672 , benchIO "postscan" $ postscan size
672673 ]
673674 ]
@@ -707,7 +708,7 @@ lf = fromIntegral (ord '\n')
707708-- | Split on line feed.
708709foldManySepBy :: Handle -> IO Int
709710foldManySepBy =
710− let u = UF.foldMany (FL.takeEndBy_ (== lf) FL.drain) FH.read
711+ let u = UF.foldMany (FL.takeEndBy_ (== lf) FL.drain) FH.reader
711712 in UF.fold FL.length u
712713
713714o_1_space_nested :: BenchEnv -> Int -> [Benchmark]
@@ -727,7 +728,7 @@ o_1_space_nested env size =
727728 , benchIO "filterAllIn" $ filterAllIn size
728729 , benchIO "filterSome" $ filterSome size
729730
730− , benchIO "concat" $ concat size
731+ , benchIO "many" $ many size
731732 , mkBench "foldMany (Fold.takeEndBy_ (== lf) Fold.drain)" env
732733 $ \inh _ -> foldManySepBy inh
733734 ]
@@ -748,11 +749,11 @@ o_n_space_nested size =
748749-- | Send the file contents to /dev/null with exception handling
749750readWriteOnExceptionUnfold :: Handle -> Handle -> IO ()
750751readWriteOnExceptionUnfold inh devNull =
751− let readEx = UF.onException (\_ -> hClose inh) FH.read
752− in SP.fold (FH.write devNull) $ SP.unfold readEx inh
752+ let readEx = UF.onException (\_ -> hClose inh) FH.reader
753+ in S.fold (FH.write devNull) $ S.unfold readEx inh
753754
754755#ifdef INSPECTION
755−inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
756+-- inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
756757-- inspect $ 'readWriteOnExceptionUnfold `hasNoType` ''Step
757758#endif
758759
@@ -760,45 +761,54 @@ inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
760761readWriteHandleExceptionUnfold :: Handle -> Handle -> IO ()
761762readWriteHandleExceptionUnfold inh devNull =
762763 let handler (_e :: SomeException) = hClose inh >> return 10
763− readEx = UF.handle (UF.functionM handler) FH.read
764− in SP.fold (FH.write devNull) $ SP.unfold readEx inh
764+ readEx = UF.handle (UF.functionM handler) FH.reader
765+ in S.fold (FH.write devNull) $ S.unfold readEx inh
765766
766767#ifdef INSPECTION
767−inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
768+-- hasNoTypeClasses started failing in GHC 9.4.4
769+-- inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
768770-- inspect $ 'readWriteHandleExceptionUnfold `hasNoType` ''Step
769771#endif
770772
771773-- | Send the file contents to /dev/null with exception handling
772774readWriteFinally_Unfold :: Handle -> Handle -> IO ()
773775readWriteFinally_Unfold inh devNull =
774− let readEx = UF.finally_ (\_ -> hClose inh) FH.read
775− in SP.fold (FH.write devNull) $ SP.unfold readEx inh
776+ let readEx = UF.finally_ (\_ -> hClose inh) FH.reader
777+ in S.fold (FH.write devNull) $ S.unfold readEx inh
776778
777779#ifdef INSPECTION
780+#if __GLASGOW_HASKELL__ >= 906
781+inspect $ hasNoTypeClassesExcept 'readWriteFinally_Unfold [''MonadCatch]
782+#else
778783inspect $ hasNoTypeClasses 'readWriteFinally_Unfold
784+#endif
779785-- inspect $ 'readWriteFinallyUnfold `hasNoType` ''Step
780786#endif
781787
782788readWriteFinallyUnfold :: Handle -> Handle -> IO ()
783789readWriteFinallyUnfold inh devNull =
784− let readEx = UF.finally (\_ -> hClose inh) FH.read
785− in SP.fold (FH.write devNull) $ SP.unfold readEx inh
790+ let readEx = UF.finally (\_ -> hClose inh) FH.reader
791+ in S.fold (FH.write devNull) $ S.unfold readEx inh
786792
787793-- | Send the file contents to /dev/null with exception handling
788794readWriteBracket_Unfold :: Handle -> Handle -> IO ()
789795readWriteBracket_Unfold inh devNull =
790− let readEx = UF.bracket_ return (\_ -> hClose inh) FH.read
791− in SP.fold (FH.write devNull) $ SP.unfold readEx inh
796+ let readEx = UF.bracket_ return (\_ -> hClose inh) FH.reader
797+ in S.fold (FH.write devNull) $ S.unfold readEx inh
792798
793799#ifdef INSPECTION
800+#if __GLASGOW_HASKELL__ >= 906
801+inspect $ hasNoTypeClassesExcept 'readWriteBracket_Unfold [''MonadCatch]
802+#else
794803inspect $ hasNoTypeClasses 'readWriteBracket_Unfold
804+#endif
795805-- inspect $ 'readWriteBracketUnfold `hasNoType` ''Step
796806#endif
797807
798808readWriteBracketUnfold :: Handle -> Handle -> IO ()
799809readWriteBracketUnfold inh devNull =
800− let readEx = UF.bracket return (\_ -> hClose inh) FH.read
801− in SP.fold (FH.write devNull) $ S.unfold readEx inh
810+ let readEx = UF.bracket return (\_ -> hClose inh) FH.reader
811+ in S.fold (FH.write devNull) $ S.unfold readEx inh
802812
803813o_1_space_copy_read_exceptions :: BenchEnv -> [Benchmark]
804814o_1_space_copy_read_exceptions env =
benchmark/Streamly/Benchmark/FileSystem/Handle.hs+1−1
@@ -22,7 +22,7 @@ import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
2222import qualified Handle.ReadWrite as RW
2323import qualified Handle.Read as RO
2424
25−import Gauge hiding (env)
25+import Test.Tasty.Bench hiding (env)
2626import Prelude hiding (last, length)
2727import Streamly.Benchmark.Common
2828
benchmark/Streamly/Benchmark/FileSystem/Handle/Read.hs+60−52
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Streamly.Benchmark.FileSystem.Handle
35-- Copyright : (c) 2019 Composewell Technologies
@@ -27,25 +29,26 @@ import GHC.Magic (inline)
2729import GHC.Magic (noinline)
2830import System.IO (Handle)
2931
32+import qualified Streamly.Data.Stream as Stream
33+import qualified Streamly.Data.Fold as Fold
3034import qualified Streamly.FileSystem.Handle as FH
31−import qualified Streamly.Internal.Data.Array.Foreign as A
32−import qualified Streamly.Internal.Data.Array.Foreign.Type as AT
35+import qualified Streamly.Internal.Data.Array as A
3336import qualified Streamly.Internal.Data.Fold as FL
34−import qualified Streamly.Internal.Data.Stream.IsStream as IP
37+import qualified Streamly.Internal.Data.Stream as IP
3538import qualified Streamly.Internal.FileSystem.Handle as IFH
3639import qualified Streamly.Internal.Unicode.Stream as IUS
37−import qualified Streamly.Prelude as S
40+import qualified Streamly.Data.Stream.Prelude as S
3841import qualified Streamly.Unicode.Stream as SS
3942
40−import Gauge hiding (env)
43+import Test.Tasty.Bench hiding (env)
4144import Prelude hiding (last, length)
4245import Streamly.Benchmark.Common.Handle
4346
4447#ifdef INSPECTION
45−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..), FoldMany)
48+import Streamly.Internal.Data.Stream (Step(..), FoldMany)
4649
47−import qualified Streamly.Internal.Data.Array.Foreign.Mut.Type as MA
48−import qualified Streamly.Internal.Data.Stream.StreamD as D
50+import qualified Streamly.Internal.Data.MutArray as MutArray
51+import qualified Streamly.Internal.Data.Stream as D
4952import qualified Streamly.Internal.Data.Unfold as IUF
5053
5154import Test.Inspection
@@ -59,49 +62,49 @@ import Test.Inspection
5962
6063-- | Get the last byte from a file bytestream.
6164readLast :: Handle -> IO (Maybe Word8)
62−readLast = S.last . S.unfold FH.read
65+readLast = S.fold Fold.last . S.unfold FH.reader
6366
6467#ifdef INSPECTION
6568inspect $ hasNoTypeClasses 'readLast
6669inspect $ 'readLast `hasNoType` ''Step -- S.unfold
6770inspect $ 'readLast `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
68−inspect $ 'readLast `hasNoType` ''MA.ReadUState -- FH.read/A.read
71+inspect $ 'readLast `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
6972#endif
7073
7174-- assert that flattenArrays constructors are not present
7275-- | Count the number of bytes in a file.
7376readCountBytes :: Handle -> IO Int
74−readCountBytes = S.length . S.unfold FH.read
77+readCountBytes = S.fold Fold.length . S.unfold FH.reader
7578
7679#ifdef INSPECTION
7780inspect $ hasNoTypeClasses 'readCountBytes
7881inspect $ 'readCountBytes `hasNoType` ''Step -- S.unfold
7982inspect $ 'readCountBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
80−inspect $ 'readCountBytes `hasNoType` ''MA.ReadUState -- FH.read/A.read
83+inspect $ 'readCountBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
8184#endif
8285
8386-- | Count the number of lines in a file.
8487readCountLines :: Handle -> IO Int
8588readCountLines =
86− S.length
89+ S.fold Fold.length
8790 . IUS.lines FL.drain
8891 . SS.decodeLatin1
89− . S.unfold FH.read
92+ . S.unfold FH.reader
9093
9194#ifdef INSPECTION
9295inspect $ hasNoTypeClasses 'readCountLines
9396inspect $ 'readCountLines `hasNoType` ''Step
9497inspect $ 'readCountLines `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
95−inspect $ 'readCountLines `hasNoType` ''MA.ReadUState -- FH.read/A.read
98+inspect $ 'readCountLines `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
9699#endif
97100
98101-- | Count the number of words in a file.
99102readCountWords :: Handle -> IO Int
100103readCountWords =
101− S.length
104+ S.fold Fold.length
102105 . IUS.words FL.drain
103106 . SS.decodeLatin1
104− . S.unfold FH.read
107+ . S.unfold FH.reader
105108
106109#ifdef INSPECTION
107110inspect $ hasNoTypeClasses 'readCountWords
@@ -110,13 +113,13 @@ inspect $ hasNoTypeClasses 'readCountWords
110113
111114-- | Sum the bytes in a file.
112115readSumBytes :: Handle -> IO Word8
113−readSumBytes = S.sum . S.unfold FH.read
116+readSumBytes = S.fold Fold.sum . S.unfold FH.reader
114117
115118#ifdef INSPECTION
116119inspect $ hasNoTypeClasses 'readSumBytes
117120inspect $ 'readSumBytes `hasNoType` ''Step
118121inspect $ 'readSumBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
119−inspect $ 'readSumBytes `hasNoType` ''MA.ReadUState -- FH.read/A.read
122+inspect $ 'readSumBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
120123#endif
121124
122125-- XXX When we mark this with INLINE and we have two benchmarks using S.drain
@@ -130,21 +133,21 @@ inspect $ 'readSumBytes `hasNoType` ''MA.ReadUState -- FH.read/A.read
130133-- fusion-plugin to propagate INLINE phase information such that this problem
131134-- does not occur.
132135readDrain :: Handle -> IO ()
133−readDrain inh = S.drain $ S.unfold FH.read inh
136+readDrain inh = S.fold Fold.drain $ S.unfold FH.reader inh
134137
135138-- XXX investigate why we need an INLINE in this case (GHC)
136139{-# INLINE readDecodeLatin1 #-}
137140readDecodeLatin1 :: Handle -> IO ()
138141readDecodeLatin1 inh =
139− S.drain
142+ S.fold Fold.drain
140143 $ SS.decodeLatin1
141− $ S.unfold FH.read inh
144+ $ S.unfold FH.reader inh
142145
143146readDecodeUtf8 :: Handle -> IO ()
144147readDecodeUtf8 inh =
145− S.drain
148+ S.fold Fold.drain
146149 $ SS.decodeUtf8
147− $ S.unfold FH.read inh
150+ $ S.unfold FH.reader inh
148151
149152#ifdef INSPECTION
150153inspect $ hasNoTypeClasses 'readDecodeUtf8
@@ -185,11 +188,11 @@ o_1_space_reduce_read env =
185188-- | Count the number of lines in a file.
186189getChunksConcatUnfoldCountLines :: Handle -> IO Int
187190getChunksConcatUnfoldCountLines inh =
188− S.length
191+ S.fold Fold.length
189192 $ IUS.lines FL.drain
190193 $ SS.decodeLatin1
191194 -- XXX replace with toBytes
192− $ S.unfoldMany A.read (IFH.getChunks inh)
195+ $ S.unfoldMany A.reader (IFH.readChunks inh)
193196
194197#ifdef INSPECTION
195198inspect $ hasNoTypeClasses 'getChunksConcatUnfoldCountLines
@@ -210,46 +213,51 @@ o_1_space_reduce_toBytes env =
210213-------------------------------------------------------------------------------
211214
212215chunksOfSum :: Int -> Handle -> IO Int
213−chunksOfSum n inh = S.length $ S.chunksOf n FL.sum (S.unfold FH.read inh)
216+chunksOfSum n inh =
217+ S.fold Fold.length $ IP.groupsOf n FL.sum (S.unfold FH.reader inh)
214218
215219foldManyPostChunksOfSum :: Int -> Handle -> IO Int
216220foldManyPostChunksOfSum n inh =
217− S.length $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.read inh)
221+ S.fold Fold.length
222+ $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.reader inh)
218223
219224foldManyChunksOfSum :: Int -> Handle -> IO Int
220225foldManyChunksOfSum n inh =
221− S.length $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.read inh)
226+ S.fold Fold.length
227+ $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.reader inh)
222228
223229-- XXX investigate why we need an INLINE in this case (GHC)
224230-- Even though allocations remain the same in both cases inlining improves time
225231-- by 4x.
226232-- | Slice in chunks of size n and get the count of chunks.
227−{-# INLINE chunksOf #-}
228−chunksOf :: Int -> Handle -> IO Int
229−chunksOf n inh =
233+{-# INLINE groupsOf #-}
234+groupsOf :: Int -> Handle -> IO Int
235+groupsOf n inh =
230236 -- writeNUnsafe gives 2.5x boost here over writeN.
231− S.length $ S.chunksOf n (AT.writeNUnsafe n) (S.unfold FH.read inh)
237+ S.fold Fold.length
238+ $ IP.groupsOf n (A.writeNUnsafe n) (S.unfold FH.reader inh)
232239
233240#ifdef INSPECTION
234−inspect $ hasNoTypeClasses 'chunksOf
235−inspect $ 'chunksOf `hasNoType` ''Step
236−inspect $ 'chunksOf `hasNoType` ''FoldMany
237−inspect $ 'chunksOf `hasNoType` ''AT.ArrayUnsafe -- AT.writeNUnsafe
238−inspect $ 'chunksOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
239−inspect $ 'chunksOf `hasNoType` ''MA.ReadUState -- FH.read/A.read
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
240247#endif
241248
242−{-# INLINE arraysOf #-}
243−arraysOf :: Int -> Handle -> IO Int
244−arraysOf n inh = S.length $ IP.arraysOf n (S.unfold FH.read inh)
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)
245253
246254o_1_space_reduce_read_grouped :: BenchEnv -> [Benchmark]
247255o_1_space_reduce_read_grouped env =
248256 [ bgroup "reduce/read/chunks"
249− [ mkBench ("S.chunksOf " ++ show (bigSize env) ++ " FL.sum") env $
257+ [ mkBench ("S.groupsOf " ++ show (bigSize env) ++ " FL.sum") env $
250258 \inh _ ->
251259 chunksOfSum (bigSize env) inh
252− , mkBench "S.chunksOf 1 FL.sum" env $ \inh _ ->
260+ , mkBench "S.groupsOf 1 FL.sum" env $ \inh _ ->
253261 chunksOfSum 1 inh
254262
255263 -- XXX investigate why we need inline/noinline in these cases (GHC)
@@ -272,20 +280,20 @@ o_1_space_reduce_read_grouped env =
272280 $ \inh _ -> inline foldManyChunksOfSum 1 inh
273281
274282 -- 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
275291 , mkBenchSmall "S.chunksOf 1" env $ \inh _ ->
276292 chunksOf 1 inh
277293 , mkBench "S.chunksOf 10" env $ \inh _ ->
278294 chunksOf 10 inh
279295 , mkBench "S.chunksOf 1000" env $ \inh _ ->
280296 chunksOf 1000 inh
281−
282− -- arraysOf may use a different impl than chunksOf
283− , mkBenchSmall "S.arraysOf 1" env $ \inh _ ->
284− arraysOf 1 inh
285− , mkBench "S.arraysOf 10" env $ \inh _ ->
286− arraysOf 10 inh
287− , mkBench "S.arraysOf 1000" env $ \inh _ ->
288− arraysOf 1000 inh
289297 ]
290298 ]
291299
benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+26−26
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Streamly.Benchmark.FileSystem.Handle
35-- Copyright : (c) 2019 Composewell Technologies
@@ -29,20 +31,18 @@ import Streamly.Internal.System.IO (defaultChunkSize)
2931import qualified Streamly.FileSystem.Handle as FH
3032import qualified Streamly.Internal.Data.Unfold as IUF
3133import qualified Streamly.Internal.FileSystem.Handle as IFH
32−import qualified Streamly.Data.Array.Foreign as A
33−import qualified Streamly.Prelude as S
34+import qualified Streamly.Data.Array as A
35+import qualified Streamly.Data.Stream.Prelude as S
3436
35−import Gauge hiding (env)
37+import Test.Tasty.Bench hiding (env)
3638import Streamly.Benchmark.Common.Handle
3739
3840#ifdef INSPECTION
39−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
41+import Streamly.Internal.Data.Stream (Step(..))
4042
41−import qualified Streamly.Internal.Data.Stream.StreamD.Type as D
43+import qualified Streamly.Internal.Data.Stream as D
4244import qualified Streamly.Internal.Data.Tuple.Strict as Strict
43−import qualified Streamly.Internal.Data.Array.Stream.Mut.Foreign as MAS
44−import qualified Streamly.Internal.Data.Array.Foreign.Type as AT
45−import qualified Streamly.Internal.Data.Array.Foreign.Mut.Type as MA
45+import qualified Streamly.Internal.Data.MutArray as MutArray
4646
4747import Test.Inspection
4848#endif
@@ -53,7 +53,7 @@ import Test.Inspection
5353
5454-- | Copy file
5555copyChunks :: Handle -> Handle -> IO ()
56−copyChunks inh outh = S.fold (IFH.writeChunks outh) $ IFH.getChunks inh
56+copyChunks inh outh = S.fold (IFH.writeChunks outh) $ IFH.readChunks inh
5757
5858#ifdef INSPECTION
5959inspect $ hasNoTypeClasses 'copyChunks
@@ -76,14 +76,14 @@ o_1_space_copy_chunked env =
7676
7777-- | Copy file
7878copyStream :: Handle -> Handle -> IO ()
79−copyStream inh outh = S.fold (FH.write outh) (S.unfold FH.read inh)
79+copyStream inh outh = S.fold (FH.write outh) (S.unfold FH.reader inh)
8080
8181#ifdef INSPECTION
8282inspect $ hasNoTypeClasses 'copyStream
8383inspect $ 'copyStream `hasNoType` ''Step -- S.unfold
8484inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
85−inspect $ 'copyStream `hasNoType` ''MA.ReadUState -- FH.read/A.read
86−inspect $ 'copyStream `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
85+inspect $ 'copyStream `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
86+ -- FH.read/A.read
8787inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/chunksOf
8888#endif
8989
@@ -103,13 +103,13 @@ o_1_space_copy_read env =
103103
104104-- | Send the file contents to /dev/null
105105readFromBytesNull :: Handle -> Handle -> IO ()
106−readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.read inh
106+readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.reader inh
107107
108108#ifdef INSPECTION
109109inspect $ hasNoTypeClasses 'readFromBytesNull
110110inspect $ 'readFromBytesNull `hasNoType` ''Step
111−inspect $ 'readFromBytesNull `hasNoType` ''MAS.SpliceState
112−inspect $ 'readFromBytesNull `hasNoType` ''AT.ArrayUnsafe -- FH.fromBytes/S.arraysOf
111+inspect $ 'readFromBytesNull `hasNoType` ''MutArray.SpliceState
112+inspect $ 'readFromBytesNull `hasNoType` ''MutArray.ArrayUnsafe -- FH.fromBytes/S.chunksOf
113113inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
114114#endif
115115
@@ -117,13 +117,13 @@ inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
117117readWithFromBytesNull :: Handle -> Handle -> IO ()
118118readWithFromBytesNull inh devNull =
119119 IFH.putBytes devNull
120− $ S.unfold FH.readWith (defaultChunkSize, inh)
120+ $ S.unfold FH.readerWith (defaultChunkSize, inh)
121121
122122#ifdef INSPECTION
123123inspect $ hasNoTypeClasses 'readWithFromBytesNull
124124inspect $ 'readWithFromBytesNull `hasNoType` ''Step
125−inspect $ 'readWithFromBytesNull `hasNoType` ''MAS.SpliceState
126−inspect $ 'readWithFromBytesNull `hasNoType` ''AT.ArrayUnsafe -- FH.fromBytes/S.arraysOf
125+inspect $ 'readWithFromBytesNull `hasNoType` ''MutArray.SpliceState
126+inspect $ 'readWithFromBytesNull `hasNoType` ''MutArray.ArrayUnsafe -- FH.fromBytes/S.chunksOf
127127inspect $ 'readWithFromBytesNull `hasNoType` ''D.FoldMany
128128#endif
129129
@@ -135,7 +135,7 @@ _readChunks inh devNull = IUF.fold fld unf inh
135135 where
136136
137137 fld = FH.write devNull
138− unf = IUF.many A.read FH.readChunks
138+ unf = IUF.many A.reader FH.chunkReader
139139
140140-- | Send the chunk content to /dev/null
141141-- Implicitly benchmarked via 'readWithFromBytesNull'
@@ -145,7 +145,7 @@ _readChunksWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
145145 where
146146
147147 fld = FH.write devNull
148− unf = IUF.many A.read FH.readChunksWith
148+ unf = IUF.many A.reader FH.chunkReaderWith
149149
150150o_1_space_copy_fromBytes :: BenchEnv -> [Benchmark]
151151o_1_space_copy_fromBytes env =
@@ -164,14 +164,14 @@ writeReadWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
164164 where
165165
166166 fld = FH.writeWith defaultChunkSize devNull
167− unf = FH.readWith
167+ unf = FH.readerWith
168168
169169#ifdef INSPECTION
170170inspect $ hasNoTypeClasses 'writeReadWith
171171inspect $ 'writeReadWith `hasNoType` ''Step
172172inspect $ 'writeReadWith `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
173−inspect $ 'writeReadWith `hasNoType` ''MA.ReadUState -- FH.read/A.read
174−inspect $ 'writeReadWith `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
173+inspect $ 'writeReadWith `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
174+ -- FH.read/A.read
175175#endif
176176
177177-- | Send the file contents ('AT.defaultChunkSize') to /dev/null
@@ -181,14 +181,14 @@ writeRead inh devNull = IUF.fold fld unf inh
181181 where
182182
183183 fld = FH.write devNull
184− unf = FH.read
184+ unf = FH.reader
185185
186186#ifdef INSPECTION
187187inspect $ hasNoTypeClasses 'writeRead
188188inspect $ 'writeRead `hasNoType` ''Step
189189inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
190−inspect $ 'writeRead `hasNoType` ''MA.ReadUState -- FH.read/A.read
191−inspect $ 'writeRead `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
190+inspect $ 'writeRead `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
191+ -- FH.read/A.read
192192#endif
193193
194194o_1_space_copy :: BenchEnv -> [Benchmark]
benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+11−6
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -8,7 +10,7 @@
810import Control.Concurrent (threadDelay)
911import Control.Monad (when)
1012import Control.Monad.IO.Class (liftIO)
11−import Gauge
13+import Test.Tasty.Bench
1214import Streamly.Prelude as S
1315import System.Random (randomRIO)
1416
@@ -34,11 +36,14 @@ source range = S.replicateM value $ do
3436
3537{-# INLINE run #-}
3638run :: IsStream t => (Int, Int) -> (Int, Int) -> (t IO Int -> SerialT IO Int) -> IO ()
37−run srange crange t = S.drain $ do
38− n <- t $ source srange
39− d <- liftIO (randomRIO crange)
40− when (d /= 0) $ liftIO $ threadDelay d
41− return n
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
4247
4348low, medium, high :: Int
4449low = 10
benchmark/Streamly/Benchmark/Prelude/Ahead.hs+3−1
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -13,7 +15,7 @@ import qualified Streamly.Prelude as S
1315import Streamly.Benchmark.Common
1416import Streamly.Benchmark.Prelude
1517
16−import Gauge
18+import Test.Tasty.Bench
1719
1820moduleName :: String
1921moduleName = "Prelude.Ahead"
benchmark/Streamly/Benchmark/Prelude/Async.hs+5−3
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -14,7 +16,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream.Transform as Transform
1416import Streamly.Benchmark.Common
1517import Streamly.Benchmark.Prelude
1618
17−import Gauge
19+import Test.Tasty.Bench
1820
1921moduleName :: String
2022moduleName = "Prelude.Async"
@@ -122,9 +124,9 @@ o_1_space_concatFoldable value =
122124 (sourceFoldMapWithStream value)
123125 , benchIOSrc fromAsync "foldMapWithM (<>) (List)"
124126 (sourceFoldMapWithM value)
125− , benchIOSrc fromSerial "S.concatFoldableWith (<>) (List)"
127+ , benchIOSrc fromAsync "S.concatFoldableWith (<>) (List)"
126128 (concatFoldableWith value)
127− , benchIOSrc fromSerial "S.concatForFoldableWith (<>) (List)"
129+ , benchIOSrc fromAsync "S.concatForFoldableWith (<>) (List)"
128130 (concatForFoldableWith value)
129131 , benchIOSrc fromAsync "foldMapM (List)" (sourceFoldMapM value)
130132 ]
benchmark/Streamly/Benchmark/Prelude/Concurrent.hs+2−1
@@ -1,3 +1,4 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
12{-# LANGUAGE CPP #-}
23{-# LANGUAGE RankNTypes #-}
34-- |
@@ -14,7 +15,7 @@ import Streamly.Prelude
1415 , fromWAsync, parallel, fromParallel
1516 )
1617
17−import Gauge
18+import Test.Tasty.Bench
1819import qualified Streamly.Prelude as S
1920
2021-------------------------------------------------------------------------------
benchmark/Streamly/Benchmark/Prelude/Merge.hs+4−2
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -28,13 +30,13 @@ import qualified Streamly.Internal.Data.Stream.IsStream as Stream
2830import Streamly.Benchmark.Common
2931import Streamly.Benchmark.Prelude
3032
31−import Gauge
33+import Test.Tasty.Bench
3234
3335#ifdef INSPECTION
3436import GHC.Types (SPEC(..))
3537import Test.Inspection
3638
37−import qualified Streamly.Internal.Data.Stream.StreamD as D
39+import qualified Streamly.Internal.Data.Stream as D
3840#endif
3941
4042moduleName :: String
benchmark/Streamly/Benchmark/Prelude/Parallel.hs+3−1
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -20,7 +22,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream as Internal
2022import Streamly.Benchmark.Common
2123import Streamly.Benchmark.Prelude
2224
23−import Gauge
25+import Test.Tasty.Bench
2426
2527moduleName :: String
2628moduleName = "Prelude.Parallel"
benchmark/Streamly/Benchmark/Prelude/Rate.hs+2−1
@@ -1,3 +1,4 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
12{-# LANGUAGE FlexibleContexts #-}
23
34-- |
@@ -13,7 +14,7 @@ import qualified Streamly.Prelude as S
1314import Streamly.Benchmark.Common
1415import Streamly.Benchmark.Prelude
1516
16−import Gauge
17+import Test.Tasty.Bench
1718
1819moduleName :: String
1920moduleName = "Prelude.Rate"
benchmark/Streamly/Benchmark/Prelude/Serial.hsdeleted−53
@@ -1,53 +0,0 @@
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.NestedStream as NestedStream
20−import qualified Serial.Split as Split
21−import qualified Serial.Transformation as Transformation
22−import qualified Serial.NestedFold as NestedFold
23−import qualified Serial.Lift as Lift
24−
25−import Streamly.Benchmark.Common
26−
27−moduleName :: String
28−moduleName = "Prelude.Serial"
29−
30−-------------------------------------------------------------------------------
31−-- Main
32−-------------------------------------------------------------------------------
33−
34−-- In addition to gauge options, the number of elements in the stream can be
35−-- passed using the --stream-size option.
36−--
37−main :: IO ()
38−main = do
39− env <- mkHandleBenchEnv
40− runWithCLIOpts defaultStreamSize (allBenchmarks env)
41−
42− where
43−
44− allBenchmarks env size = Prelude.concat
45− [ Generation.benchmarks moduleName size
46− , Elimination.benchmarks moduleName size
47− , Exceptions.benchmarks moduleName env size
48− , Split.benchmarks moduleName env
49− , Transformation.benchmarks moduleName size
50− , NestedFold.benchmarks moduleName size
51− , Lift.benchmarks moduleName size
52− , NestedStream.benchmarks moduleName size
53− ]
benchmark/Streamly/Benchmark/Prelude/Serial/Generation.hsdeleted−179
@@ -1,179 +0,0 @@
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, fromSerial, 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 fromSerial "unfoldr" (sourceUnfoldr value)
122− , benchIOSrc fromSerial "unfoldrM" (sourceUnfoldrM value)
123− , benchIOSrc fromSerial "repeat" (repeat value)
124− , benchIOSrc fromSerial "repeatM" (repeatM value)
125− , benchIOSrc fromSerial "replicate" (replicate value)
126− , benchIOSrc fromSerial "replicateM" (replicateM value)
127− , benchIOSrc fromSerial "iterate" (iterate value)
128− , benchIOSrc fromSerial "iterateM" (iterateM value)
129− , benchIOSrc fromSerial "fromIndices" (fromIndices value)
130− , benchIOSrc fromSerial "fromIndicesM" (fromIndicesM value)
131− , benchIOSrc fromSerial "intFromTo" (sourceIntFromTo value)
132− , benchIOSrc fromSerial "intFromThenTo" (sourceIntFromThenTo value)
133− , benchIOSrc fromSerial "integerFromStep" (sourceIntegerFromStep value)
134− , benchIOSrc fromSerial "fracFromThenTo" (sourceFracFromThenTo value)
135− , benchIOSrc fromSerial "fracFromTo" (sourceFracFromTo value)
136− , benchIOSrc fromSerial "fromList" (sourceFromList value)
137− , benchPureSrc "IsList.fromList" (sourceIsList value)
138− , benchPureSrc "IsString.fromString" (sourceIsString value)
139− , benchIOSrc fromSerial "fromListM" (sourceFromListM value)
140− , benchIOSrc fromSerial "enumerateFrom" (enumerateFrom value)
141− , benchIOSrc fromSerial "enumerateFromTo" (enumerateFromTo value)
142− , benchIOSrc fromSerial "enumerateFromThen" (enumerateFromThen value)
143− , benchIOSrc fromSerial "enumerateFromThenTo" (enumerateFromThenTo value)
144− , benchIOSrc fromSerial "enumerate" (enumerate value)
145− , benchIOSrc fromSerial "enumerateTo" (enumerateTo value)
146−
147− -- These essentially test cons and consM
148− , benchIOSrc fromSerial "fromFoldable" (sourceFromFoldable value)
149− , benchIOSrc fromSerial "fromFoldableM" (sourceFromFoldableM value)
150−
151− , benchIOSrc fromSerial "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/Prelude/Serial/Lift.hsdeleted−123
@@ -1,123 +0,0 @@
1−-- |
2−-- Module : Serial.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−module Serial.Lift (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, fromSerial)
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 fromSerial "evalState" (evalStateT value)
59− , benchIOSrc fromSerial "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−{-# SPECIALIZE iterateState :: Int -> SerialT (StateT Int IO) Int #-}
88−iterateState ::
89− (S.MonadAsync m, MonadState Int m)
90− => Int
91− -> SerialT m Int
92−iterateState n = do
93− x <- get
94− if x > n
95− then do
96− put (x - 1)
97− iterateState n
98− else return x
99−
100−o_n_heap_transformer :: Int -> [Benchmark]
101−o_n_heap_transformer value =
102− [ bgroup "transformer"
103− [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
104− State.evalStateT (iterateStateIO n) value
105− , benchIO "SerialT (StateT Int IO) (n times)" $ \n ->
106− State.evalStateT (S.drain (iterateStateT n)) value
107− , benchIO "MonadState Int m => SerialT m Int" $ \n ->
108− State.evalStateT (S.drain (iterateState n)) value
109− ]
110− ]
111−
112−-------------------------------------------------------------------------------
113−-- Main
114−-------------------------------------------------------------------------------
115−
116−-- In addition to gauge options, the number of elements in the stream can be
117−-- passed using the --stream-size option.
118−--
119−benchmarks :: String -> Int -> [Benchmark]
120−benchmarks moduleName size =
121− [ bgroup (o_1_space_prefix moduleName) (o_1_space_hoisting size)
122− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_transformer size)
123− ]
benchmark/Streamly/Benchmark/Prelude/Serial/NestedFold.hsdeleted−487
@@ -1,487 +0,0 @@
1−-- |
2−-- Module : Serial.NestedFold
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−module Serial.NestedFold (benchmarks) where
15−
16−import Control.DeepSeq (NFData(..))
17−import Control.Monad (when)
18−import Control.Monad.IO.Class (MonadIO(..))
19−import Data.Monoid (Sum(..))
20−import Data.Proxy (Proxy(..))
21−import Data.HashMap.Strict (HashMap)
22−import GHC.Generics (Generic)
23−
24−import qualified Streamly.Internal.Data.Refold.Type as Refold
25−import qualified Streamly.Internal.Data.Fold as FL
26−import qualified Streamly.Internal.Data.Stream.IsStream as Internal
27−import qualified Streamly.Prelude as S
28−
29−import Gauge
30−import Streamly.Prelude (SerialT, fromSerial)
31−import Streamly.Benchmark.Common
32−import Streamly.Benchmark.Prelude
33−import Prelude hiding (reverse, tail)
34−
35−-------------------------------------------------------------------------------
36−-- Iteration/looping utilities
37−-------------------------------------------------------------------------------
38−
39−{-# INLINE iterateN #-}
40−iterateN :: (Int -> a -> a) -> a -> Int -> a
41−iterateN g initial count = f count initial
42−
43− where
44−
45− f (0 :: Int) x = x
46− f i x = f (i - 1) (g i x)
47−
48−-- Iterate a transformation over a singleton stream
49−{-# INLINE iterateSingleton #-}
50−iterateSingleton :: S.MonadAsync m
51− => (Int -> SerialT m Int -> SerialT m Int)
52− -> Int
53− -> Int
54− -> SerialT m Int
55−iterateSingleton g count n = iterateN g (return n) count
56−
57−-- XXX need to check why this is slower than the explicit recursion above, even
58−-- if the above code is written in a foldr like head recursive way. We also
59−-- need to try this with foldlM' once #150 is fixed.
60−-- However, it is perhaps best to keep the iteration benchmarks independent of
61−-- foldrM and any related fusion issues.
62−{-# INLINE _iterateSingleton #-}
63−_iterateSingleton ::
64− S.MonadAsync m
65− => (Int -> SerialT m Int -> SerialT m Int)
66− -> Int
67− -> Int
68− -> SerialT m Int
69−_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
70−
71−-- Apply transformation g count times on a stream of length len
72−{-# INLINE iterateSource #-}
73−iterateSource ::
74− S.MonadAsync m
75− => (SerialT m Int -> SerialT m Int)
76− -> Int
77− -> Int
78− -> Int
79− -> SerialT m Int
80−iterateSource g count len n = f count (sourceUnfoldrM len n)
81−
82− where
83−
84− f (0 :: Int) stream = stream
85− f i stream = f (i - 1) (g stream)
86−
87−-------------------------------------------------------------------------------
88−-- Functor
89−-------------------------------------------------------------------------------
90−
91−o_n_space_functor :: Int -> [Benchmark]
92−o_n_space_functor value =
93− [ bgroup "Functor"
94− [ benchIO "(+) (n times) (baseline)" $ \i0 ->
95− iterateN (\i acc -> acc >>= \n -> return $ i + n) (return i0) value
96− , benchIOSrc fromSerial "(<$) (n times)" $
97− iterateSingleton (<$) value
98− , benchIOSrc fromSerial "fmap (n times)" $
99− iterateSingleton (fmap . (+)) value
100− {-
101− , benchIOSrc fromSerial "_(<$) (n times)" $
102− _iterateSingleton (<$) value
103− , benchIOSrc fromSerial "_fmap (n times)" $
104− _iterateSingleton (fmap . (+)) value
105− -}
106− ]
107− ]
108−
109−-------------------------------------------------------------------------------
110−-- Grouping transformations
111−-------------------------------------------------------------------------------
112−
113−{-# INLINE groups #-}
114−groups :: MonadIO m => SerialT m Int -> m ()
115−groups = S.drain . S.groups FL.drain
116−
117−-- XXX Change this test when the order of comparison is later changed
118−{-# INLINE groupsByGT #-}
119−groupsByGT :: MonadIO m => SerialT m Int -> m ()
120−groupsByGT = S.drain . S.groupsBy (>) FL.drain
121−
122−{-# INLINE groupsByEq #-}
123−groupsByEq :: MonadIO m => SerialT m Int -> m ()
124−groupsByEq = S.drain . S.groupsBy (==) FL.drain
125−
126−-- XXX Change this test when the order of comparison is later changed
127−{-# INLINE groupsByRollingLT #-}
128−groupsByRollingLT :: MonadIO m => SerialT m Int -> m ()
129−groupsByRollingLT =
130− S.drain . S.groupsByRolling (<) FL.drain
131−
132−{-# INLINE groupsByRollingEq #-}
133−groupsByRollingEq :: MonadIO m => SerialT m Int -> m ()
134−groupsByRollingEq =
135− S.drain . S.groupsByRolling (==) FL.drain
136−
137−{-# INLINE foldMany #-}
138−foldMany :: Monad m => SerialT m Int -> m ()
139−foldMany =
140− S.drain
141− . S.map getSum
142− . Internal.foldMany (FL.take 2 FL.mconcat)
143− . S.map Sum
144−
145−{-# INLINE refoldMany #-}
146−refoldMany :: Monad m => SerialT m Int -> m ()
147−refoldMany =
148− S.drain
149− . S.map getSum
150− . Internal.refoldMany (Refold.take 2 Refold.sconcat) (return mempty)
151− . S.map Sum
152−
153−{-# INLINE foldIterateM #-}
154−foldIterateM :: Monad m => SerialT m Int -> m ()
155−foldIterateM =
156− S.drain
157− . S.map getSum
158− . Internal.foldIterateM
159− (return . FL.take 2 . FL.sconcat) (return (Sum 0))
160− . S.map Sum
161−
162−{-# INLINE refoldIterateM #-}
163−refoldIterateM :: Monad m => SerialT m Int -> m ()
164−refoldIterateM =
165− S.drain
166− . S.map getSum
167− . Internal.refoldIterateM
168− (Refold.take 2 Refold.sconcat) (return (Sum 0))
169− . S.map Sum
170−
171−o_1_space_grouping :: Int -> [Benchmark]
172−o_1_space_grouping value =
173− -- Buffering operations using heap proportional to group/window sizes.
174− [ bgroup "grouping"
175− [ benchIOSink value "groups" groups
176− , benchIOSink value "groupsByGT" groupsByGT
177− , benchIOSink value "groupsByEq" groupsByEq
178− , benchIOSink value "groupsByRollingLT" groupsByRollingLT
179− , benchIOSink value "groupsByRollingEq" groupsByRollingEq
180− , benchIOSink value "foldMany" foldMany
181− , benchIOSink value "refoldMany" refoldMany
182− , benchIOSink value "foldIterateM" foldIterateM
183− , benchIOSink value "refoldIterateM" refoldIterateM
184− ]
185− ]
186−
187−-------------------------------------------------------------------------------
188−-- Size conserving transformations (reordering, buffering, etc.)
189−-------------------------------------------------------------------------------
190−
191−{-# INLINE reverse #-}
192−reverse :: MonadIO m => Int -> SerialT m Int -> m ()
193−reverse n = composeN n S.reverse
194−
195−{-# INLINE reverse' #-}
196−reverse' :: MonadIO m => Int -> SerialT m Int -> m ()
197−reverse' n = composeN n Internal.reverse'
198−
199−o_n_heap_buffering :: Int -> [Benchmark]
200−o_n_heap_buffering value =
201− [ bgroup "buffered"
202− [
203− -- Reversing a stream
204− benchIOSink value "reverse" (reverse 1)
205− , benchIOSink value "reverse'" (reverse' 1)
206−
207− , benchIOSink value "mkAsync" (mkAsync fromSerial)
208− ]
209− ]
210−
211−-------------------------------------------------------------------------------
212−-- Grouping/Splitting
213−-------------------------------------------------------------------------------
214−
215−{-# INLINE classifySessionsOf #-}
216−classifySessionsOf :: S.MonadAsync m => (Int -> Int) -> SerialT m Int -> m ()
217−classifySessionsOf getKey =
218− S.drain
219− . Internal.classifySessionsOf
220− (const (return False)) 3 (FL.take 10 FL.sum)
221− . Internal.timestamped
222− . S.map (\x -> (getKey x, x))
223−
224−{-# INLINE classifySessionsOfHash #-}
225−classifySessionsOfHash :: S.MonadAsync m =>
226− (Int -> Int) -> SerialT m Int -> m ()
227−classifySessionsOfHash getKey =
228− S.drain
229− . Internal.classifySessionsByGeneric
230− (Proxy :: Proxy (HashMap k))
231− 1 False (const (return False)) 3 (FL.take 10 FL.sum)
232− . Internal.timestamped
233− . S.map (\x -> (getKey x, x))
234−
235−o_n_space_grouping :: Int -> [Benchmark]
236−o_n_space_grouping value =
237− -- Buffering operations using heap proportional to group/window sizes.
238− [ bgroup "grouping"
239− [ benchIOSink value "classifySessionsOf (10000 buckets)"
240− (classifySessionsOf (getKey 10000))
241− , benchIOSink value "classifySessionsOf (64 buckets)"
242− (classifySessionsOf (getKey 64))
243− , benchIOSink value "classifySessionsOfHash (10000 buckets)"
244− (classifySessionsOfHash (getKey 10000))
245− , benchIOSink value "classifySessionsOfHash (64 buckets)"
246− (classifySessionsOfHash (getKey 64))
247− ]
248− ]
249−
250− where
251−
252− getKey n = (`mod` n)
253−
254−-------------------------------------------------------------------------------
255−-- Mixed Transformation
256−-------------------------------------------------------------------------------
257−
258−{-# INLINE scanMap #-}
259−scanMap :: MonadIO m => Int -> SerialT m Int -> m ()
260−scanMap n = composeN n $ S.map (subtract 1) . S.scanl' (+) 0
261−
262−{-# INLINE dropMap #-}
263−dropMap :: MonadIO m => Int -> SerialT m Int -> m ()
264−dropMap n = composeN n $ S.map (subtract 1) . S.drop 1
265−
266−{-# INLINE dropScan #-}
267−dropScan :: MonadIO m => Int -> SerialT m Int -> m ()
268−dropScan n = composeN n $ S.scanl' (+) 0 . S.drop 1
269−
270−{-# INLINE takeDrop #-}
271−takeDrop :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
272−takeDrop value n = composeN n $ S.drop 1 . S.take (value + 1)
273−
274−{-# INLINE takeScan #-}
275−takeScan :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
276−takeScan value n = composeN n $ S.scanl' (+) 0 . S.take (value + 1)
277−
278−{-# INLINE takeMap #-}
279−takeMap :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
280−takeMap value n = composeN n $ S.map (subtract 1) . S.take (value + 1)
281−
282−{-# INLINE filterDrop #-}
283−filterDrop :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
284−filterDrop value n = composeN n $ S.drop 1 . S.filter (<= (value + 1))
285−
286−{-# INLINE filterTake #-}
287−filterTake :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
288−filterTake value n = composeN n $ S.take (value + 1) . S.filter (<= (value + 1))
289−
290−{-# INLINE filterScan #-}
291−filterScan :: MonadIO m => Int -> SerialT m Int -> m ()
292−filterScan n = composeN n $ S.scanl' (+) 0 . S.filter (<= maxBound)
293−
294−{-# INLINE filterScanl1 #-}
295−filterScanl1 :: MonadIO m => Int -> SerialT m Int -> m ()
296−filterScanl1 n = composeN n $ S.scanl1' (+) . S.filter (<= maxBound)
297−
298−{-# INLINE filterMap #-}
299−filterMap :: MonadIO m => Int -> Int -> SerialT m Int -> m ()
300−filterMap value n = composeN n $ S.map (subtract 1) . S.filter (<= (value + 1))
301−
302−-------------------------------------------------------------------------------
303−-- Scan and fold
304−-------------------------------------------------------------------------------
305−
306−data Pair a b =
307− Pair !a !b
308− deriving (Generic, NFData)
309−
310−{-# INLINE sumProductFold #-}
311−sumProductFold :: Monad m => SerialT m Int -> m (Int, Int)
312−sumProductFold = S.foldl' (\(s, p) x -> (s + x, p * x)) (0, 1)
313−
314−{-# INLINE sumProductScan #-}
315−sumProductScan :: Monad m => SerialT m Int -> m (Pair Int Int)
316−sumProductScan =
317− S.foldl' (\(Pair _ p) (s0, x) -> Pair s0 (p * x)) (Pair 0 1) .
318− S.scanl' (\(s, _) x -> (s + x, x)) (0, 0)
319−
320−{-# INLINE foldl'ReduceMap #-}
321−foldl'ReduceMap :: Monad m => SerialT m Int -> m Int
322−foldl'ReduceMap = fmap (+ 1) . S.foldl' (+) 0
323−
324−o_1_space_transformations_mixed :: Int -> [Benchmark]
325−o_1_space_transformations_mixed value =
326− -- scanl-map and foldl-map are equivalent to the scan and fold in the foldl
327− -- library. If scan/fold followed by a map is efficient enough we may not
328− -- need monolithic implementations of these.
329− [ bgroup "mixed"
330− [ benchIOSink value "scanl-map" (scanMap 1)
331− , benchIOSink value "foldl-map" foldl'ReduceMap
332− , benchIOSink value "sum-product-fold" sumProductFold
333− , benchIOSink value "sum-product-scan" sumProductScan
334− ]
335− ]
336−
337−o_1_space_transformations_mixedX4 :: Int -> [Benchmark]
338−o_1_space_transformations_mixedX4 value =
339− [ bgroup "mixedX4"
340− [ benchIOSink value "scan-map" (scanMap 4)
341− , benchIOSink value "drop-map" (dropMap 4)
342− , benchIOSink value "drop-scan" (dropScan 4)
343− , benchIOSink value "take-drop" (takeDrop value 4)
344− , benchIOSink value "take-scan" (takeScan value 4)
345− , benchIOSink value "take-map" (takeMap value 4)
346− , benchIOSink value "filter-drop" (filterDrop value 4)
347− , benchIOSink value "filter-take" (filterTake value 4)
348− , benchIOSink value "filter-scan" (filterScan 4)
349− , benchIOSink value "filter-scanl1" (filterScanl1 4)
350− , benchIOSink value "filter-map" (filterMap value 4)
351− ]
352− ]
353−
354−-------------------------------------------------------------------------------
355−-- Iterating a transformation over and over again
356−-------------------------------------------------------------------------------
357−
358−-- this is quadratic
359−{-# INLINE iterateScan #-}
360−iterateScan :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
361−iterateScan = iterateSource (S.scanl' (+) 0)
362−
363−-- this is quadratic
364−{-# INLINE iterateScanl1 #-}
365−iterateScanl1 :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
366−iterateScanl1 = iterateSource (S.scanl1' (+))
367−
368−{-# INLINE iterateMapM #-}
369−iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
370−iterateMapM = iterateSource (S.mapM return)
371−
372−{-# INLINE iterateFilterEven #-}
373−iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
374−iterateFilterEven = iterateSource (S.filter even)
375−
376−{-# INLINE iterateTakeAll #-}
377−iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> SerialT m Int
378−iterateTakeAll value = iterateSource (S.take (value + 1))
379−
380−{-# INLINE iterateDropOne #-}
381−iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> SerialT m Int
382−iterateDropOne = iterateSource (S.drop 1)
383−
384−{-# INLINE iterateDropWhileFalse #-}
385−iterateDropWhileFalse :: S.MonadAsync m
386− => Int -> Int -> Int -> Int -> SerialT m Int
387−iterateDropWhileFalse value = iterateSource (S.dropWhile (> (value + 1)))
388−
389−{-# INLINE iterateDropWhileTrue #-}
390−iterateDropWhileTrue :: S.MonadAsync m
391− => Int -> Int -> Int -> Int -> SerialT m Int
392−iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
393−
394−{-# INLINE tail #-}
395−tail :: Monad m => SerialT m a -> m ()
396−tail s = S.tail s >>= mapM_ tail
397−
398−{-# INLINE nullHeadTail #-}
399−nullHeadTail :: Monad m => SerialT m Int -> m ()
400−nullHeadTail s = do
401− r <- S.null s
402− when (not r) $ do
403− _ <- S.head s
404− S.tail s >>= mapM_ nullHeadTail
405−
406−-- Head recursive operations.
407−o_n_stack_iterated :: Int -> [Benchmark]
408−o_n_stack_iterated value = by10 `seq` by100 `seq`
409− [ bgroup "iterated"
410− [ benchIOSrc fromSerial "mapM (n/10 x 10)" $ iterateMapM by10 10
411− , benchIOSrc fromSerial "scanl' (quadratic) (n/100 x 100)" $
412− iterateScan by100 100
413− , benchIOSrc fromSerial "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
414− , benchIOSrc fromSerial "filterEven (n/10 x 10)" $
415− iterateFilterEven by10 10
416− , benchIOSrc fromSerial "takeAll (n/10 x 10)" $
417− iterateTakeAll value by10 10
418− , benchIOSrc fromSerial "dropOne (n/10 x 10)" $ iterateDropOne by10 10
419− , benchIOSrc fromSerial "dropWhileFalse (n/10 x 10)" $
420− iterateDropWhileFalse value by10 10
421− , benchIOSrc fromSerial "dropWhileTrue (n/10 x 10)" $
422− iterateDropWhileTrue value by10 10
423− , benchIOSink value "tail" tail
424− , benchIOSink value "nullHeadTail" nullHeadTail
425− ]
426− ]
427−
428− where
429−
430− by10 = value `div` 10
431− by100 = value `div` 100
432−
433−-------------------------------------------------------------------------------
434−-- Pipes
435−-------------------------------------------------------------------------------
436−
437−o_1_space_pipes :: Int -> [Benchmark]
438−o_1_space_pipes value =
439− [ bgroup "pipes"
440− [ benchIOSink value "mapM" (transformMapM fromSerial 1)
441− , benchIOSink value "compose" (transformComposeMapM fromSerial 1)
442− , benchIOSink value "tee" (transformTeeMapM fromSerial 1)
443−#ifdef DEVBUILD
444− -- XXX this take 1 GB memory to compile
445− , benchIOSink value "zip" (transformZipMapM fromSerial 1)
446−#endif
447− ]
448− ]
449−
450−o_1_space_pipesX4 :: Int -> [Benchmark]
451−o_1_space_pipesX4 value =
452− [ bgroup "pipesX4"
453− [ benchIOSink value "mapM" (transformMapM fromSerial 4)
454− , benchIOSink value "compose" (transformComposeMapM fromSerial 4)
455− , benchIOSink value "tee" (transformTeeMapM fromSerial 4)
456−#ifdef DEVBUILD
457− -- XXX this take 1 GB memory to compile
458− , benchIOSink value "zip" (transformZipMapM fromSerial 4)
459−#endif
460− ]
461− ]
462−
463−-------------------------------------------------------------------------------
464−-- Main
465−-------------------------------------------------------------------------------
466−
467−-- In addition to gauge options, the number of elements in the stream can be
468−-- passed using the --stream-size option.
469−--
470−benchmarks :: String -> Int -> [Benchmark]
471−benchmarks moduleName size =
472− [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
473− [ o_1_space_grouping size
474− , o_1_space_transformations_mixed size
475− , o_1_space_transformations_mixedX4 size
476−
477− -- pipes
478− , o_1_space_pipes size
479− , o_1_space_pipesX4 size
480− ]
481− , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
482− , bgroup (o_n_heap_prefix moduleName) $ Prelude.concat
483− [ o_n_space_grouping size
484− , o_n_space_functor size
485− , o_n_heap_buffering size
486− ]
487− ]
benchmark/Streamly/Benchmark/Prelude/WAsync.hs+3−1
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -13,7 +15,7 @@ import qualified Streamly.Prelude as S
1315import Streamly.Benchmark.Common
1416import Streamly.Benchmark.Prelude
1517
16−import Gauge
18+import Test.Tasty.Bench
1719
1820moduleName :: String
1921moduleName = "Prelude.WAsync"
benchmark/Streamly/Benchmark/Prelude/WSerial.hs+4−2
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -27,13 +29,13 @@ import qualified Streamly.Internal.Data.Unfold as UF
2729import Streamly.Benchmark.Common
2830import Streamly.Benchmark.Prelude
2931
30−import Gauge
32+import Test.Tasty.Bench
3133
3234#ifdef INSPECTION
3335import GHC.Types (SPEC(..))
3436import Test.Inspection
3537
36−import qualified Streamly.Internal.Data.Stream.StreamD as D
38+import qualified Streamly.Internal.Data.Stream as D
3739#endif
3840
3941moduleName :: String
benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+11−2
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -13,7 +15,7 @@ import qualified Streamly.Prelude as S
1315import Streamly.Benchmark.Common
1416import Streamly.Benchmark.Prelude
1517
16−import Gauge
18+import Test.Tasty.Bench
1719
1820moduleName :: String
1921moduleName = "Prelude.ZipAsync"
@@ -56,7 +58,13 @@ o_1_space_joining value =
5658 (value `div` 2))
5759 , benchIOSrc fromSerial "zipAsyncAp (2,x/2)" (zipAsyncAp (value `div` 2))
5860 , benchIOSink value "fmap zipAsyncly" $ fmapN S.fromZipAsync 1
59− , fromZipAsyncTraverse "ZipAsync Applicative (x/100)" (value `div` 100)
61+ ]
62+ ]
63+
64+o_n_heap_joining :: Int -> [Benchmark]
65+o_n_heap_joining value =
66+ [ bgroup "joining"
67+ [ fromZipAsyncTraverse "ZipAsync Applicative (x/100)" (value `div` 100)
6068 ]
6169 ]
6270
@@ -85,4 +93,5 @@ main = runWithCLIOpts defaultStreamSize allBenchmarks
8593 [ o_1_space_joining size
8694 , o_1_space_outerProduct size
8795 ]
96+ , bgroup (o_n_heap_prefix moduleName) $ o_n_heap_joining size
8897 ]
benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs+4−2
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Main
35-- Copyright : (c) 2018 Composewell Technologies
@@ -27,13 +29,13 @@ import qualified Streamly.Prelude as S
2729import Streamly.Benchmark.Common
2830import Streamly.Benchmark.Prelude hiding (sourceUnfoldrM)
2931
30−import Gauge
32+import Test.Tasty.Bench
3133
3234#ifdef INSPECTION
3335import GHC.Types (SPEC(..))
3436import Test.Inspection
3537
36−import qualified Streamly.Internal.Data.Stream.StreamD as D
38+import qualified Streamly.Internal.Data.Stream as D
3739#endif
3840
3941moduleName :: String
benchmark/Streamly/Benchmark/Unicode/Char.hs+18−10
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations -Wno-orphans #-}
2+
13--
24-- Module : Streamly.Unicode.Char
35-- Copyright : (c) 2021 Composewell Technologies
@@ -10,19 +12,19 @@
1012-- Imports
1113--------------------------------------------------------------------------------
1214
13−import Control.DeepSeq (NFData)
14−import Streamly.Internal.Data.Array.Foreign (Array)
15+import Control.DeepSeq (NFData(..))
16+import Streamly.Internal.Data.Array (Array)
1517import System.FilePath (dropExtensions, takeFileName)
1618import System.FilePath.Posix ((</>))
17−import Gauge.Main (Benchmark, bench, bgroup, defaultMain, env, nfIO)
19+import Test.Tasty.Bench (Benchmark, bench, bgroup, defaultMain, env, nfIO)
1820import Streamly.Internal.Unicode.Char
1921 ( NormalizationMode(NFC, NFD, NFKC, NFKD)
2022 , normalize
2123 )
2224import Streamly.Benchmark.Common (o_1_space_prefix)
2325
24−import qualified Streamly.Internal.Data.Array.Foreign as Array
25−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream
26+import qualified Streamly.Internal.Data.Array as Array
27+import qualified Streamly.Internal.Data.Stream as IsStream
2628import qualified System.Directory as Dir
2729
2830--------------------------------------------------------------------------------
@@ -41,7 +43,13 @@ dataDir = "benchmark/Streamly/Benchmark/Unicode/data"
4143dataSetSize :: Int
4244dataSetSize = 1000000
4345
44−makeBench :: (NFData a) => (String, a -> IO ()) -> (String, IO a) -> Benchmark
46+-- Unboxed arrays are fully evaluated.
47+instance NFData (Array a) where
48+ {-# INLINE rnf #-}
49+ rnf _ = ()
50+
51+makeBench ::
52+ (String, Array Char -> IO ()) -> (String, IO (Array Char)) -> Benchmark
4553makeBench (implName, func) (dataName, setup) =
4654 env setup (bench (implName ++ "/" ++ dataName) . nfIO . func)
4755
@@ -65,10 +73,10 @@ arrInput file = second (fmap Array.fromList) (strInput file)
6573
6674benchFunctions :: [(String, Array Char -> IO ())]
6775benchFunctions =
68− [ ("NFD", IsStream.drain . normalize NFD . Array.toStream)
69− , ("NFKD", IsStream.drain . normalize NFKD . Array.toStream)
70− , ("NFC", IsStream.drain . normalize NFC . Array.toStream)
71− , ("NFKC", IsStream.drain . normalize NFKC . Array.toStream)
76+ [ ("NFD", IsStream.drain . normalize NFD . Array.read)
77+ , ("NFKD", IsStream.drain . normalize NFKD . Array.read)
78+ , ("NFC", IsStream.drain . normalize NFC . Array.read)
79+ , ("NFKC", IsStream.drain . normalize NFKC . Array.read)
7280 ]
7381
7482main :: IO ()
benchmark/Streamly/Benchmark/Unicode/Parser.hsnew file+107
@@ -0,0 +1,107 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.Parser
3+-- Copyright : (c) 2020 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+
8+{-# LANGUAGE CPP #-}
9+{-# LANGUAGE FlexibleContexts #-}
10+{-# LANGUAGE ScopedTypeVariables #-}
11+{-# OPTIONS_GHC -Wno-orphans #-}
12+
13+#undef FUSION_CHECK
14+#ifdef FUSION_CHECK
15+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
16+#endif
17+
18+module Main
19+ (
20+ main
21+ ) where
22+
23+import Control.DeepSeq (NFData(..))
24+import Control.Monad (replicateM_)
25+import Streamly.Internal.Data.Parser (ParseError(..))
26+import Streamly.Internal.Data.Stream (Stream)
27+import Prelude hiding
28+ (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile)
29+
30+import qualified Streamly.Data.Array as Array
31+import qualified Streamly.Data.Stream as Stream
32+import qualified Streamly.Internal.Unicode.Parser as PRU
33+
34+import Test.Tasty.Bench hiding (env)
35+import Streamly.Benchmark.Common
36+
37+runParser :: Int -> (Stream IO Char -> IO a) -> IO ()
38+runParser count p = do
39+ let v = "+123456789.123456789e-123"
40+ let !(arr :: Array.Array Char) = Array.fromListN (length v) v
41+ let s = Stream.unfold Array.reader arr
42+ replicateM_ count (p s)
43+
44+-- | Takes a fold method, and uses it with a default source.
45+{-# INLINE benchIOSink #-}
46+benchIOSink :: Int -> String -> (Stream IO Char -> IO b) -> Benchmark
47+benchIOSink value name f = bench name $ nfIO $ runParser value f
48+
49+{-# INLINE doubleParser #-}
50+doubleParser :: Monad m => Stream m Char -> m (Either ParseError (Int, Int))
51+doubleParser = Stream.parse PRU.doubleParser
52+
53+{-# INLINE number #-}
54+number :: Monad m => Stream m Char -> m (Either ParseError (Integer, Int))
55+number = Stream.parse PRU.number
56+
57+{-# INLINE double #-}
58+double :: Monad m => Stream m Char -> m (Either ParseError Double)
59+double = Stream.parse PRU.double
60+
61+{-# INLINE numberDouble #-}
62+numberDouble :: Monad m => Stream m Char -> m (Either ParseError Double)
63+numberDouble = Stream.parse p
64+ where p = uncurry PRU.mkDouble <$> PRU.number
65+
66+-------------------------------------------------------------------------------
67+-- Benchmarks
68+-------------------------------------------------------------------------------
69+
70+moduleName :: String
71+moduleName = "Unicode.Parser"
72+
73+instance NFData ParseError where
74+ {-# INLINE rnf #-}
75+ rnf (ParseError x) = rnf x
76+
77+o_n_heap_serial :: Int -> [Benchmark]
78+o_n_heap_serial value =
79+ [
80+ benchIOSink value "doubleParser" doubleParser
81+ , benchIOSink value "number" number
82+ , benchIOSink value "double (doubleParser)" double
83+ , benchIOSink value "double (number)" numberDouble
84+ ]
85+
86+-------------------------------------------------------------------------------
87+-- Driver
88+-------------------------------------------------------------------------------
89+
90+main :: IO ()
91+main = do
92+#ifndef FUSION_CHECK
93+ runWithCLIOpts defaultStreamSize allBenchmarks
94+
95+ where
96+
97+ allBenchmarks value =
98+ [ bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
99+ ]
100+#else
101+ -- Enable FUSION_CHECK macro at the beginning of the file
102+ -- Enable one benchmark below, and run the benchmark
103+ -- Check the .dump-simpl output
104+ let value = 100000
105+ runParser value double
106+ return ()
107+#endif
benchmark/Streamly/Benchmark/Unicode/Stream.hs+60−34
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13--
24-- Module : Streamly.Unicode.Stream
35-- Copyright : (c) 2019 Composewell Technologies
@@ -9,6 +11,11 @@
911{-# LANGUAGE CPP #-}
1012{-# LANGUAGE ScopedTypeVariables #-}
1113
14+#undef FUSION_CHECK
15+#ifdef FUSION_CHECK
16+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
17+#endif
18+
1219#ifdef __HADDOCK_VERSION__
1320#undef INSPECTION
1421#endif
@@ -18,29 +25,30 @@
1825{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
1926#endif
2027
28+import Streamly.Data.Stream (Stream)
29+import Streamly.Data.Fold (Fold)
2130import Prelude hiding (last, length)
2231import System.IO (Handle)
2332
24−import qualified Streamly.Data.Array.Foreign as Array
33+import qualified Streamly.Data.Array as Array
2534import qualified Streamly.Data.Fold as Fold
26−import qualified Streamly.FileSystem.Handle as Handle
27−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
35+import qualified Streamly.Internal.Data.Stream as Stream
2836import qualified Streamly.Internal.Data.Unfold as Unfold
2937import qualified Streamly.Internal.FileSystem.Handle as Handle
30−import qualified Streamly.Internal.Unicode.Array.Char as UnicodeArr
38+import qualified Streamly.Internal.Unicode.Array as UnicodeArr
3139import qualified Streamly.Internal.Unicode.Stream as Unicode
3240
33−import Gauge hiding (env)
41+import Test.Tasty.Bench hiding (env)
3442import Streamly.Benchmark.Common
3543import Streamly.Benchmark.Common.Handle
3644
3745#ifdef INSPECTION
38−import Foreign.Storable (Storable)
39−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
40−import qualified Streamly.Internal.Data.Fold.Type as Fold
46+import Streamly.Internal.Data.MutByteArray (Unbox)
47+import Streamly.Internal.Data.Stream (Step(..))
48+import qualified Streamly.Internal.Data.Array as Array
49+import qualified Streamly.Internal.Data.MutArray as MutArray
50+import qualified Streamly.Internal.Data.Fold as Fold
4151import qualified Streamly.Internal.Data.Tuple.Strict as Strict
42−import qualified Streamly.Internal.Data.Array.Foreign.Type as Array
43−import qualified Streamly.Internal.Data.Array.Foreign.Mut.Type as MArray
4452
4553import Test.Inspection
4654#endif
@@ -54,8 +62,8 @@ copyCodecUtf8ArraysLenient :: Handle -> Handle -> IO ()
5462copyCodecUtf8ArraysLenient inh outh =
5563 Stream.fold (Handle.write outh)
5664 $ Unicode.encodeUtf8'
57− $ Unicode.decodeUtf8Arrays
58− $ Handle.getChunks inh
65+ $ Unicode.decodeUtf8Chunks
66+ $ Handle.readChunks inh
5967
6068#ifdef INSPECTION
6169inspect $ hasNoTypeClasses 'copyCodecUtf8ArraysLenient
@@ -75,23 +83,29 @@ o_1_space_decode_encode_chunked env =
7583-- copy with group/ungroup transformations
7684-------------------------------------------------------------------------------
7785
86+{-# INLINE splitOnSuffix #-}
87+splitOnSuffix
88+ :: (Monad m)
89+ => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
90+splitOnSuffix predicate f = Stream.foldMany (Fold.takeEndBy_ predicate f)
91+
7892{-# NOINLINE linesUnlinesCopy #-}
7993linesUnlinesCopy :: Handle -> Handle -> IO ()
8094linesUnlinesCopy inh outh =
8195 Stream.fold (Handle.write outh)
8296 $ Unicode.encodeLatin1'
8397 $ Unicode.unlines Unfold.fromList
84− $ Stream.splitOnSuffix (== '\n') Fold.toList
98+ $ splitOnSuffix (== '\n') Fold.toList
8599 $ Unicode.decodeLatin1
86− $ Stream.unfold Handle.read inh
100+ $ Stream.unfold Handle.reader inh
87101
88102{-# NOINLINE linesUnlinesArrayWord8Copy #-}
89103linesUnlinesArrayWord8Copy :: Handle -> Handle -> IO ()
90104linesUnlinesArrayWord8Copy inh outh =
91105 Stream.fold (Handle.write outh)
92− $ Stream.interposeSuffix 10 Array.read
93− $ Stream.splitOnSuffix (== 10) Array.write
94− $ Stream.unfold Handle.read inh
106+ $ Stream.interposeSuffix 10 Array.reader
107+ $ splitOnSuffix (== 10) Array.write
108+ $ Stream.unfold Handle.reader inh
95109
96110-- XXX splitSuffixOn requires -funfolding-use-threshold=150 for better fusion
97111-- | Lines and unlines
@@ -103,10 +117,10 @@ linesUnlinesArrayCharCopy inh outh =
103117 $ UnicodeArr.unlines
104118 $ UnicodeArr.lines
105119 $ Unicode.decodeLatin1
106− $ Stream.unfold Handle.read inh
120+ $ Stream.unfold Handle.reader inh
107121
108122#ifdef INSPECTION
109−inspect $ hasNoTypeClassesExcept 'linesUnlinesArrayCharCopy [''Storable]
123+inspect $ hasNoTypeClassesExcept 'linesUnlinesArrayCharCopy [''Unbox]
110124-- inspect $ 'linesUnlinesArrayCharCopy `hasNoType` ''Step
111125#endif
112126
@@ -131,7 +145,7 @@ wordsUnwordsCopyWord8 inh outh =
131145 Stream.fold (Handle.write outh)
132146 $ Stream.interposeSuffix 32 Unfold.fromList
133147 $ Stream.wordsBy isSp Fold.toList
134− $ Stream.unfold Handle.read inh
148+ $ Stream.unfold Handle.reader inh
135149
136150#ifdef INSPECTION
137151inspect $ hasNoTypeClasses 'wordsUnwordsCopyWord8
@@ -155,7 +169,7 @@ wordsUnwordsCopy inh outh =
155169 $ Stream.wordsBy isSpace Fold.toList
156170 -- -- $ Stream.splitOn isSpace Fold.toList
157171 $ Unicode.decodeLatin1
158− $ Stream.unfold Handle.read inh
172+ $ Stream.unfold Handle.reader inh
159173
160174#ifdef INSPECTION
161175-- inspect $ hasNoTypeClasses 'wordsUnwordsCopy
@@ -170,7 +184,7 @@ wordsUnwordsCharArrayCopy inh outh =
170184 $ UnicodeArr.unwords
171185 $ UnicodeArr.words
172186 $ Unicode.decodeLatin1
173− $ Stream.unfold Handle.read inh
187+ $ Stream.unfold Handle.reader inh
174188
175189o_1_space_copy_read_group_ungroup :: BenchEnv -> [Benchmark]
176190o_1_space_copy_read_group_ungroup env =
@@ -202,16 +216,16 @@ copyStreamLatin1' inh outh =
202216 Stream.fold (Handle.write outh)
203217 $ Unicode.encodeLatin1'
204218 $ Unicode.decodeLatin1
205− $ Stream.unfold Handle.read inh
219+ $ Stream.unfold Handle.reader inh
206220
207221#ifdef INSPECTION
208222inspect $ hasNoTypeClasses 'copyStreamLatin1'
209223inspect $ 'copyStreamLatin1' `hasNoType` ''Step
210224inspect $ 'copyStreamLatin1' `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.many
211−inspect $ 'copyStreamLatin1' `hasNoType` ''MArray.ReadUState -- Handle.read/Array.read
212225
213226inspect $ 'copyStreamLatin1' `hasNoType` ''Fold.Step
214−inspect $ 'copyStreamLatin1' `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
227+inspect $ 'copyStreamLatin1' `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
228+ -- Handle.read/Array.read
215229inspect $ 'copyStreamLatin1' `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
216230#endif
217231
@@ -222,17 +236,17 @@ copyStreamLatin1 inh outh =
222236 Stream.fold (Handle.write outh)
223237 $ Unicode.encodeLatin1
224238 $ Unicode.decodeLatin1
225− $ Stream.unfold Handle.read inh
239+ $ Stream.unfold Handle.reader inh
226240
227241#ifdef INSPECTION
228242inspect $ hasNoTypeClasses 'copyStreamLatin1
229243inspect $ 'copyStreamLatin1 `hasNoType` ''Step
230244inspect $ 'copyStreamLatin1 `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.many
231−inspect $ 'copyStreamLatin1 `hasNoType` ''MArray.ReadUState -- Handle.read/Array.read
232245
233246inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.ManyState
234247inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.Step
235−inspect $ 'copyStreamLatin1 `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
248+inspect $ 'copyStreamLatin1 `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
249+ -- Handle.read/Array.read
236250inspect $ 'copyStreamLatin1 `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
237251#endif
238252
@@ -242,7 +256,7 @@ _copyStreamUtf8' inh outh =
242256 Stream.fold (Handle.write outh)
243257 $ Unicode.encodeUtf8'
244258 $ Unicode.decodeUtf8'
245− $ Stream.unfold Handle.read inh
259+ $ Stream.unfold Handle.reader inh
246260
247261#ifdef INSPECTION
248262inspect $ hasNoTypeClasses '_copyStreamUtf8'
@@ -258,7 +272,7 @@ copyStreamUtf8 inh outh =
258272 Stream.fold (Handle.write outh)
259273 $ Unicode.encodeUtf8
260274 $ Unicode.decodeUtf8
261− $ Stream.unfold Handle.read inh
275+ $ Stream.unfold Handle.reader inh
262276
263277#ifdef INSPECTION
264278inspect $ hasNoTypeClasses 'copyStreamUtf8
@@ -272,17 +286,18 @@ _copyStreamUtf8'Fold :: Handle -> Handle -> IO ()
272286_copyStreamUtf8'Fold inh outh =
273287 Stream.fold (Handle.write outh)
274288 $ Unicode.encodeUtf8
275− $ Stream.foldMany Unicode.writeCharUtf8'
276− $ Stream.unfold Handle.read inh
289+ $ Stream.catRights
290+ $ Stream.parseMany Unicode.writeCharUtf8'
291+ $ Stream.unfold Handle.reader inh
277292
278293{-# NOINLINE _copyStreamUtf8Parser #-}
279294_copyStreamUtf8Parser :: Handle -> Handle -> IO ()
280295_copyStreamUtf8Parser inh outh =
281296 Stream.fold (Handle.write outh)
282297 $ Unicode.encodeUtf8
283− $ Stream.parseMany
298+ $ Stream.catRights $ Stream.parseMany
284299 (Unicode.parseCharUtf8With Unicode.TransliterateCodingFailure)
285− $ Stream.unfold Handle.read inh
300+ $ Stream.unfold Handle.reader inh
286301
287302o_1_space_decode_encode_read :: BenchEnv -> [Benchmark]
288303o_1_space_decode_encode_read env =
@@ -309,6 +324,7 @@ o_1_space_decode_encode_read env =
309324
310325main :: IO ()
311326main = do
327+#ifndef FUSION_CHECK
312328 env <- mkHandleBenchEnv
313329 defaultMain (allBenchmarks env)
314330
@@ -321,3 +337,13 @@ main = do
321337 , o_1_space_decode_encode_read env
322338 ]
323339 ]
340+#else
341+ -- Enable FUSION_CHECK macro at the beginning of the file
342+ -- Enable one benchmark below, and run the benchmark
343+ -- Check the .dump-simpl output
344+ env <- mkHandleBenchEnv
345+ let mkHandles (RefHandles {bigInH = inh, outputH = outh}) = Handles inh outh
346+ (Handles inh outh) <- getHandles env mkHandles
347+ copyStreamLatin1' inh outh
348+ return ()
349+#endif
benchmark/Streamly/Benchmark/Unicode/Utf8.hs+3−3
@@ -13,7 +13,7 @@
1313import Data.Char (chr)
1414import Streamly.Internal.Unicode.Utf8 (Utf8)
1515
16−import Gauge hiding (env)
16+import Test.Tasty.Bench hiding (env)
1717import Streamly.Benchmark.Common
1818
1919import qualified Streamly.Internal.Unicode.Utf8 as Utf8
@@ -49,7 +49,7 @@ main = runWithCLIOpts defaultStreamSize allBenchmarks
4949 allBenchmarks value =
5050 [ bgroup
5151 moduleName
52− [ bench "pack" $ nf pack value
53− , bench "pack + unpack" $ nf packUnpack value
52+ [ bench "pack" $ whnf pack value
53+ , bench "pack + unpack" $ whnf packUnpack value
5454 ]
5555 ]
benchmark/bench-report/BenchReport.hsdeleted−272
@@ -1,272 +0,0 @@
1−{-# LANGUAGE RecordWildCards #-}
2−{-# LANGUAGE ScopedTypeVariables #-}
3−
4−module Main where
5−
6−import Control.Exception (catch, ErrorCall(..))
7−import Control.Monad (mzero)
8−import Control.Monad.IO.Class (liftIO)
9−import Control.Monad.Trans.Maybe
10−import Control.Monad.Trans.State
11−import Data.Char (toLower)
12−import Data.List
13−import System.Environment (getArgs)
14−import Text.Read (readMaybe)
15−
16−import BenchShow
17−
18−------------------------------------------------------------------------------
19−-- Command line parsing
20−------------------------------------------------------------------------------
21−
22−data BenchType
23− = Compare String
24− | Standard String
25− deriving Show
26−
27−data Options = Options
28− { genGraphs :: Bool
29− , sortByName :: Bool
30− , useGauge :: Bool
31− , benchType :: Maybe BenchType
32− , fields :: [String]
33− , diffStyle :: GroupStyle
34− , cutOffPercent :: Double
35− } deriving Show
36−
37−defaultOptions :: Options
38−defaultOptions = Options False False False Nothing ["time"] PercentDiff 0
39−
40−setGenGraphs :: Monad m => Bool -> StateT (a, Options) m ()
41−setGenGraphs val = do
42− (args, opts) <- get
43− put (args, opts { genGraphs = val })
44−
45−setSortByName :: Monad m => Bool -> StateT (a, Options) m ()
46−setSortByName val = do
47− (args, opts) <- get
48− put (args, opts { sortByName = val })
49−
50−setUseGauge :: Monad m => Bool -> StateT (a, Options) m ()
51−setUseGauge val = do
52− (args, opts) <- get
53− put (args, opts { useGauge = val })
54−
55−setBenchType :: Monad m => BenchType -> StateT (a, Options) m ()
56−setBenchType val = do
57− (args, opts) <- get
58− put (args, opts { benchType = Just val })
59−
60−setFields :: Monad m => [String] -> StateT (a, Options) m ()
61−setFields val = do
62− (args, opts) <- get
63− put (args, opts { fields = val })
64−
65−setDiff :: Monad m => String -> StateT (a, Options) m ()
66−setDiff val = do
67− (args, opts) <- get
68− let cmpStyle =
69− case val of
70− "absolute" -> Absolute
71− "multiples" -> Multiples
72− "percent" -> PercentDiff
73− x -> error $ "Unknown diff option: " ++ show x
74− in put (args, opts { diffStyle = cmpStyle })
75−
76−setCutOff :: Monad m => String -> StateT (a, Options) m ()
77−setCutOff val = do
78− (args, opts) <- get
79− case readMaybe val of
80− Just x -> put (args, opts { cutOffPercent = x })
81− Nothing -> error $ "Invalid cutoff value: " ++ show val
82−
83−-- Like the shell "shift" to shift the command line arguments
84−shift :: StateT ([String], Options) (MaybeT IO) (Maybe String)
85−shift = do
86− s <- get
87− case s of
88− ([], _) -> return Nothing
89− (x : xs, opts) -> put (xs, opts) >> return (Just x)
90−
91−parseBench :: StateT ([String], Options) (MaybeT IO) ()
92−parseBench = do
93− x <- shift
94− case x of
95− Just str | "_cmp" `isSuffixOf` str -> setBenchType (Compare str)
96− Just str -> setBenchType (Standard str)
97− Nothing -> do
98− liftIO $ putStrLn "please provide a benchmark type "
99− mzero
100−
101−parseFields :: StateT ([String], Options) (MaybeT IO) ()
102−parseFields = do
103− x <- shift
104− case x of
105− Just str -> setFields (words str)
106− Nothing -> do
107− liftIO $ putStrLn
108− "please provide a list of fields after --fields"
109− mzero
110−
111−parseDiff :: StateT ([String], Options) (MaybeT IO) ()
112−parseDiff = do
113− x <- shift
114− case x of
115− Just str -> setDiff str
116− Nothing -> do
117− liftIO $ putStrLn "please provide a diff type"
118− mzero
119−
120−parseCutOff :: StateT ([String], Options) (MaybeT IO) ()
121−parseCutOff = do
122− x <- shift
123− case x of
124− Just str -> setCutOff str
125− Nothing -> do
126− liftIO $ putStrLn "please provide a cutoff percent"
127− mzero
128−
129−-- totally imperative style option parsing
130−parseOptions :: IO (Maybe Options)
131−parseOptions = do
132− args <- getArgs
133− runMaybeT $ flip evalStateT (args, defaultOptions) $ do
134− parseLoop
135− fmap snd get
136−
137− where
138−
139− parseOpt opt =
140− case opt of
141− "--graphs" -> setGenGraphs True
142− "--sort-by-name" -> setSortByName True
143− "--use-gauge" -> setUseGauge True
144− "--benchmark" -> parseBench
145− "--fields" -> parseFields
146− "--diff-style" -> parseDiff
147− "--diff-cutoff-percent" -> parseCutOff
148− str -> do
149− liftIO $ putStrLn $ "Unrecognized option " <> str
150− mzero
151−
152− parseLoop = do
153− next <- shift
154− case next of
155− Just opt -> parseOpt opt >> parseLoop
156− Nothing -> return ()
157−
158−ignoringErr :: IO () -> IO ()
159−ignoringErr a = catch a (\(ErrorCall err :: ErrorCall) ->
160− putStrLn $ "Failed with error:\n" <> err <> "\nSkipping.")
161−
162−------------------------------------------------------------------------------
163−-- Generic
164−------------------------------------------------------------------------------
165−
166−makeGraphs :: String -> Config -> String -> IO ()
167−makeGraphs name cfg inputFile =
168− ignoringErr $ graph inputFile name cfg
169−
170−------------------------------------------------------------------------------
171−-- Arrays
172−------------------------------------------------------------------------------
173−
174−showComparisons :: Options -> Config -> FilePath -> FilePath -> IO ()
175−showComparisons Options{..} cfg inp out =
176− let cfg1 = cfg { classifyBenchmark = classifyComparison }
177− in if genGraphs
178− then ignoringErr $ graph inp "comparison"
179− cfg1 { outputDir = Just out
180− , presentation = Groups Absolute
181− }
182− else ignoringErr $ report inp Nothing cfg1
183−
184− where
185−
186− separator = if useGauge then '/' else '.'
187− dropComponent sep = dropWhile (== sep) . dropWhile (/= sep)
188−
189− -- In case of tasty-bench the names could be like
190− -- All.Data.Array.Prim.Pinned/o-1-space.generation.show
191− -- All.Data.Array.Foreign/o-1-space.generation.show
192− classifyComparison b =
193− let b1 =
194− if useGauge
195− then b
196− else dropComponent separator b --- drop "All." at the beginning
197− in Just
198− ( takeWhile (/= '/') b1
199− , dropComponent '/' b1 -- for tasty-bench drop up to "/"
200− )
201−
202−------------------------------------------------------------------------------
203−-- text reports
204−------------------------------------------------------------------------------
205−
206−selectBench
207− :: Options
208− -> (SortColumn -> Maybe GroupStyle -> Either String [(String, Double)])
209− -> [String]
210−selectBench Options{..} f =
211− -- Apply filterPred only if at least 2 columns exist
212− let colVals =
213− case f (ColumnIndex 1) (Just PercentDiff) of
214− Left _ -> either error id $ f (ColumnIndex 0) (Just PercentDiff)
215− Right xs -> filter (filterPred . snd) xs
216− in reverse
217− $ fmap fst
218− $ sortFunc colVals
219−
220− where
221−
222− sortFunc = if sortByName then sortOn fst else sortOn snd
223−
224− filterPred x
225− | isInfinite x = False
226− | isNaN x = False
227− | cutOffPercent > 0 = x >= cutOffPercent
228− | cutOffPercent < 0 = x <= cutOffPercent
229− | otherwise = True
230−
231−benchShow ::
232− Options
233− -> Config
234− -> (Config -> String -> IO ())
235− -> String
236− -> FilePath
237− -> IO ()
238−benchShow Options{..} cfg func inp out =
239− if genGraphs
240− then func cfg {outputDir = Just out} inp
241− else ignoringErr $ report inp Nothing cfg
242−
243−main :: IO ()
244−main = do
245− res <- parseOptions
246− case res of
247− Nothing -> do
248− putStrLn "cannot parse options"
249− return ()
250− Just opts@Options{fields = fs, benchType = btype} ->
251− let cfg = defaultConfig
252− { presentation = Groups (diffStyle opts)
253− , selectBenchmarks = selectBench opts
254− , selectFields = filter
255− ( flip elem (fmap (fmap toLower) fs)
256− . fmap toLower
257− )
258− }
259− in case btype of
260− Just (Compare str) ->
261− showComparisons opts cfg
262− { title = Just str }
263− ("charts/" ++ str ++ "/results.csv")
264− ("charts/" ++ str)
265− Just (Standard str) ->
266− benchShow opts cfg
267− { title = Just str }
268− (makeGraphs str)
269− ("charts/" ++ str ++ "/results.csv")
270− ("charts/" ++ str)
271− Nothing ->
272− error "Please specify a benchmark using --benchmark."
benchmark/bench-report/bench-report.cabaldeleted−23
@@ -1,23 +0,0 @@
1−cabal-version: 2.2
2−name: bench-report
3−version: 0.0.0
4−synopsis: Benchmark report generation
5−description: Benchmark reporting application is not included in the overall
6− cabal project so that the dependencies of both can remain independent.
7− Benchmark reporting has a lot of dependencies that usually lag behind
8− when new GHC releases arrive.
9−
10−-------------------------------------------------------------------------------
11−-- benchmark comparison and presentation
12−-------------------------------------------------------------------------------
13−
14−executable bench-report
15− default-language: Haskell2010
16− ghc-options: -Wall
17− hs-source-dirs: .
18− main-is: BenchReport.hs
19− buildable: True
20− build-Depends:
21− base >= 4.9 && < 4.17
22− , bench-show >= 0.3.2 && < 0.4
23− , transformers >= 0.4 && < 0.6
benchmark/bench-report/bin/bench-runner.shdeleted−685
@@ -1,685 +0,0 @@
1−#!/usr/bin/env bash
2−
3−# Note that this script is used in the "streamly" package as well as
4−# in "streaming-benchmarks" package. Any changes to the script should be
5−# generic enough so that it works in both the cases.
6−
7−#------------------------------------------------------------------------------
8−
9−set -o pipefail
10−
11−SCRIPT_DIR=$(cd `dirname $0`; pwd)
12−
13−RUNNING_BENCHMARKS=y
14−source $SCRIPT_DIR/build-lib.sh
15−
16−print_help () {
17− echo "Usage: $0 "
18− echo " [--benchmarks <"bench1 bench2 ..." | help>]"
19− echo " [--prefix <benchmark name prefix to match>"
20− echo " [--fields <"field1 field2 ..." | help>]"
21− echo " [--sort-by-name]"
22− echo " [--compare]"
23− echo " [--diff-style <absolute|percent|multiples>]"
24− echo " [--diff-cutoff-percent <percent-value>]"
25− echo " [--graphs]"
26− echo " [--silent]"
27− echo " [--no-measure]"
28− echo " [--append]"
29− echo " [--long]"
30− echo " [--slow]"
31− echo " [--quick]"
32− echo " [--raw]"
33− echo " [--dev-build]"
34− echo " [--use-nix]"
35− echo " [--with-compiler <compiler exe name>]"
36− echo " [--cabal-build-options <options>]"
37− echo " [--rtsopts <opts>]"
38− #echo " [--commit-compare] [--base <commit>] [--candidate <commit>]"
39− #echo " -- <gauge options or benchmarks>"
40− echo
41− echo "--benchmarks: benchmarks to run, use 'help' for list of benchmarks"
42− echo "--compare: compare the specified benchmarks with each other"
43−
44− echo "--diff-cutoff-percent: Diff percentage used for benchmark selection."
45− echo "This applies only to the second column of the report and makes sense"
46− echo "only while comparing benchmarks."
47− echo "A positive cutoff value selects only regressions, whereas, a negative"
48− echo "cutoff value selects only improvements."
49−
50− echo "--fields: measurement fields to report, use 'help' for a list"
51− echo "--graphs: Generate graphical reports"
52− echo "--no-measure: Don't run benchmarks, run reports from previous results"
53− echo "--append: Don't overwrite previous results, append for comparison"
54− echo "--long: Use much longer stream size for infinite stream benchmarks"
55− echo "--slow: Slightly more accurate results at the expense of speed"
56− echo "--quick: Faster results, useful for longer benchmarks"
57− echo "--raw: Run the benchmarks but don't report them. This is useful when"
58− echo " you only want to work with the csv files generated."
59− echo "--cabal-build-options: Pass any cabal build options to be used for build"
60− echo " e.g. --cabal-build-options \"--flag dev\""
61− echo
62− echo "When specific space complexity group is chosen then (and only then) "
63− echo "RTS memory restrictions are used accordingly. For example, "
64− echo "bench.sh --benchmarks Data.Parser -- Data.Parser/o-1-space "
65− echo "restricts Heap/Stack space for O(1) characterstics"
66− echo
67− #echo "When using --commit-compare, by default comparative chart of HEAD^ vs HEAD"
68− #echo "commit is generated, in the 'charts' directory."
69− #echo "Use --base and --candidate to select the commits to compare."
70− #echo
71− #echo "Any arguments after a '--' are passed directly to gauge"
72− exit
73−}
74−
75−#-----------------------------------------------------------------------------
76−# Reporting utility functions
77−#-----------------------------------------------------------------------------
78−
79−list_comparisons () {
80− echo "Comparison groups:"
81− for i in $COMPARISONS
82− do
83− echo -n "$i ["
84− eval "echo -n \$$i"
85− echo "]"
86− done
87− echo
88−}
89−
90−build_report_prog() {
91− local prog_path=$BENCH_REPORT_DIR/bin/bench-report
92−
93− hash -r
94− if test ! -x "$prog_path" -a "$BUILD_ONCE" = "0"
95− then
96− echo "Building bench-report executables"
97− BUILD_ONCE=1
98− pushd $BENCH_REPORT_DIR
99− local cmd
100− cmd="$CABAL_EXECUTABLE install --installdir bin bench-report"
101− if test "$USE_NIX" -eq 0
102− then
103− $cmd || die "bench-report build failed"
104− else
105− nix-shell --run "$cmd" || die "bench-report build failed"
106− fi
107− popd
108− elif test ! -x "$prog_path"
109− then
110− return 1
111− fi
112− return 0
113−}
114−
115−build_report_progs() {
116− if test "$RAW" = "0"
117− then
118− build_report_prog || exit 1
119− local prog
120− prog=$BENCH_REPORT_DIR/bin/bench-report
121− test -x $prog || die "Cannot find bench-report executable"
122− echo "Using bench-report executable [$prog]"
123− fi
124−}
125−
126−# We run the benchmarks in isolation in a separate process so that different
127−# benchmarks do not interfere with other. To enable that we need to pass the
128−# benchmark exe path to gauge as an argument. Unfortunately it cannot find its
129−# own path currently.
130−
131−# The path is dependent on the architecture and cabal version.
132−
133−bench_output_file() {
134− local bench_name=$1
135− echo "charts/$bench_name/results.csv"
136−}
137−
138−#------------------------------------------------------------------------------
139−# Speed options
140−#------------------------------------------------------------------------------
141−
142−# tasty-bench does not like an option set twice
143−set_super_quick_mode () {
144− echo -n super_quick
145−}
146−
147−# For certain long benchmarks if the user has not requested super quick
148−# mode we anyway use a slightly quicker mode.
149−use_quicker_mode () {
150− if test "$QUICK_MODE" -eq 0
151− then
152− echo quicker
153− fi
154−}
155−
156−#------------------------------------------------------------------------------
157−# Determine options from benchmark name
158−#------------------------------------------------------------------------------
159−
160−# Global environment passed:
161−# BENCH_EXEC_PATH: the benchmark executable
162−# RTS_OPTIONS: additional RTS options
163−# QUICK_MODE: whether we are in quick mode
164−# USE_GAUGE: whether to use gauge or tasty-bench
165−# LONG: whether to use a large stream size
166−
167−# $1: bench name
168−bench_exec_one() {
169− local BENCH_NAME_ORIG
170− BENCH_NAME_ORIG="$1"
171− shift
172−
173− local SUPER_QUICK_OPTIONS
174− local QUICKER_OPTIONS
175− if test "$USE_GAUGE" -eq 0
176− then
177− SUPER_QUICK_OPTIONS="--stdev 1000000"
178− QUICKER_OPTIONS="--stdev 100"
179− else
180− # Do not keep time limit as 0 otherwise GC stats may remain 0 in some cases.
181− SUPER_QUICK_OPTIONS="--quick --min-duration 0 --time-limit 0.01 --include-first-iter"
182− QUICKER_OPTIONS="--min-samples 3 --time-limit 1"
183− fi
184−
185− local BENCH_NAME0
186− local BENCH_NAME1
187− local BENCH_NAME2
188− local BENCH_NAME
189− # XXX this is a hack to make the "/" separated names used in the functions
190− # determining options based on benchmark name. For tasty-bench the benchmark
191− # names are separated by "." instead of "/" and are prefixed by "All".
192− #
193− # For example, All.Prelude.Serial/x.y.z => Prelude.Serial/x/y/z
194− if test "$USE_GAUGE" -eq 0
195− then
196− # Remove the prefix "All."
197− BENCH_NAME0=$(echo $BENCH_NAME_ORIG | sed -e s/^All\.//)
198−
199− # Module names could contain dots e.g. "Prelude.Serial". So we insert
200− # an explicit "/" to separate the module name part and the rest of
201− # the benchmark name. For example, Prelude.Serial/elimination.drain
202− BENCH_NAME1=$(echo $BENCH_NAME0 | cut -f1 -d '/')
203−
204− if test "$BENCH_NAME1" = "$BENCH_NAME0"
205− then
206− # There is no "/" separator
207− BENCH_NAME1=$(echo $BENCH_NAME0 | sed -e 's/\./\//g')
208− BENCH_NAME2=""
209− else
210− BENCH_NAME2=/$(echo $BENCH_NAME0 | cut -f2- -d '/' | sed -e 's/\./\//g')
211− fi
212− BENCH_NAME="${BENCH_NAME1}${BENCH_NAME2}"
213− else
214− BENCH_NAME=$BENCH_NAME_ORIG
215− fi
216−
217− local RTS_OPTIONS1
218− RTS_OPTIONS1="\
219−+RTS -T \
220−$(bench_rts_options $(basename $BENCH_EXEC_PATH) $BENCH_NAME) \
221−$RTS_OPTIONS \
222−-RTS"
223−
224− local QUICK_MODE_TYPE
225− QUICK_MODE_TYPE="\
226− $(if test "$QUICK_MODE" -ne 0; then set_super_quick_mode; fi) \
227− $(bench_speed_options $(basename $BENCH_EXEC_PATH) $BENCH_NAME)"
228−
229− local QUICK_BENCH_OPTIONS
230− for i in $QUICK_MODE_TYPE
231− do
232− case "$i" in
233− super_quick) QUICK_BENCH_OPTIONS="$SUPER_QUICK_OPTIONS"; break ;;
234− quicker) QUICK_BENCH_OPTIONS="$QUICKER_OPTIONS"; break ;;
235− esac
236− done
237−
238− local STREAM_SIZE
239− local STREAM_LEN
240− local STREAM_SIZE_OPT
241− if test "$LONG" -ne 0
242− then
243− STREAM_SIZE=10000000
244− STREAM_LEN=$(env LC_ALL=en_US.UTF-8 printf "--stream-size %'.f\n" $STREAM_SIZE)
245− STREAM_SIZE_OPT="--stream-size $STREAM_SIZE"
246− fi
247−
248− echo "$BENCH_NAME_ORIG: \
249− $RTS_OPTIONS1 \
250− $STREAM_LEN \
251− $QUICK_BENCH_OPTIONS" \
252− "$@"
253−
254− #------------------------------------------------------------------------------
255− # Run benchmark with options and collect results
256− #------------------------------------------------------------------------------
257−
258− local output_file
259− output_file=$(bench_output_file $(basename $BENCH_EXEC_PATH))
260− mkdir -p `dirname $output_file`
261− rm -f ${output_file}.tmp
262−
263− local BENCH_NAME_ESC
264− if test $USE_GAUGE -eq 0
265− then
266− # Escape "\" and double quotes in benchmark names
267− BENCH_NAME_ESC=$(echo "$BENCH_NAME_ORIG" | sed -e 's/\\/\\\\/g' | sed -e 's/"/\\"/g')
268− $BENCH_EXEC_PATH \
269− -j 1 \
270− $RTS_OPTIONS1 \
271− $STREAM_SIZE_OPT \
272− $QUICK_BENCH_OPTIONS \
273− "$@" \
274− --csv=${output_file}.tmp \
275− -p '$0 == "'"$BENCH_NAME_ESC"'"' || die "Benchmark execution failed."
276−
277− # Convert cpuTime field from picoseconds to seconds
278− awk --version 2>&1 | grep -q "GNU Awk" \
279− || die "Need GNU awk. [$(which awk)] is not GNU awk."
280− tail -n +2 ${output_file}.tmp | \
281− awk 'BEGIN {FPAT = "([^,]+)|(\"[^\"]+\")";OFS=","} {$2=$2/1000000000000;print}' \
282− >> $output_file
283− else
284− $BENCH_EXEC_PATH \
285− $RTS_OPTIONS1 \
286− $STREAM_SIZE_OPT \
287− $QUICK_BENCH_OPTIONS \
288− "$@" \
289− --csvraw=${output_file}.tmp \
290− -m exact "$BENCH_NAME" || die "Benchmark execution failed."
291− tail -n +2 ${output_file}.tmp \
292− >> $output_file
293− fi
294−}
295−
296−invoke_gauge () {
297− local target_prog="$1"
298− local target_name="$2"
299− local output_file="$3"
300−
301− local MATCH=""
302− if test "$LONG" -ne 0
303− then
304− MATCH="$target_name/o-1-space"
305− else
306− MATCH="$BENCH_PREFIX"
307− fi
308− echo "name,iters,time,cycles,cpuTime,utime,stime,maxrss,minflt,majflt,nvcsw,nivcsw,allocated,numGcs,bytesCopied,mutatorWallSeconds,mutatorCpuSeconds,gcWallSeconds,gcCpuSeconds" >> $output_file
309− # keep only benchmark names with shortest prefix e.g. "a/b/c" and "a/b", we
310− # should only keep "a/b" otherwise benchmarks will run multiple times. why?
311− $target_prog -l \
312− | grep "^$MATCH" \
313− | while read -r name; \
314− do bench_exec_one "$name" "${GAUGE_ARGS[@]}" || exit 1; done \
315− || die "Benchmark execution failed."
316−}
317−
318−invoke_tasty_bench () {
319− local target_prog="$1"
320− local target_name="$2"
321− local output_file="$3"
322−
323− local MATCH=""
324− if test "$LONG" -ne 0
325− then
326− MATCH="-p /$target_name\/o-1-space/"
327− else
328− if test -n "$BENCH_PREFIX"
329− then
330− # escape "/"
331− local escaped_name=$(echo "$BENCH_PREFIX" | sed -e 's/\//\\\//g')
332− MATCH="-p /$escaped_name/"
333− fi
334− fi
335− echo "Name,cpuTime,2*Stdev (ps),Allocated,bytesCopied,maxrss" >> $output_file
336− $target_prog -l $MATCH \
337− | grep "^All" \
338− | while read -r name; \
339− do bench_exec_one "$name" "${GAUGE_ARGS[@]}" || exit 1; done \
340− || die "Benchmark execution failed."
341−}
342−
343−run_bench_target () {
344− local package_name=$1
345− local component=$2
346− local target_name=$3
347−
348− local target_prog
349− if test -z "$BENCHMARK_PACKAGE_VERSION"
350− then
351− echo "Please set BENCHMARK_PACKAGE_VERSION in bench_config"
352− exit 1
353− fi
354− target_prog=$(cabal_target_prog $package_name-$BENCHMARK_PACKAGE_VERSION $component $target_name) || \
355− die "Cannot find executable for target $target_name"
356−
357− echo "Running executable $target_name ..."
358−
359− # Needed by bench_exec_one
360− BENCH_EXEC_PATH=$target_prog
361−
362− local output_file=$(bench_output_file $target_name)
363− mkdir -p `dirname $output_file`
364− if test "$USE_GAUGE" -eq 0
365− then invoke_tasty_bench "$target_prog" "$target_name" "$output_file"
366− else invoke_gauge "$target_prog" "$target_name" "$output_file"
367− fi
368−}
369−
370−# $1: package name
371−# $2: component
372−# $3: targets
373−run_bench_targets() {
374− for i in $3
375− do
376− run_bench_target $1 $2 $i
377− done
378−}
379−
380−run_benches_comparing() {
381− local bench_list=$1
382−
383− if test -z "$CANDIDATE"
384− then
385− CANDIDATE=$(git rev-parse HEAD)
386− fi
387− if test -z "$BASE"
388− then
389− # XXX Should be where the current branch is forked from master
390− BASE="$CANDIDATE^"
391− fi
392− echo "Comparing baseline commit [$BASE] with candidate [$CANDIDATE]"
393− echo "Checking out base commit [$BASE] for benchmarking"
394− # XXX git checkout will overwrite this script itself and the scripts
395− # imported/used by this script.
396− git checkout "$BASE" || die "Checkout of base commit [$BASE] failed"
397−
398− # $BUILD_BENCH || die "build failed"
399− run_build "$BUILD_BENCH" $BENCHMARK_PACKAGE_NAME bench "$TARGETS"
400− run_bench_targets $BENCHMARK_PACKAGE_NAME b "$bench_list" target_exe_extra_args
401−
402− echo "Checking out candidate commit [$CANDIDATE] for benchmarking"
403− git checkout "$CANDIDATE" || \
404− die "Checkout of candidate [$CANDIDATE] commit failed"
405−
406− # $BUILD_BENCH || die "build failed"
407− run_build "$BUILD_BENCH" $BENCHMARK_PACKAGE_NAME bench "$TARGETS"
408− run_bench_targets $BENCHMARK_PACKAGE_NAME b "$bench_list" target_exe_extra_args
409− # XXX reset back to the original commit
410−}
411−
412−backup_output_file() {
413− local bench_name=$1
414− local output_file=$(bench_output_file $bench_name)
415−
416− if test -e $output_file -a "$APPEND" != 1
417− then
418− mv -f -v $output_file ${output_file}.prev
419− fi
420−}
421−
422−run_measurements() {
423− local bench_list=$1
424−
425− for i in $bench_list
426− do
427− backup_output_file $i
428− done
429−
430− if test "$COMMIT_COMPARE" = "0"
431− then
432− run_build "$BUILD_BENCH" $BENCHMARK_PACKAGE_NAME bench "$TARGETS"
433− run_bench_targets $BENCHMARK_PACKAGE_NAME b "$bench_list" target_exe_extra_args
434− else
435− run_benches_comparing "$bench_list"
436− fi
437−}
438−
439−run_reports() {
440− local prog
441− prog=$BENCH_REPORT_DIR/bin/bench-report
442− test -x $prog || die "Cannot find bench-report executable"
443− test -z "$SILENT" && echo
444−
445− for i in $1
446− do
447− test -z "$SILENT" && echo "Generating reports for ${i}..."
448− $prog \
449− --benchmark $i \
450− $(test "$USE_GAUGE" = 1 && echo "--use-gauge") \
451− $(test "$GRAPH" = 1 && echo "--graphs") \
452− $(test "$SORT_BY_NAME" = 1 && echo "--sort-by-name") \
453− $(test -n "$BENCH_DIFF_STYLE" && echo "--diff-style $BENCH_DIFF_STYLE") \
454− $(test -n "$BENCH_CUTOFF_PERCENT" && echo "--diff-cutoff-percent $BENCH_CUTOFF_PERCENT") \
455− --fields "$FIELDS"
456− done
457−}
458−
459−#-----------------------------------------------------------------------------
460−# Execution starts here
461−#-----------------------------------------------------------------------------
462−
463−USE_GIT_CABAL=1 # This is used by set_common_vars
464−set_common_vars
465−
466−USE_NIX=0
467−COMPARE=0
468−COMMIT_COMPARE=0
469−BASE=
470−CANDIDATE=
471−
472−APPEND=0
473−LONG=0
474−RAW=0
475−SORT_BY_NAME=0
476−GRAPH=0
477−MEASURE=1
478−
479−GAUGE_ARGS=
480−BUILD_ONCE=0
481−
482−CABAL_BUILD_OPTIONS="--flag fusion-plugin --flag limit-build-mem"
483−
484−#-----------------------------------------------------------------------------
485−# Read command line
486−#-----------------------------------------------------------------------------
487−
488−while test -n "$1"
489−do
490− case $1 in
491− -h|--help|help) print_help ;;
492− # options with arguments
493− --benchmarks) shift; TARGETS=$1; shift ;;
494− --targets) shift; TARGETS=$1; shift ;;
495− --prefix) shift; BENCH_PREFIX="$1"; shift ;;
496− --fields) shift; FIELDS=$1; shift ;;
497− --base) shift; BASE=$1; shift ;;
498− --candidate) shift; CANDIDATE=$1; shift ;;
499− --with-compiler) shift; CABAL_WITH_COMPILER=$1; shift ;;
500− --cabal-build-flags) shift; CABAL_BUILD_OPTIONS+=" $1"; shift ;;
501− --cabal-build-options) shift; CABAL_BUILD_OPTIONS+=" $1"; shift ;;
502− --rtsopts) shift; RTS_OPTIONS=$1; shift ;;
503− --config) shift; BENCH_CONFIG_FILE=$1; shift ;;
504− --diff-style) shift; BENCH_DIFF_STYLE=$1; shift ;;
505− --diff-cutoff-percent) shift; BENCH_CUTOFF_PERCENT=$1; shift ;;
506− # flags
507− --slow) SLOW=1; shift ;;
508− --silent) SILENT=1; shift ;;
509− --quick) QUICK_MODE=1; shift ;;
510− --compare) COMPARE=1; shift ;;
511− --commit-compare) COMMIT_COMPARE=1; shift ;;
512− --raw) RAW=1; shift ;;
513− --append) APPEND=1; shift ;;
514− --long) LONG=1; shift ;;
515− --sort-by-name) SORT_BY_NAME=1; shift ;;
516− --graphs) GRAPH=1; shift ;;
517− --no-measure) MEASURE=0; shift ;;
518− # This is used in build-lib.sh to enable dev_build function which is used
519− # in targets.sh to enable or disable some targets.
520− --dev-build) RUNNING_DEVBUILD=1; shift ;;
521− --use-nix) USE_NIX=1; shift ;;
522− --use-gauge) USE_GAUGE=1; shift ;;
523− --) shift; break ;;
524− *) echo "Unknown flags: $*"; echo; print_help ;;
525− esac
526−done
527−GAUGE_ARGS=("$@")
528−
529−if test -z "$BENCH_CONFIG_FILE"
530−then
531− die "Please use --config to specify config file"
532−fi
533−
534−source "$BENCH_CONFIG_FILE" || \
535− die "Failed to source config file $BENCH_CONFIG_FILE"
536−
537−# Defined in $BENCH_CONFIG_FILE
538−bench_config
539−
540−if test -z "$FIELDS"
541−then
542− FIELDS=$DEFAULT_FIELDS
543−fi
544−
545−set_derived_vars
546−
547−#-----------------------------------------------------------------------------
548−# Determine targets
549−#-----------------------------------------------------------------------------
550−
551−only_real_benchmarks () {
552− for i in $TARGETS
553− do
554− local SKIP=0
555− for j in $COMPARISONS
556− do
557− if test $i == $j
558− then
559− SKIP=1
560− fi
561− done
562− if test "$SKIP" -eq 0
563− then
564− echo -n "$i "
565− fi
566− done
567−}
568−
569−# defined in $BENCH_CONFIG_FILE
570−bench_targets
571−
572−if test "$(has_item "$TARGETS" help)" = "help"
573−then
574− list_target_groups
575− list_comparisons
576− list_targets
577− exit
578−fi
579−
580−COMMON_FIELDS="allocated bytescopied cputime maxrss"
581−if test "$USE_GAUGE" -eq 1
582−then
583− ALL_FIELDS="$COMMON_FIELDS time cycles utime stime minflt majflt nvcsw nivcsw"
584−else
585− ALL_FIELDS="$COMMON_FIELDS"
586−fi
587−if test "$(has_item "$FIELDS" help)" = "help"
588−then
589− echo "Supported fields: $ALL_FIELDS"
590− echo "Default fields: $DEFAULT_FIELDS"
591− exit
592−fi
593−
594−if test "$LONG" -ne 0
595−then
596− if test -n "$TARGETS"
597− then
598− echo "Cannot specify benchmarks [$TARGETS] with --long"
599− exit
600− fi
601− TARGETS=$infinite_grp
602−fi
603−
604−DEFAULT_TARGETS="$(all_grp)"
605−TARGETS=$(set_targets)
606−
607−TARGETS_ORIG=$TARGETS
608−TARGETS=$(only_real_benchmarks)
609−
610−test -z "$SILENT" && echo "Using benchmark suites [$TARGETS]"
611−
612−#-----------------------------------------------------------------------------
613−# Build reporting utility
614−#-----------------------------------------------------------------------------
615−
616−# We need to build the report progs first at the current (latest) commit before
617−# checking out any other commit for benchmarking.
618−if test -z "$SILENT"
619−then build_report_progs
620−else silently build_report_progs
621−fi
622−
623−#-----------------------------------------------------------------------------
624−# Build and run targets
625−#-----------------------------------------------------------------------------
626−
627−if test "$USE_GAUGE" -eq 1
628−then
629− BUILD_FLAGS="--flag use-gauge"
630−fi
631−
632−BUILD_BENCH="$CABAL_EXECUTABLE v2-build $BUILD_FLAGS $CABAL_BUILD_OPTIONS --enable-benchmarks"
633−if test "$MEASURE" = "1"
634−then
635− run_measurements "$TARGETS"
636−fi
637−
638−#-----------------------------------------------------------------------------
639−# Run reports
640−#-----------------------------------------------------------------------------
641−
642−# $1: var name
643−build_comparison_results () {
644− local name
645− local constituents
646−
647− name=$1
648− constituents=$(eval "echo -n \$${name}")
649− mkdir -p "charts/$name"
650− dest_file="charts/$name/results.csv"
651− : > $dest_file
652− for j in $constituents
653− do
654− cat "charts/$j/results.csv" >> $dest_file
655− done
656−}
657−
658−if test "$COMPARE" -eq 1
659−then
660− DYN_CMP_GRP="$(echo "$TARGETS" | sed -e 's/ /_/g')_cmp"
661− eval "$DYN_CMP_GRP=\"$TARGETS\""
662− COMPARISON_REPORTS=$DYN_CMP_GRP
663− build_comparison_results $DYN_CMP_GRP
664−else
665− COMPARISON_REPORTS=""
666−fi
667−
668−for i in $COMPARISONS
669−do
670− if test "$(has_item "$TARGETS_ORIG" $i)" = $i
671− then
672− COMPARISON_REPORTS="$COMPARISON_REPORTS $i"
673− build_comparison_results $i
674− fi
675−done
676−
677−if test "$RAW" = "0"
678−then
679− run_reports "$TARGETS"
680− run_reports "$COMPARISON_REPORTS"
681− if test -n "$DYN_CMP_GRP"
682− then
683− rm -rf "charts/$DYN_CMP_GRP"
684− fi
685−fi
benchmark/bench-report/bin/build-lib.shdeleted−218
@@ -1,218 +0,0 @@
1−# $1: message
2−die () {
3− >&2 echo -e "Error: $1"
4− exit 1
5−}
6−
7−warn () {
8− >&2 echo -e "Warning: $1"
9−}
10−
11−# $1: command
12−function run_verbose() {
13− echo "$*"
14− bash -c "$*"
15−}
16−
17−has_item () {
18− for i in $1
19− do
20− if test "$i" = "$2"
21− then
22− echo "$i"
23− break
24− fi
25− done
26−}
27−
28−# $1: command
29−silently () {
30− eval "$1 &> /dev/null"
31−}
32−
33−#------------------------------------------------------------------------------
34−# target groups
35−#------------------------------------------------------------------------------
36−
37−test_only () {
38− if test -n "$RUNNING_TESTS"
39− then
40− echo $1
41− fi
42−}
43−
44−bench_only () {
45− if test -n "$RUNNING_BENCHMARKS"
46− then
47− echo $1
48− fi
49−}
50−
51−dev_build () {
52− if test -n "$RUNNING_DEVBUILD"
53− then
54− echo $1
55− fi
56−}
57−
58−# A group consisting of all known individual targets
59−all_grp () {
60− { for i in $GROUP_TARGETS
61− do
62− for j in $(eval "echo \$$i")
63− do
64− echo $j
65− done
66− done
67− for i in $INDIVIDUAL_TARGETS
68− do
69− echo $i
70− done
71− } | sort | uniq
72−}
73−
74−# All groups
75−all_target_groups () {
76− echo $GROUP_TARGETS
77−}
78−
79−# XXX pass as arg
80−list_targets () {
81− echo "Individual targets:"
82− for i in $(all_grp)
83− do
84− echo "$i"
85− done
86− echo
87−}
88−
89−# XXX pass as arg
90−list_target_groups () {
91− echo "All Targets: all_grp"
92− echo "Target groups:"
93− for i in $(all_target_groups)
94− do
95− echo -n "$i ["
96− eval "echo -n \$$i"
97− echo "]"
98− done
99− echo
100−}
101−
102−# XXX pass as arg
103−set_targets() {
104− if test -z "$TARGETS"
105− then
106− echo $DEFAULT_TARGETS
107− else
108− for i in $(echo $TARGETS)
109− do
110− case $i in
111− *_grp) eval "echo -n \$${i}" ;;
112− *_cmp) eval "echo -n \$${i} $i" ;;
113− *) echo -n $i ;;
114− esac
115− echo -n " "
116− done
117− fi
118−}
119−
120−# XXX cabal issue "cabal v2-exec which" cannot find benchmark/test executables
121−
122−# $1: builddir
123−# $2: package name with version
124−# $3: component ("" (lib), t (test), b (benchmark), x (executable))
125−# $4: command to find
126−cabal_which_builddir() {
127− local noopt=""
128− if test "$TEST_QUICK_MODE" = "1"
129− then
130− noopt="/noopt"
131− fi
132−
133− local path=$(echo $1/build/*/ghc-${GHC_VERSION}/${2}/$3/$4$noopt/build/$4/$4)
134− echo "[cabal_which $path]" 1>&2
135− test -f "$path" && echo $path
136−}
137−
138−# $1: package name with version
139−# $2: component
140−# $3: command to find
141−cabal_which() {
142− cabal_which_builddir $BUILD_DIR $1 $2 $3
143−}
144−
145−# We run the benchmarks in isolation in a separate process so that different
146−# benchmarks do not interfere with other. To enable that we need to pass the
147−# benchmark exe path to gauge as an argument. Unfortunately it cannot find its
148−# own path currently.
149−
150−# The path is dependent on the architecture and cabal version.
151−
152−# $1: package name with version
153−# $2: component
154−# $3: target
155−cabal_target_prog () {
156− local target_prog=`cabal_which $1 $2 $3`
157− if test -x "$target_prog"
158− then
159− echo $target_prog
160− else
161− return 1
162− fi
163−}
164−
165−set_common_vars () {
166− SLOW=0
167− QUICK_MODE=0
168−
169− RUNNING_DEVBUILD=
170−
171− TARGET_EXE_ARGS=
172− RTS_OPTIONS=
173−
174− CABAL_BUILD_OPTIONS=""
175− CABAL_EXECUTABLE=cabal
176−
177− # Use branch specific builds if git-cabal is present in PATH
178− BUILD_DIR=dist-newstyle
179− if test "$USE_GIT_CABAL" -eq 1
180− then
181− if which git-cabal 2>/dev/null
182− then
183− echo "Using git-cabal for branch specific builds"
184− CABAL_EXECUTABLE=git-cabal
185− BUILD_DIR=$(git-cabal show-builddir)
186− fi
187− fi
188−}
189−
190−# To be called after parsing CLI arguments
191−set_derived_vars () {
192− if test -n "$CABAL_WITH_COMPILER"
193− then
194− CABAL_BUILD_OPTIONS+=" --with-compiler $CABAL_WITH_COMPILER"
195− else
196− CABAL_WITH_COMPILER=ghc
197− fi
198−
199− GHC_VERSION=$($CABAL_WITH_COMPILER --numeric-version)
200−}
201−
202−# $1: build program
203−# $2: package name
204−# $3: component prefix
205−# $4: targets
206−run_build () {
207− local build_prog=$1
208− local package=$2
209− local component_prefix=$3
210− local COMPONENTS
211− local c
212−
213− for c in $4
214− do
215− COMPONENTS+="$package:$component_prefix:$c "
216− done
217− run_verbose $build_prog $COMPONENTS || die "build failed"
218−}
benchmark/bench-report/default.nixdeleted−55
@@ -1,55 +0,0 @@
1−let
2− nixpkgsPath_21_11 =
3− "https://github.com/NixOS/nixpkgs/archive/refs/tags/21.11.tar.gz";
4− nixpkgsDefault = import (builtins.fetchTarball nixpkgsPath_21_11) { };
5−in
6−{
7− nixpkgs ? nixpkgsDefault
8−, compiler ? "default"
9−}:
10−let haskellPackages =
11− if compiler == "default"
12− then nixpkgs.haskellPackages
13− else nixpkgs.haskell.packages.${compiler};
14−
15− mkPackage = super: pkg: path: opts: inShell:
16− let orig = super.callCabal2nixWithOptions pkg path opts {};
17− in if inShell
18− # Avoid copying the source directory to nix store by using
19− # src = null.
20− then orig.overrideAttrs (oldAttrs: { src = null; })
21− else orig;
22−
23− mkHaskellPackages = inShell:
24− haskellPackages.override {
25− overrides = self: super:
26− with nixpkgs.haskell.lib;
27− {
28− bench-show = super.callHackageDirect {
29− pkg = "bench-show";
30− ver = "0.3.2";
31− sha256 = "16b8vyzdp9b5bh34kqmbfwjsyv8wgnxxwl8kjcpgxjsh52xzyaa0";
32− } { };
33−
34− bench-report = mkPackage super "bench-report" ./. "" inShell;
35− };
36− };
37−
38− drv = mkHaskellPackages true;
39−
40− shell = drv.shellFor {
41− packages = p:
42− [ p.bench-report
43− ];
44− # Use a better prompt
45− shellHook = ''
46− export CABAL_DIR="$(pwd)/.cabal.nix"
47− if test -n "$PS_SHELL"
48− then
49− export PS1="$PS_SHELL\[$bldred\](nix)\[$txtrst\] "
50− fi
51− '';
52− };
53−in if nixpkgs.lib.inNixShell
54− then shell
55− else (mkHaskellPackages false).bench-report
benchmark/bench-runner/Main.hsnew file+183
@@ -0,0 +1,183 @@
1+module Main (main) where
2+
3+import BenchRunner (mainWith)
4+import BuildLib (Quickness(..))
5+import Control.Applicative ((<|>))
6+import Data.List (isInfixOf, isPrefixOf, isSuffixOf)
7+
8+import Targets (targets)
9+
10+rtsOpts :: String -> String -> String
11+rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
12+
13+ where
14+
15+ -- Drop All.
16+ benchName = drop 4 benchName0
17+
18+ general
19+ -- GHC-9.6 requires 32M heap vs 16M for GHC-9.4
20+ | "o-1-sp" `isInfixOf` benchName = "-K36K -M32M"
21+ | "o-n-h" `isInfixOf` benchName = "-K36K -M32M"
22+ -- GHC-9.6 requires 32M heap vs 16M for GHC-9.4
23+ | "o-n-st" `isInfixOf` benchName = "-K1M -M32M"
24+ | "o-n-sp" `isInfixOf` benchName = "-K1M -M32M"
25+ | otherwise = ""
26+
27+ exeSpecific
28+ | "Prelude.Concurrent" `isSuffixOf` exeName = "-K512K -M384M"
29+ | otherwise = ""
30+
31+ benchSpecific
32+ -- GHC-9.6 requires 64M, earlier it was 16M
33+ | "Data.Fold/o-n-heap.key-value.toHashMapIO (max buckets) sum" == benchName =
34+ "-M64M"
35+
36+ -- This is required only for the --long case because we allocate all
37+ -- the arrays upfront. depends on the size of the stream.
38+ | "Data.Parser/o-1-space" `isPrefixOf` benchName =
39+ "-M128M"
40+
41+ -----------------------------------------------------------------------
42+
43+ | "Prelude.Parallel/o-n-heap.mapping.mapM" == benchName = "-M256M"
44+ | "Prelude.Parallel/o-n-heap.monad-outer-product."
45+ `isPrefixOf` benchName = "-M256M"
46+ | "Prelude.Parallel/o-n-space.monad-outer-product."
47+ `isPrefixOf` benchName = "-K2M -M256M"
48+ | "Prelude.Rate/o-1-space." `isPrefixOf` benchName = "-K128K"
49+ | "Prelude.Rate/o-1-space.asyncly." `isPrefixOf` benchName = "-K128K"
50+ | "Prelude.WSerial/o-n-space." `isPrefixOf` benchName = "-K4M"
51+ | "Prelude.Async/o-n-space.monad-outer-product." `isPrefixOf` benchName =
52+ "-K4M"
53+ | "Prelude.Ahead/o-1-space.monad-outer-product." `isPrefixOf` benchName =
54+ "-K128K -M32M"
55+ | "Prelude.Ahead/o-1-space." `isPrefixOf` benchName = "-K128K"
56+ | "Prelude.Ahead/o-n-space.monad-outer-product." `isPrefixOf` benchName =
57+ "-K4M"
58+ | "Prelude.WAsync/o-n-heap.monad-outer-product.toNull3" == benchName =
59+ "-M64M"
60+ | "Prelude.WAsync/o-n-space.monad-outer-product." `isPrefixOf` benchName =
61+ "-K4M"
62+
63+ -- This module is dev only now, and can be removed at some point
64+ | "Data.Stream.StreamDK/o-1-space.grouping.classifySessionsOf"
65+ `isPrefixOf` benchName = "-K512K"
66+ | "Data.Stream.StreamDK/o-n-space.foldr.foldrM/"
67+ `isPrefixOf` benchName = "-K4M"
68+ | "Data.Stream.StreamDK/o-n-space.iterated."
69+ `isPrefixOf` benchName = "-K4M -M64M"
70+ -- GHC 9.4.4 requires 4M
71+ | "Data.Stream.StreamDK/o-n-space.traversable."
72+ `isPrefixOf` benchName = "-K4M"
73+ -- GHC-9.6 requires 64M, earlier it was 32M
74+ | "Data.Stream.StreamDK/o-n-heap.buffered.readsPrec pure streams" == benchName =
75+ "-M64M"
76+ -- GHC-9.6 requires 64M, earlier it was 32M
77+ | "Data.Stream.StreamDK/o-n-heap.buffered.showPrec Haskell lists" == benchName =
78+ "-M64M"
79+
80+ -----------------------------------------------------------------------
81+
82+ | "Data.StreamD/o-n-space.elimination.toList" == benchName =
83+ "-K2M"
84+ | "Data.StreamK/o-n-space.elimination.toList" == benchName =
85+ "-K2M"
86+
87+ -----------------------------------------------------------------------
88+
89+ | "Data.Stream/o-1-space.grouping.classifySessionsOf"
90+ `isPrefixOf` benchName = "-K512K"
91+ | "Data.Stream/o-n-space.foldr.foldrM/"
92+ `isPrefixOf` benchName = "-K4M"
93+ | "Data.Stream/o-n-space.iterated."
94+ `isPrefixOf` benchName = "-K4M"
95+
96+ -- GHC-9.6 requires 64M, earlier it was 32M
97+ | "Data.Stream/o-n-heap.buffered.showPrec Haskell lists" == benchName =
98+ "-M64M"
99+ -- GHC-9.6 requires 64M, earlier it was 32M
100+ | "Data.Stream/o-n-heap.buffered.readsPrec pure streams" == benchName =
101+ "-M64M"
102+
103+ | "Data.Stream.ConcurrentEager/o-n-heap.monad-outer-product.toNullAp"
104+ `isPrefixOf` benchName = "-M1024M"
105+ | "Data.Stream.ConcurrentEager/o-1-space."
106+ `isPrefixOf` benchName = "-M128M"
107+
108+ | "Data.Stream.ConcurrentOrdered/o-1-space.concat-foldable.foldMapWith"
109+ `isPrefixOf` benchName = "-K128K"
110+
111+ ----------------------------------------------------------------------
112+
113+ | "Data.Array" `isPrefixOf` benchName
114+ && "/o-1-space.generation.read" `isSuffixOf` benchName = "-M32M"
115+ -- XXX GHC 9.6 onwards needs 64M, earlier it was 32M
116+ | "Data.Array" `isPrefixOf` benchName
117+ && "/o-1-space.generation.show" `isSuffixOf` benchName = "-M64M"
118+ -- XXX GHC 9.6 onwards needs 64M, earlier it was 32M
119+ | "Data.Array.Generic/o-1-space.transformationX4.map"
120+ `isPrefixOf` benchName = "-M64M"
121+
122+ -- XXX For --long option, need to check why so much heap is required.
123+ -- Note, if we remove the chunked stream module we need to keep the
124+ -- chunked stream benchmarks in the stream module.
125+ | "Data.Array.Stream/o-1-space"
126+ `isPrefixOf` benchName = "-K4M -M512M"
127+ -- XXX Takes up to 160MB heap for --long, we use chunked stream for
128+ -- this, so the reason may be related to chunked streams.
129+ | "Data.ParserK/o-1-space"
130+ `isPrefixOf` benchName = "-K4M -M256M"
131+
132+ -----------------------------------------------------------------------
133+
134+ | "Unicode.Char/o-1-space." `isPrefixOf` benchName = "-M32M"
135+
136+ | otherwise = ""
137+
138+speedOpts :: String -> String -> Maybe Quickness
139+speedOpts exeName benchName0 = exeSpecific <|> benchSpecific
140+
141+ where
142+
143+ -- slowestOf Quicker _ = Quicker
144+ -- slowestOf _ Quicker = Quicker
145+ -- slowestOf _ _ = SuperQuick
146+
147+ -- Drop All.
148+ benchName = drop 4 benchName0
149+ exeSpecific
150+ | "Prelude.Concurrent" == exeName = Just SuperQuick
151+ | "Prelude.Rate" == exeName = Just SuperQuick
152+ | "Prelude.Adaptive" == exeName = Just SuperQuick
153+ | otherwise = Nothing
154+ benchSpecific
155+ | "Prelude.Parallel/o-n-heap.mapping.mapM" == benchName =
156+ Just SuperQuick
157+ | "Prelude.Parallel/o-n-heap.monad-outer-product."
158+ `isPrefixOf` benchName = Just SuperQuick
159+ | "Prelude.Parallel.o-n-space.monad-outer-product."
160+ `isPrefixOf` benchName = Just SuperQuick
161+ | "Prelude.Parallel/o-n-heap.generation." `isPrefixOf` benchName =
162+ Just Quicker
163+ | "Prelude.Parallel/o-n-heap.mapping." `isPrefixOf` benchName =
164+ Just Quicker
165+ | "Prelude.Parallel/o-n-heap.concat-foldable." `isPrefixOf` benchName =
166+ Just Quicker
167+ | "Prelude.Async/o-1-space.monad-outer-product." `isPrefixOf` benchName =
168+ Just Quicker
169+ | "Prelude.Async/o-n-space.monad-outer-product." `isPrefixOf` benchName =
170+ Just Quicker
171+ | "Prelude.Ahead/o-1-space.monad-outer-product." `isPrefixOf` benchName =
172+ Just Quicker
173+ | "Prelude.Ahead/o-n-space.monad-outer-product." `isPrefixOf` benchName =
174+ Just Quicker
175+ | "Prelude.WAsync/o-n-heap.monad-outer-product." `isPrefixOf` benchName =
176+ Just Quicker
177+ | "Prelude.WAsync/o-n-space.monad-outer-product." `isPrefixOf` benchName =
178+ Just Quicker
179+ | "FileSystem.Handle." `isPrefixOf` benchName = Just Quicker
180+ | otherwise = Nothing
181+
182+main :: IO ()
183+main = mainWith targets speedOpts rtsOpts
benchmark/bench-runner/bench-runner.cabalnew file+42
@@ -0,0 +1,42 @@
1+cabal-version: 2.4
2+name: bench-runner
3+version: 0.1.0.0
4+
5+-- A short (one-line) description of the package.
6+-- synopsis:
7+
8+-- A longer description of the package.
9+-- description:
10+
11+-- A URL where users can report bugs.
12+-- bug-reports:
13+
14+-- The license under which the package is released.
15+-- license:
16+
17+-- The package author(s).
18+-- author:
19+
20+-- An email address to which users can send suggestions, bug reports, and patches.
21+-- maintainer:
22+
23+-- A copyright notice.
24+-- copyright:
25+-- category:
26+-- extra-source-files: CHANGELOG.md
27+
28+executable bench-runner
29+ ghc-options: -Wall
30+ main-is: Main.hs
31+
32+ -- Modules included in this executable, other than Main.
33+ -- other-modules:
34+
35+ -- LANGUAGE extensions used by modules in this package.
36+ -- other-extensions:
37+ build-depends: base
38+ , bench-report
39+ , containers
40+ , streamly-targets
41+ hs-source-dirs: .
42+ default-language: Haskell2010
benchmark/bench-runner/cabal.projectnew file+4
@@ -0,0 +1,4 @@
1+packages: . ../../targets
2+
3+package bench-report
4+ flags: +no-charts
benchmark/bench-runner/default.nixnew file+164
@@ -0,0 +1,164 @@
1+let
2+ nixpkgsPath_21_11 =
3+ "https://github.com/NixOS/nixpkgs/archive/refs/tags/21.11.tar.gz";
4+ nixpkgsDefault = import (builtins.fetchTarball nixpkgsPath_21_11) { };
5+in
6+{
7+ nixpkgs ? nixpkgsDefault
8+, compiler ? "default"
9+}:
10+let haskellPackages =
11+ if compiler == "default"
12+ then nixpkgs.haskellPackages
13+ else nixpkgs.haskell.packages.${compiler};
14+
15+ mkPackage = super: pkg: path: opts: inShell:
16+ let orig = super.callCabal2nixWithOptions pkg path opts {};
17+ in if inShell
18+ # Avoid copying the source directory to nix store by using
19+ # src = null.
20+ then orig.overrideAttrs (oldAttrs: { src = null; })
21+ else orig;
22+
23+ mkPkgGit = super: gitSrc: rev: name:
24+ let
25+ src = builtins.fetchGit {
26+ url = gitSrc;
27+ rev = rev;
28+ };
29+ in super.callCabal2nix name src { };
30+
31+ mkPkgGitRef = super: gitSrc: rev: ref: name:
32+ let
33+ src = builtins.fetchGit {
34+ url = gitSrc;
35+ rev = rev;
36+ ref = ref;
37+ };
38+ in super.callCabal2nix name src { };
39+
40+ mkHaskellPackages = inShell:
41+ haskellPackages.override {
42+ overrides = self: super:
43+ with nixpkgs.haskell.lib;
44+ {
45+ bench-runner = mkPackage super "bench-runner" ./. "" inShell;
46+ streamly-targets = mkPackage super "streamly-targets" ../../targets "" false;
47+
48+ bench-report =
49+ nixpkgs.haskell.lib.overrideCabal
50+ (let src = fetchGit {
51+ url = "git@github.com:composewell/bench-report.git";
52+ rev = "3b50bf0ad06f746bca42f30c8d40a0426e159af3";
53+ }; in super.callCabal2nix "bench-report" src {})
54+ (old:
55+ { enableLibraryProfiling = false;
56+ doHaddock = false;
57+ });
58+
59+ bench-show = super.callHackageDirect {
60+ pkg = "bench-show";
61+ ver = "0.3.2";
62+ sha256 = "16b8vyzdp9b5bh34kqmbfwjsyv8wgnxxwl8kjcpgxjsh52xzyaa0";
63+ } { };
64+
65+# streamly-coreutils = let
66+# src = "git@github.com:composewell/streamly-coreutils.git";
67+# rev = "a12756efe24bbf303f2f6d66a95426c7657d297b";
68+# in mkPkgGit super src rev "streamly-coreutils";
69+
70+ streamly-coreutils =
71+ nixpkgs.haskell.lib.overrideCabal
72+ (let src = fetchGit {
73+ url = "git@github.com:composewell/streamly-coreutils.git";
74+ rev = "b1e6fc37f0e898c54378129750d3ccc1c034f611";
75+ }; in super.callCabal2nix "streamly-coreutils" src {})
76+ (old:
77+ { librarySystemDepends =
78+ if builtins.currentSystem == "x86_64-darwin"
79+ then [nixpkgs.darwin.apple_sdk.frameworks.Cocoa]
80+ else [];
81+ #enableLibraryProfiling = false;
82+ doHaddock = false;
83+ doCheck = false;
84+ });
85+
86+ streamly-shell = let
87+ src = "https://github.com/composewell/streamly-shell.git";
88+ rev = "1b3fea3239ebe47963955d81565b9d5e34567ab7";
89+ in mkPkgGit super src rev "streamly-shell";
90+
91+ streamly-process = let
92+ src = "https://github.com/composewell/streamly-process.git";
93+ rev = "e310c8a9c6e61515373a2f5f1fb82f6e15fe452b";
94+ in nixpkgs.haskell.lib.dontCheck
95+ (mkPkgGit super src rev "streamly-process");
96+
97+ #streamly-process = nixpkgs.haskell.lib.dontCheck
98+ # (super.callHackageDirect {
99+ # pkg = "streamly-process";
100+ # ver = "0.1.0";
101+ # sha256 = "01nxisqfmn29fbirdsx71sfjp2rdqwrf469qyjcql2d11i1bxn94";
102+ # } { });
103+
104+ # streamly = super.callHackageDirect {
105+ # pkg = "streamly";
106+ # ver = "0.8.0";
107+ # sha256 = "0vy2lkljizlhpbpbybmg9jcmj2g4s1aaqd2dzy5c0y0n4rgwxask";
108+ # } { };
109+ streamly =
110+ nixpkgs.haskell.lib.overrideCabal
111+ #(super.callHackageDirect
112+ # { pkg = "streamly";
113+ # ver = "0.8.2";
114+ # sha256 = "sha256-CjFq9SCdbgLZa7NqOE4OtC8OaFg4vK8VmIDjGU5rGko=";
115+ # } {})
116+ (let src = fetchGit {
117+ url = "git@github.com:composewell/streamly.git";
118+ rev = "14ee0b70363cf925e9cc067bf1df4ecbd047ac38";
119+ }; in super.callCabal2nix "streamly" src {})
120+ (old:
121+ { librarySystemDepends =
122+ if builtins.currentSystem == "x86_64-darwin"
123+ then [nixpkgs.darwin.apple_sdk.frameworks.Cocoa]
124+ else [];
125+ #enableLibraryProfiling = false;
126+ doHaddock = false;
127+ });
128+
129+ streamly-core =
130+ nixpkgs.haskell.lib.overrideCabal
131+ (let src = fetchGit {
132+ url = "git@github.com:composewell/streamly.git";
133+ rev = "14ee0b70363cf925e9cc067bf1df4ecbd047ac38";
134+ }; in super.callCabal2nix "streamly-core" "${src}/core" {})
135+ (old:
136+ { librarySystemDepends =
137+ if builtins.currentSystem == "x86_64-darwin"
138+ then [nixpkgs.darwin.apple_sdk.frameworks.Cocoa]
139+ else [];
140+ #enableLibraryProfiling = false;
141+ doHaddock = false;
142+ });
143+
144+ };
145+ };
146+
147+ drv = mkHaskellPackages true;
148+
149+ shell = drv.shellFor {
150+ packages = p:
151+ [ p.bench-runner
152+ ];
153+ # Use a better prompt
154+ shellHook = ''
155+ export CABAL_DIR="$(pwd)/.cabal.nix"
156+ if test -n "$PS_SHELL"
157+ then
158+ export PS1="$PS_SHELL\[$bldred\](nix)\[$txtrst\] "
159+ fi
160+ '';
161+ };
162+in if nixpkgs.lib.inNixShell
163+ then shell
164+ else (mkHaskellPackages false).bench-runner
benchmark/lib/Streamly/Benchmark/Common.hs+11−6
@@ -53,10 +53,10 @@ import Control.DeepSeq (NFData(..))
5353import Data.Functor.Identity (Identity, runIdentity)
5454import System.Random (randomRIO)
5555
56−import qualified Streamly.Prelude as S
56+import qualified Streamly.Internal.Data.Fold as Fold
57+import qualified Streamly.Internal.Data.Stream as S
5758
58−import Streamly.Prelude (SerialT)
59−import Gauge
59+import Test.Tasty.Bench
6060
6161-------------------------------------------------------------------------------
6262-- Benchmark Prefixes
@@ -107,8 +107,12 @@ benchPureSink1 name f =
107107 bench name $ nfIO $ randomRIO (1,1) >>= return . runIdentity . f
108108
109109{-# INLINE benchPureSrc #-}
110−benchPureSrc :: String -> (Int -> SerialT Identity a) -> Benchmark
111−benchPureSrc name src = benchPure name src (runIdentity . S.drain)
110+benchPureSrc :: String -> (Int -> S.Stream Identity a) -> Benchmark
111+benchPureSrc name src = benchPure name src (runIdentity . drain)
112+
113+ where
114+
115+ drain = S.fold Fold.drain
112116
113117-------------------------------------------------------------------------------
114118-- String/List generation for read instances
@@ -238,8 +242,9 @@ runWithCLIOptsEnv defStreamSize alloc mkBench = do
238242 r <- alloc value
239243 value `seq` runMode (mode cfg) cfg benches (mkBench r value)
240244#else
245+ r0 <- alloc 0
241246 (value, ingredients) <-
242− parseCLIOpts defStreamSize $ bgroup "All" (mkBench undefined 0)
247+ parseCLIOpts defStreamSize $ bgroup "All" (mkBench r0 0)
243248 r <- alloc value
244249 value `seq` defaultMainWithIngredients ingredients
245250 $ bgroup "All" (mkBench r value)
benchmark/lib/Streamly/Benchmark/Common/Handle.hs+12−1
@@ -30,11 +30,16 @@ module Streamly.Benchmark.Common.Handle
3030 , isSpace
3131 , isSp
3232 , mkHandleBenchEnv
33+ , Handles(..)
34+ , getHandles
3335 )
3436where
3537
3638import Control.DeepSeq (NFData(rnf))
3739import Data.Char (ord, chr)
40+#if MIN_VERSION_base(4,17,0)
41+import Data.Char (generalCategory, GeneralCategory(Space))
42+#endif
3843import Data.Word (Word8)
3944import System.Directory (getFileSize)
4045import System.Environment (lookupEnv)
@@ -43,7 +48,7 @@ import System.Process (callCommand)
4348
4449import Data.IORef
4550import Prelude hiding (last, length)
46−import Gauge hiding (env)
51+import Test.Tasty.Bench hiding (env)
4752
4853
4954scratchDir :: String
@@ -140,8 +145,10 @@ mkBenchSmall name env action =
140145
141146 useSmallH (RefHandles {smallInH = inh, outputH = outh}) = Handles inh outh
142147
148+#if !MIN_VERSION_base(4,17,0)
143149foreign import ccall unsafe "u_iswspace"
144150 iswspace :: Int -> Int
151+#endif
145152
146153-- Code copied from base/Data.Char to INLINE it
147154{-# INLINE isSpace #-}
@@ -154,7 +161,11 @@ isSpace :: Char -> Bool
154161-- so we'll do it like this until there's a way around that.
155162isSpace c
156163 | uc <= 0x377 = uc == 32 || uc - 0x9 <= 4 || uc == 0xa0
164+#if MIN_VERSION_base(4,17,0)
165+ | otherwise = generalCategory c == Space
166+#else
157167 | otherwise = iswspace (ord c) /= 0
168+#endif
158169 where
159170 uc = fromIntegral (ord c) :: Word
160171
benchmark/lib/Streamly/Benchmark/Prelude.hs+3−1
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Streamly.Benchmark.Prelude
35-- Copyright : (c) 2018 Composewell Technologies
@@ -80,7 +82,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream.Type as IsStream
8082import qualified Streamly.Internal.Data.Pipe as Pipe
8183import qualified Streamly.Internal.Data.Stream.Serial as Serial
8284
83−import Gauge
85+import Test.Tasty.Bench
8486import Streamly.Internal.Data.Time.Units
8587
8688-- Common polymorphic stream APIs used across multiple stream modules
benchmark/streamly-benchmarks.cabal+396−172
@@ -54,8 +54,13 @@ flag opt
5454 manual: True
5555 default: True
5656
57−flag use-gauge
58− description: Use gauge instead of tasty-bench for benchmarking
57+flag use-streamly-core
58+ description: Benchmark only core package
59+ manual: True
60+ default: False
61+
62+flag use-prelude
63+ description: Use Prelude instead of Data.Stream for serial benchmarks
5964 manual: True
6065 default: False
6166
@@ -63,9 +68,49 @@ flag use-gauge
6368-- Common stanzas
6469-------------------------------------------------------------------------------
6570
71+common default-extensions
72+ default-extensions:
73+ BangPatterns
74+ CApiFFI
75+ CPP
76+ ConstraintKinds
77+ DeriveDataTypeable
78+ DeriveGeneric
79+ DeriveTraversable
80+ ExistentialQuantification
81+ FlexibleContexts
82+ FlexibleInstances
83+ GeneralizedNewtypeDeriving
84+ InstanceSigs
85+ KindSignatures
86+ LambdaCase
87+ MagicHash
88+ MultiParamTypeClasses
89+ PatternSynonyms
90+ RankNTypes
91+ RecordWildCards
92+ ScopedTypeVariables
93+ TupleSections
94+ TypeApplications
95+ TypeFamilies
96+ TypeOperators
97+ ViewPatterns
98+
99+ -- MonoLocalBinds, enabled by TypeFamilies, causes performance
100+ -- regressions. Disable it. This must come after TypeFamilies,
101+ -- otherwise TypeFamilies will enable it again.
102+ NoMonoLocalBinds
103+
104+ -- UndecidableInstances -- Does not show any perf impact
105+ -- UnboxedTuples -- interferes with (#.)
106+
66107common compile-options
108+ import: default-extensions
67109 default-language: Haskell2010
68110
111+ if flag(use-streamly-core)
112+ cpp-options: -DUSE_STREAMLY_CORE
113+
69114 if flag(dev)
70115 cpp-options: -DDEVBUILD
71116
@@ -75,16 +120,29 @@ common compile-options
75120 if flag(inspection)
76121 cpp-options: -DINSPECTION
77122
78− ghc-options: -Wall
79− -Wcompat
80− -Wunrecognised-warning-flags
81− -Widentities
82− -Wincomplete-record-updates
83− -Wincomplete-uni-patterns
84− -Wredundant-constraints
85− -Wnoncanonical-monad-instances
86− -Rghc-timing
87− -Wmissing-export-lists
123+ ghc-options: -Weverything
124+ -Wno-implicit-prelude
125+ -Wno-missing-deriving-strategies
126+ -Wno-missing-exported-signatures
127+ -Wno-missing-import-lists
128+ -Wno-missing-local-signatures
129+ -Wno-missing-safe-haskell-mode
130+ -Wno-missed-specialisations
131+ -Wno-all-missed-specialisations
132+ -Wno-monomorphism-restriction
133+ -Wno-prepositive-qualified-module
134+ -Wno-unsafe
135+ -Wno-unused-packages
136+ -Rghc-timing
137+
138+ if impl(ghc >= 9.2)
139+ ghc-options:
140+ -Wno-missing-kind-signatures
141+ -Wno-operator-whitespace
142+
143+ if impl(ghc >= 9.8)
144+ ghc-options:
145+ -Wno-missing-role-annotations
88146
89147 if flag(has-llvm)
90148 ghc-options: -fllvm
@@ -93,15 +151,17 @@ common compile-options
93151 ghc-options: -Wmissed-specialisations
94152 -Wall-missed-specialisations
95153
96− if flag(dev) || flag(debug)
97− ghc-options: -fno-ignore-asserts
98−
99154common optimization-options
100155 if flag(opt)
101156 ghc-options: -O2
102157 -fdicts-strict
103158 -fspec-constr-recursive=16
104159 -fmax-worker-args=16
160+
161+ -- For this to be effective it must come after the -O2 option
162+ if flag(dev) || flag(debug)
163+ ghc-options: -fno-ignore-asserts
164+
105165 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
106166 ghc-options: -fplugin Fusion.Plugin
107167 else
@@ -115,40 +175,34 @@ common bench-depends
115175 -- Core libraries shipped with ghc, the min and max
116176 -- constraints of these libraries should match with
117177 -- the GHC versions we support
118− base >= 4.9 && < 4.17
119− , deepseq >= 1.4.1 && < 1.5
120− , mtl >= 2.2 && < 2.3
178+ base >= 4.9 && < 4.20
179+ , deepseq >= 1.4.1 && < 1.6
180+ , mtl >= 2.2 && < 2.3.2
121181
122182 -- other libraries
123− , streamly
124− , streamly-core
183+ , exceptions >= 0.8 && < 0.11
125184 , random >= 1.0 && < 2.0
126185 , transformers >= 0.4 && < 0.7
127− , containers >= 0.5 && < 0.7
186+ , containers >= 0.5 && < 0.8
128187 , hashable >= 1.3 && < 1.5
129188 , unordered-containers >= 0.2 && < 0.3
130189 , process >= 1.4 && < 1.7
131190 , directory >= 1.2.2 && < 1.4
132− , filepath >= 1.4.1 && < 1.5
133− , ghc-prim >= 0.4 && < 0.9
191+ , filepath >= 1.4.1 && < 1.6
192+ , ghc-prim >= 0.4 && < 0.12
193+ , tasty-bench >= 0.3 && < 0.4
194+ , tasty >= 1.4.1 && < 1.6
195+ , streamly-core
134196
135− if flag(use-gauge)
136− build-depends: gauge >= 0.2.4 && < 0.3
137− else
138− build-depends: tasty-bench >= 0.3 && < 0.4
139− , tasty >= 1.4.1 && < 1.5
140− mixins: tasty-bench
141− (Test.Tasty.Bench as Gauge
142− , Test.Tasty.Bench as Gauge.Main
143− )
197+ if !flag(use-streamly-core)
198+ build-depends: streamly
144199
145200 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
146201 build-depends:
147202 fusion-plugin >= 0.2 && < 0.3
148203 if flag(inspection)
149− build-depends: template-haskell >= 2.14 && < 2.17
150− , inspection-testing >= 0.4 && < 0.5
151− , ghc-prim >= 0.2 && < 0.9
204+ build-depends: template-haskell >= 2.14 && < 2.22
205+ , inspection-testing >= 0.4 && < 0.6
152206 -- Array uses a Storable constraint in dev build making several inspection
153207 -- tests fail
154208 if flag(dev) && flag(inspection)
@@ -162,8 +216,10 @@ library
162216 import: lib-options, bench-depends
163217 hs-source-dirs: lib
164218 exposed-modules: Streamly.Benchmark.Common
165− , Streamly.Benchmark.Common.Handle
166− , Streamly.Benchmark.Prelude
219+ , Streamly.Benchmark.Common.Handle
220+ if flag(use-prelude)
221+ exposed-modules: Streamly.Benchmark.Prelude
222+
167223
168224-------------------------------------------------------------------------------
169225-- Benchmarks
@@ -191,125 +247,142 @@ common bench-options-threaded
191247-- Serial Streams
192248-------------------------------------------------------------------------------
193249
194−benchmark Prelude.Serial
250+benchmark Data.Stream
195251 import: bench-options
196252 type: exitcode-stdio-1.0
197− hs-source-dirs: Streamly/Benchmark/Prelude
198− main-is: Serial.hs
253+ hs-source-dirs: Streamly/Benchmark/Data
254+ main-is: Stream.hs
199255 other-modules:
200− Serial.Generation
201− , Serial.Elimination
202− , Serial.Transformation
203− , Serial.NestedStream
204− , Serial.NestedFold
205− , Serial.Split
206− , Serial.Exceptions
207− , Serial.Lift
208− if impl(ghcjs)
209− buildable: False
210− else
211− buildable: True
256+ Stream.Generate
257+ Stream.Eliminate
258+ Stream.Transform
259+ Stream.Reduce
260+ Stream.Expand
261+ Stream.Lift
262+ Stream.Common
263+ if !flag(use-streamly-core)
264+ other-modules:
265+ Stream.Exceptions
212266 if flag(limit-build-mem)
213267 if flag(dev)
214268 ghc-options: +RTS -M3500M -RTS
215269 else
216− ghc-options: +RTS -M2000M -RTS
270+ ghc-options: +RTS -M2500M -RTS
217271
218−
219−benchmark Prelude.WSerial
272+-- Use StreamK functions where possible, converting to StreaK to StreamD
273+benchmark Data.Stream.StreamDK
220274 import: bench-options
221275 type: exitcode-stdio-1.0
222− hs-source-dirs: Streamly/Benchmark/Prelude
223− main-is: WSerial.hs
224− if impl(ghcjs)
276+ hs-source-dirs: Streamly/Benchmark/Data
277+ main-is: Stream.hs
278+ other-modules:
279+ Stream.Generate
280+ Stream.Eliminate
281+ Stream.Transform
282+ Stream.Reduce
283+ Stream.Expand
284+ Stream.Lift
285+ Stream.Common
286+ if !flag(use-streamly-core)
287+ other-modules:
288+ Stream.Exceptions
289+ -- Cannot use USE_STREAMK and USE_PRELUDE together
290+ if flag(use-prelude)
225291 buildable: False
226− else
227− buildable: True
292+ cpp-options: -DUSE_STREAMK
228293 if flag(limit-build-mem)
229− ghc-options: +RTS -M750M -RTS
294+ if flag(dev)
295+ ghc-options: +RTS -M3500M -RTS
296+ else
297+ ghc-options: +RTS -M2500M -RTS
230298
231−benchmark Prelude.Merge
232− import: bench-options
299+benchmark Data.Stream.Concurrent
300+ import: bench-options-threaded
233301 type: exitcode-stdio-1.0
234− hs-source-dirs: Streamly/Benchmark/Prelude
235− main-is: Merge.hs
236− if impl(ghcjs)
302+ hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
303+ main-is: Concurrent.hs
304+ other-modules:
305+ Stream.ConcurrentCommon
306+ Stream.Common
307+ if flag(use-streamly-core) || impl(ghcjs)
237308 buildable: False
238309 else
239310 buildable: True
240311
241−benchmark Prelude.ZipSerial
242− import: bench-options
312+benchmark Data.Stream.ConcurrentInterleaved
313+ import: bench-options-threaded
243314 type: exitcode-stdio-1.0
244− hs-source-dirs: Streamly/Benchmark/Prelude
245− main-is: ZipSerial.hs
246− if impl(ghcjs)
315+ hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
316+ main-is: ConcurrentInterleaved.hs
317+ other-modules:
318+ Stream.ConcurrentCommon
319+ Stream.Common
320+ if flag(use-streamly-core) || impl(ghcjs)
247321 buildable: False
248322 else
249323 buildable: True
250324
251−benchmark Prelude.ZipAsync
252− import: bench-options
325+benchmark Data.Stream.ConcurrentEager
326+ import: bench-options-threaded
253327 type: exitcode-stdio-1.0
254− hs-source-dirs: Streamly/Benchmark/Prelude
255− main-is: ZipAsync.hs
256− if impl(ghcjs)
328+ hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
329+ main-is: ConcurrentEager.hs
330+ other-modules:
331+ Stream.ConcurrentCommon
332+ Stream.Common
333+ if flag(use-streamly-core) || impl(ghcjs)
257334 buildable: False
258335 else
259336 buildable: True
260− if flag(limit-build-mem)
261− ghc-options: +RTS -M1000M -RTS
262337
263−
264−benchmark Prelude.Ahead
338+benchmark Data.Stream.ConcurrentOrdered
265339 import: bench-options-threaded
266340 type: exitcode-stdio-1.0
267− hs-source-dirs: Streamly/Benchmark/Prelude
268− main-is: Ahead.hs
269− if impl(ghcjs)
341+ hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
342+ main-is: ConcurrentOrdered.hs
343+ other-modules:
344+ Stream.ConcurrentCommon
345+ Stream.Common
346+ if flag(use-streamly-core) || impl(ghcjs)
270347 buildable: False
271348 else
272349 buildable: True
273350
274−benchmark Prelude.Async
275− import: bench-options-threaded
351+benchmark Data.Unbox
352+ import: bench-options
276353 type: exitcode-stdio-1.0
277− hs-source-dirs: Streamly/Benchmark/Prelude
278− main-is: Async.hs
279− if impl(ghcjs)
280− buildable: False
281− else
282− buildable: True
354+ hs-source-dirs: .
355+ cpp-options: -DUSE_UNBOX
356+ main-is: Streamly/Benchmark/Data/Serialize.hs
283357
284−benchmark Prelude.WAsync
285− import: bench-options-threaded
358+benchmark Data.Unbox.Derive.TH
359+ import: bench-options
286360 type: exitcode-stdio-1.0
287− hs-source-dirs: Streamly/Benchmark/Prelude
288− main-is: WAsync.hs
289− if impl(ghcjs)
290− buildable: False
291− else
292− buildable: True
361+ hs-source-dirs: .
362+ cpp-options: -DUSE_UNBOX
363+ cpp-options: -DUSE_TH
364+ main-is: Streamly/Benchmark/Data/Serialize.hs
293365
294−benchmark Prelude.Parallel
295− import: bench-options-threaded
366+benchmark Data.Serialize
367+ import: bench-options
296368 type: exitcode-stdio-1.0
297− hs-source-dirs: Streamly/Benchmark/Prelude
298− main-is: Parallel.hs
299− if impl(ghcjs)
300− buildable: False
301− else
302− buildable: True
369+ hs-source-dirs: .
370+ cpp-options: -DUSE_TH
371+ main-is: Streamly/Benchmark/Data/Serialize.hs
372+ build-depends: QuickCheck, template-haskell
373+ other-modules:
374+ Streamly.Benchmark.Data.Serialize.TH
375+ Streamly.Benchmark.Data.Serialize.RecCompatible
376+ Streamly.Benchmark.Data.Serialize.RecNonCompatible
303377 if flag(limit-build-mem)
304− ghc-options: +RTS -M2000M -RTS
305−
378+ ghc-options: +RTS -M1000M -RTS
306379
307380benchmark Data.Unfold
308381 import: bench-options
309382 type: exitcode-stdio-1.0
310383 hs-source-dirs: .
311384 main-is: Streamly/Benchmark/Data/Unfold.hs
312− if impl(ghcjs)
385+ if flag(use-streamly-core) || impl(ghcjs)
313386 buildable: False
314387 else
315388 buildable: True
@@ -319,7 +392,7 @@ benchmark Data.Fold
319392 type: exitcode-stdio-1.0
320393 hs-source-dirs: Streamly/Benchmark/Data
321394 main-is: Fold.hs
322− if impl(ghcjs)
395+ if flag(use-streamly-core) || impl(ghcjs)
323396 buildable: False
324397 else
325398 buildable: True
@@ -329,12 +402,16 @@ benchmark Data.Fold.Window
329402 type: exitcode-stdio-1.0
330403 hs-source-dirs: Streamly/Benchmark/Data/Fold
331404 main-is: Window.hs
405+ if flag(use-streamly-core)
406+ buildable: False
407+ else
408+ buildable: True
332409
333−benchmark Data.Parser.ParserD
410+benchmark Data.Parser
334411 import: bench-options
335412 type: exitcode-stdio-1.0
336− hs-source-dirs: Streamly/Benchmark/Data/Parser
337− main-is: ParserD.hs
413+ hs-source-dirs: Streamly/Benchmark/Data
414+ main-is: Parser.hs
338415 if impl(ghcjs)
339416 buildable: False
340417 else
@@ -344,12 +421,13 @@ benchmark Data.Parser.ParserD
344421 if flag(dev)
345422 ghc-options: +RTS -M3000M -RTS
346423 else
347− ghc-options: +RTS -M750M -RTS
424+ ghc-options: +RTS -M2000M -RTS
348425
349−benchmark Data.Parser.ParserK
426+benchmark Data.ParserK
350427 import: bench-options
351428 type: exitcode-stdio-1.0
352− hs-source-dirs: Streamly/Benchmark/Data/Parser
429+ hs-source-dirs: Streamly/Benchmark/Data
430+ cpp-options: -DBENCH_SINGULAR
353431 main-is: ParserK.hs
354432 if impl(ghcjs)
355433 buildable: False
@@ -357,15 +435,11 @@ benchmark Data.Parser.ParserK
357435 buildable: True
358436 build-depends: exceptions >= 0.8 && < 0.11
359437
360−-- Note: to use this we have to set DISABLE_FUSION in ParserD.hs so that
361−-- the rewrite rules are disabled. We can also use the "no-fusion" build
362−-- flag but we need to keep in mind that it disables fusion for streams
363−-- as well.
364−benchmark Data.Parser.FromParserK
438+benchmark Data.ParserK.Chunked
365439 import: bench-options
366440 type: exitcode-stdio-1.0
367− hs-source-dirs: Streamly/Benchmark/Data/Parser
368− cpp-options: -DFROM_PARSERK
441+ hs-source-dirs: Streamly/Benchmark/Data
442+ cpp-options: -DBENCH_CHUNKED
369443 main-is: ParserK.hs
370444 if impl(ghcjs)
371445 buildable: False
@@ -373,65 +447,167 @@ benchmark Data.Parser.FromParserK
373447 buildable: True
374448 build-depends: exceptions >= 0.8 && < 0.11
375449
376−benchmark Data.Parser
450+benchmark Data.ParserK.Chunked.Generic
377451 import: bench-options
378452 type: exitcode-stdio-1.0
379453 hs-source-dirs: Streamly/Benchmark/Data
380− main-is: Parser.hs
454+ cpp-options: -DBENCH_CHUNKED_GENERIC
455+ main-is: ParserK.hs
381456 if impl(ghcjs)
382457 buildable: False
383458 else
384459 buildable: True
385460 build-depends: exceptions >= 0.8 && < 0.11
386− if flag(limit-build-mem)
387− if flag(dev)
388− ghc-options: +RTS -M3000M -RTS
389− else
390− ghc-options: +RTS -M1000M -RTS
391461
392462-------------------------------------------------------------------------------
393463-- Raw Streams
394464-------------------------------------------------------------------------------
395465
396−benchmark Data.Stream.StreamD
466+benchmark Data.StreamD
397467 import: bench-options
398468 type: exitcode-stdio-1.0
399469 hs-source-dirs: Streamly/Benchmark/Data/Stream
400470 main-is: StreamD.hs
401471 if impl(ghcjs)
402472 buildable: False
403− else
404− buildable: True
405473
406−benchmark Data.Stream.StreamK
474+benchmark Data.StreamK
407475 import: bench-options
408476 type: exitcode-stdio-1.0
409477 hs-source-dirs: Streamly/Benchmark/Data/Stream
410478 main-is: StreamK.hs
411479 if impl(ghcjs)
412480 buildable: False
413− else
414− buildable: True
415481
416−benchmark Data.Stream.StreamDK
482+benchmark Data.Stream.ToStreamK
417483 import: bench-options
418484 type: exitcode-stdio-1.0
419485 hs-source-dirs: Streamly/Benchmark/Data/Stream
420− main-is: StreamDK.hs
421− if impl(ghcjs)
486+ main-is: ToStreamK.hs
487+ if !flag(dev) || impl(ghcjs)
488+ buildable: False
489+
490+benchmark Data.StreamK.Alt
491+ import: bench-options
492+ type: exitcode-stdio-1.0
493+ hs-source-dirs: Streamly/Benchmark/Data/Stream
494+ main-is: StreamKAlt.hs
495+ if !flag(dev) || impl(ghcjs)
422496 buildable: False
423− else
424− buildable: True
425497
426498executable nano-bench
427499 import: bench-options
428500 hs-source-dirs: .
429501 main-is: NanoBenchmarks.hs
430− if flag(dev)
431− buildable: True
432− else
502+ if !flag(dev)
433503 buildable: False
434504
505+-------------------------------------------------------------------------------
506+-- Streamly.Prelude
507+-------------------------------------------------------------------------------
508+
509+benchmark Prelude
510+ import: bench-options
511+ type: exitcode-stdio-1.0
512+ hs-source-dirs: Streamly/Benchmark/Data
513+ main-is: Stream.hs
514+ other-modules:
515+ Stream.Generate
516+ Stream.Eliminate
517+ Stream.Transform
518+ Stream.Reduce
519+ Stream.Expand
520+ Stream.Lift
521+ Stream.Common
522+ Stream.Split
523+ Stream.Exceptions
524+ cpp-options: -DUSE_PRELUDE
525+ if !flag(use-prelude)
526+ buildable: False
527+ if flag(limit-build-mem)
528+ if flag(dev)
529+ ghc-options: +RTS -M3500M -RTS
530+ else
531+ ghc-options: +RTS -M2500M -RTS
532+
533+benchmark Prelude.WSerial
534+ import: bench-options
535+ type: exitcode-stdio-1.0
536+ hs-source-dirs: Streamly/Benchmark/Prelude
537+ main-is: WSerial.hs
538+ cpp-options: -DUSE_PRELUDE
539+ if !flag(use-prelude)
540+ buildable: False
541+ if flag(limit-build-mem)
542+ ghc-options: +RTS -M750M -RTS
543+
544+benchmark Prelude.Merge
545+ import: bench-options
546+ type: exitcode-stdio-1.0
547+ hs-source-dirs: Streamly/Benchmark/Prelude
548+ main-is: Merge.hs
549+ cpp-options: -DUSE_PRELUDE
550+ if !flag(use-prelude)
551+ buildable: False
552+
553+benchmark Prelude.ZipSerial
554+ import: bench-options
555+ type: exitcode-stdio-1.0
556+ hs-source-dirs: Streamly/Benchmark/Prelude
557+ main-is: ZipSerial.hs
558+ cpp-options: -DUSE_PRELUDE
559+ if !flag(use-prelude)
560+ buildable: False
561+
562+benchmark Prelude.ZipAsync
563+ import: bench-options
564+ type: exitcode-stdio-1.0
565+ hs-source-dirs: Streamly/Benchmark/Prelude
566+ main-is: ZipAsync.hs
567+ cpp-options: -DUSE_PRELUDE
568+ if !flag(use-prelude)
569+ buildable: False
570+ if flag(limit-build-mem)
571+ ghc-options: +RTS -M1000M -RTS
572+
573+benchmark Prelude.Ahead
574+ import: bench-options-threaded
575+ type: exitcode-stdio-1.0
576+ hs-source-dirs: Streamly/Benchmark/Prelude
577+ main-is: Ahead.hs
578+ cpp-options: -DUSE_PRELUDE
579+ if !flag(use-prelude)
580+ buildable: False
581+
582+benchmark Prelude.Async
583+ import: bench-options-threaded
584+ type: exitcode-stdio-1.0
585+ hs-source-dirs: Streamly/Benchmark/Prelude
586+ main-is: Async.hs
587+ cpp-options: -DUSE_PRELUDE
588+ if !flag(use-prelude)
589+ buildable: False
590+
591+benchmark Prelude.WAsync
592+ import: bench-options-threaded
593+ type: exitcode-stdio-1.0
594+ hs-source-dirs: Streamly/Benchmark/Prelude
595+ main-is: WAsync.hs
596+ cpp-options: -DUSE_PRELUDE
597+ if !flag(use-prelude)
598+ buildable: False
599+
600+benchmark Prelude.Parallel
601+ import: bench-options-threaded
602+ type: exitcode-stdio-1.0
603+ hs-source-dirs: Streamly/Benchmark/Prelude
604+ main-is: Parallel.hs
605+ cpp-options: -DUSE_PRELUDE
606+ if !flag(use-prelude)
607+ buildable: False
608+ if flag(limit-build-mem)
609+ ghc-options: +RTS -M2000M -RTS
610+
435611-------------------------------------------------------------------------------
436612-- Concurrent Streams
437613-------------------------------------------------------------------------------
@@ -441,75 +617,101 @@ benchmark Prelude.Concurrent
441617 type: exitcode-stdio-1.0
442618 hs-source-dirs: Streamly/Benchmark/Prelude
443619 main-is: Concurrent.hs
620+ cpp-options: -DUSE_PRELUDE
621+ if !flag(use-prelude)
622+ buildable: False
444623
445624benchmark Prelude.Adaptive
446625 import: bench-options-threaded
447626 type: exitcode-stdio-1.0
448627 hs-source-dirs: Streamly/Benchmark/Prelude
449628 main-is: Adaptive.hs
450− if impl(ghcjs)
629+ cpp-options: -DUSE_PRELUDE
630+ if !flag(use-prelude)
451631 buildable: False
452− else
453− buildable: True
454632
455633benchmark Prelude.Rate
456634 import: bench-options-threaded
457635 type: exitcode-stdio-1.0
458636 hs-source-dirs: Streamly/Benchmark/Prelude
459637 main-is: Rate.hs
460− if impl(ghcjs)
638+ cpp-options: -DUSE_PRELUDE
639+ if !flag(use-prelude)
461640 buildable: False
462− else
463− buildable: True
464641
465642-------------------------------------------------------------------------------
466643-- Array Benchmarks
467644-------------------------------------------------------------------------------
468645
469−benchmark Data.Array
470− import: bench-options
471− type: exitcode-stdio-1.0
472− hs-source-dirs: .
473− main-is: Streamly/Benchmark/Data/Array.hs
474−
475−benchmark Data.Array.Prim
646+benchmark Data.Array.Generic
476647 import: bench-options
477648 type: exitcode-stdio-1.0
478− main-is: Streamly/Benchmark/Data/Array/Prim.hs
479− build-depends: primitive
649+ hs-source-dirs: ., Streamly/Benchmark/Data
650+ main-is: Streamly/Benchmark/Data/Array/Generic.hs
651+ other-modules:
652+ Stream.Common
653+ if flag(use-streamly-core)
654+ buildable: False
655+ else
656+ buildable: True
657+ if flag(limit-build-mem)
658+ ghc-options: +RTS -M1000M -RTS
480659
481660benchmark Data.SmallArray
482661 import: bench-options
483662 type: exitcode-stdio-1.0
484663 main-is: Streamly/Benchmark/Data/Array/SmallArray.hs
664+ if flag(dev) && !flag(use-streamly-core)
665+ buildable: True
666+ else
667+ buildable: False
485668
486−benchmark Data.Array.Prim.Pinned
669+benchmark Data.Array
487670 import: bench-options
488671 type: exitcode-stdio-1.0
489− main-is: Streamly/Benchmark/Data/Array/Prim/Pinned.hs
672+ hs-source-dirs: ., Streamly/Benchmark/Data
673+ main-is: Streamly/Benchmark/Data/Array.hs
674+ other-modules:
675+ Stream.Common
676+ if flag(use-streamly-core)
677+ buildable: False
678+ else
679+ buildable: True
680+ if flag(limit-build-mem)
681+ ghc-options: +RTS -M1500M -RTS
490682
491−benchmark Data.Array.Foreign
683+benchmark Data.MutArray
492684 import: bench-options
493685 type: exitcode-stdio-1.0
494− main-is: Streamly/Benchmark/Data/Array/Foreign.hs
686+ main-is: Streamly/Benchmark/Data/MutArray.hs
495687 if flag(limit-build-mem)
496− ghc-options: +RTS -M1000M -RTS
688+ ghc-options: +RTS -M1500M -RTS
689+ if flag(use-streamly-core)
690+ buildable: False
691+ else
692+ buildable: True
497693
498−benchmark Data.Array.Foreign.Mut
694+-------------------------------------------------------------------------------
695+-- Ring Benchmarks
696+-------------------------------------------------------------------------------
697+
698+benchmark Data.Ring.Unboxed
499699 import: bench-options
500700 type: exitcode-stdio-1.0
501− main-is: Streamly/Benchmark/Data/Array/Foreign/Mut.hs
701+ main-is: Streamly/Benchmark/Data/Ring/Unboxed.hs
702+ if flag(limit-build-mem)
703+ ghc-options: +RTS -M1500M -RTS
502704
503705-------------------------------------------------------------------------------
504706-- Array Stream Benchmarks
505707-------------------------------------------------------------------------------
506708
507−benchmark Data.Array.Stream.Foreign
709+benchmark Data.Array.Stream
508710 import: bench-options
509711 type: exitcode-stdio-1.0
510− hs-source-dirs: Streamly/Benchmark/Data/Array/Stream
511− main-is: Foreign.hs
512− if impl(ghcjs)
712+ hs-source-dirs: Streamly/Benchmark/Data/Array
713+ main-is: Stream.hs
714+ if flag(use-streamly-core) || impl(ghcjs)
513715 buildable: False
514716 else
515717 buildable: True
@@ -527,6 +729,12 @@ benchmark FileSystem.Handle
527729 other-modules:
528730 Handle.Read
529731 , Handle.ReadWrite
732+ if flag(limit-build-mem)
733+ ghc-options: +RTS -M1000M -RTS
734+ if flag(use-streamly-core)
735+ buildable: False
736+ else
737+ buildable: True
530738
531739-------------------------------------------------------------------------------
532740-- Unicode Benchmarks
@@ -537,6 +745,12 @@ benchmark Unicode.Stream
537745 type: exitcode-stdio-1.0
538746 hs-source-dirs: Streamly/Benchmark/Unicode
539747 main-is: Stream.hs
748+ if flag(limit-build-mem)
749+ ghc-options: +RTS -M1000M -RTS
750+ if flag(use-streamly-core)
751+ buildable: False
752+ else
753+ buildable: True
540754
541755benchmark Unicode.Char
542756 import: bench-options
@@ -544,7 +758,7 @@ benchmark Unicode.Char
544758 hs-source-dirs: Streamly/Benchmark/Unicode
545759 main-is: Char.hs
546760 -- Takes too much memory for ghcjs
547− if impl(ghcjs)
761+ if flag(use-streamly-core) || impl(ghcjs)
548762 buildable: False
549763
550764benchmark Unicode.Utf8
@@ -552,3 +766,13 @@ benchmark Unicode.Utf8
552766 type: exitcode-stdio-1.0
553767 hs-source-dirs: Streamly/Benchmark/Unicode
554768 main-is: Utf8.hs
769+ if flag(use-streamly-core)
770+ buildable: False
771+ else
772+ buildable: True
773+
774+benchmark Unicode.Parser
775+ import: bench-options
776+ type: exitcode-stdio-1.0
777+ hs-source-dirs: Streamly/Benchmark/Unicode
778+ main-is: Parser.hs
bin/bench-config.shdeleted−160
@@ -1,160 +0,0 @@
1−#!/usr/bin/env bash
2−
3−BENCH_CONFIG_DIR="$(cd "$(dirname "${BASH_SOURCE[0]}")" &> /dev/null && pwd)"
4−source $BENCH_CONFIG_DIR/targets.sh \
5− || { echo "Cannot source $BENCH_CONFIG_DIR/targets.sh"; exit 1; }
6−
7−# Customization options
8−bench_config () {
9− BENCH_REPORT_DIR=benchmark/bench-report
10− BENCHMARK_PACKAGE_NAME=streamly-benchmarks
11− BENCHMARK_PACKAGE_VERSION=0.0.0
12−
13− USE_GAUGE=0
14− DEFAULT_FIELDS="allocated cputime bytescopied"
15−}
16−
17−#------------------------------------------------------------------------------
18−# benchmark groups
19−#------------------------------------------------------------------------------
20−
21−bench_targets () {
22− targets
23−}
24−
25−#------------------------------------------------------------------------------
26−# RTS options based on the benchmark executable name and benchmark name
27−#------------------------------------------------------------------------------
28−
29−bench_rts_options () {
30− local exe_name
31− local bench_name
32−
33− exe_name="$1"
34− bench_name="$2"
35−
36− # Based on benchmark class
37− case "$bench_name" in
38− */o-1-sp*) echo -n "-K36K -M16M" ;;
39− */o-n-h*) echo -n "-K36K -M32M" ;;
40− */o-n-st*) echo -n "-K1M -M16M" ;;
41− */o-n-sp*) echo -n "-K1M -M32M" ;;
42− *) echo -n "" ;;
43− esac
44−
45− echo -n " "
46− case "$exe_name" in
47− Prelude.Concurrent*) echo -n "-K256K -M384M" ;;
48− *) echo -n "" ;;
49− esac
50−
51− echo -n " "
52− # Based on specific benchmark
53− # XXX Note: for tasty-bench we replace the "." separator in the benchmark names
54− # with "/" for matching with this. It may not work reliably if the benchmark
55− # name already contains ".".
56− case "$bench_name" in
57− Data.Stream.StreamD/o-n-space/elimination/toList) echo -n "-K2M" ;;
58− Data.Stream.StreamK/o-n-space/elimination/toList) echo -n "-K2M" ;;
59−
60− Prelude.Parallel/o-n-heap/mapping/mapM) echo -n "-M256M" ;;
61− Prelude.Parallel/o-n-heap/monad-outer-product/*) echo -n "-M256M" ;;
62− Prelude.Parallel/o-n-space/monad-outer-product/*) echo -n "-K4M -M256M" ;;
63−
64− Prelude.Rate/o-1-space/*) echo -n "-K128K" ;;
65− Prelude.Rate/o-1-space/asyncly/*) echo -n "-K128K" ;;
66−
67− # XXX For GHC-9.0
68− Prelude.Serial/o-1-space/mixed/sum-product-fold) echo -n "-K64M" ;;
69−
70− # XXX These should be moved to o-n-space?
71− Prelude.Serial/o-n-heap/grouping/classifySessionsOf*) echo -n "-K4M -M32M" ;;
72− Prelude.Serial/o-n-heap/Functor/*) echo -n "-K4M -M32M" ;;
73− Prelude.Serial/o-n-heap/transformer/*) echo -n "-K8M -M64M" ;;
74−
75− Prelude.Serial/o-n-space/Functor/*) echo -n "-K4M -M64M" ;;
76− Prelude.Serial/o-n-space/Applicative/*) echo -n "-K8M -M128M" ;;
77− Prelude.Serial/o-n-space/Monad/*) echo -n "-K8M -M64M" ;;
78−
79− # Use -K4M for o-n-space except for grouping
80− Prelude.Serial/o-n-space/grouping/*) echo -n "" ;;
81− Prelude.Serial/o-n-space/*) echo -n "-K4M" ;;
82−
83− Prelude.WSerial/o-n-space/*) echo -n "-K4M" ;;
84−
85− Prelude.Async/o-n-space/monad-outer-product/*) echo -n "-K4M" ;;
86− Prelude.Ahead/o-n-space/monad-outer-product/*) echo -n "-K4M" ;;
87− Prelude.Ahead/o-1-space/*) echo -n "-K128K" ;;
88−
89− Prelude.WAsync/o-n-heap/monad-outer-product/toNull3) echo -n "-M64M" ;;
90− Prelude.WAsync/o-n-space/monad-outer-product/*) echo -n "-K4M" ;;
91−
92− # XXX need to investigate these, taking too much stack
93− Data.Parser.ParserD/o-1-space/some) echo -n "-K8M" ;;
94− Data.Parser/o-1-space/some) echo -n "-K8M" ;;
95− Data.Parser.ParserD/o-1-space/manyTill) echo -n "-K4M" ;;
96− Data.Parser/o-1-space/manyTill) echo -n "-K4M" ;;
97− Data.Parser/o-n-heap/manyAlt) echo -n "-K4M -M128M" ;;
98− Data.Parser/o-n-heap/someAlt) echo -n "-K4M -M128M" ;;
99− Data.Parser/o-n-heap/choice) echo -n "-K16M -M32M" ;;
100− Data.Parser.ParserK/o-n-heap/manyAlt) echo -n "-K4M -M128M" ;;
101− Data.Parser.ParserK/o-n-heap/someAlt) echo -n "-K4M -M128M" ;;
102− Data.Parser.ParserK/o-n-heap/sequence) echo -n "-M64M";;
103− Data.Parser.ParserK/o-n-heap/sequenceA) echo -n "-M64M";;
104−
105− Data.SmallArray/o-1-sp*) echo -n "-K128K" ;;
106− # For tasty-bench
107− Data.Array*/o-1-space/generation/show) echo -n "-M32M" ;;
108− # XXX For GHC-8.10
109− Data.Array/o-1-space/transformationX4/map) echo -n "-M32M" ;;
110− # DEVBUILD only benchmarks - array foldable instance
111− Data.Array.Foreign/o-1-space/elimination/foldable/foldl*) echo -n "-K8M" ;;
112− Data.Array.Foreign/o-1-space/elimination/foldable/sum) echo -n "-K8M" ;;
113− *) echo -n "" ;;
114− esac
115−}
116−
117−#------------------------------------------------------------------------------
118−# Speed options
119−#------------------------------------------------------------------------------
120−
121−bench_speed_options () {
122− local exe_name
123− local bench_name
124−
125− exe_name="$1"
126− bench_name="$2"
127−
128− case "$exe_name" in
129− Prelude.Concurrent) set_super_quick_mode ;;
130− Prelude.Rate) set_super_quick_mode ;;
131− Prelude.Adaptive) set_super_quick_mode;;
132− *) echo -n "" ;;
133− esac
134−
135− # XXX Note: for tasty-bench we replace the "." separator in the benchmark names
136− # with "/" for matching with this. It may not work reliably if the benchmark
137− # name already contains ".".
138−
139− # Use quick options for benchmarks that take too long
140− case "$bench_name" in
141− Prelude.Parallel/o-n-heap/mapping/mapM) set_super_quick_mode ;;
142− Prelude.Parallel/o-n-heap/monad-outer-product/*) set_super_quick_mode ;;
143− Prelude.Parallel/o-n-space/monad-outer-product/*) set_super_quick_mode ;;
144− Prelude.Parallel/o-n-heap/generation/*) use_quicker_mode ;;
145− Prelude.Parallel/o-n-heap/mapping/*) use_quicker_mode ;;
146− Prelude.Parallel/o-n-heap/concat-foldable/*) use_quicker_mode ;;
147−
148− Prelude.Async/o-1-space/monad-outer-product/*) use_quicker_mode ;;
149− Prelude.Async/o-n-space/monad-outer-product/*) use_quicker_mode ;;
150−
151− Prelude.Ahead/o-1-space/monad-outer-product/*) use_quicker_mode ;;
152− Prelude.Ahead/o-n-space/monad-outer-product/*) use_quicker_mode ;;
153−
154− Prelude.WAsync/o-n-heap/monad-outer-product/*) use_quicker_mode ;;
155− Prelude.WAsync/o-n-space/monad-outer-product/*) use_quicker_mode ;;
156−
157− FileSystem.Handle/*) use_quicker_mode ;;
158− *) echo -n "" ;;
159− esac
160−}
bin/bench.shdeleted−15
@@ -1,15 +0,0 @@
1−#!/usr/bin/env bash
2−
3−SCRIPT_DIR=$(cd `dirname $0`; pwd)
4−source $SCRIPT_DIR/bench-config.sh \
5− || { echo "Cannot source $SCRIPT_DIR/bench-config.sh"; exit 1; }
6−
7−bench_config
8−if test -z "$BENCH_REPORT_DIR"
9−then
10− echo "BENCH_REPORT_DIR variable not defined by bench-config() in $SCRIPT_DIR/bench-config.sh"
11− exit 1
12−fi
13−
14−cd $SCRIPT_DIR/..
15−$BENCH_REPORT_DIR/bin/bench-runner.sh --config $SCRIPT_DIR/bench-config.sh "$@"
bin/mk-hscope.sh+1−1
@@ -1,7 +1,7 @@
11#!/usr/bin/env bash
22
33GHC_VERSION=8.10.4
4−STREAMLY_VERSION=0.8.2
4+STREAMLY_VERSION=0.9.0
55
66case `uname` in
77 Darwin) SYSTEM=x86_64-osx;;
bin/replnew file+3
@@ -0,0 +1,3 @@
1+#!/bin/bash
2+
3+cabal repl --project-file cabal.project.O0
bin/run-ci.sh+28−28
@@ -10,7 +10,6 @@
1010
1111SCRIPT_DIR=$(cd "$(dirname "$0")" || exit; pwd)
1212SCRIPT_NAME=$(basename "$0")
13−source "$SCRIPT_DIR/../benchmark/bench-report/bin/build-lib.sh"
1413
1514CABAL_BUILD_OPTIONS="--flag limit-build-mem"
1615
@@ -19,8 +18,8 @@ CABAL_BUILD_OPTIONS="--flag limit-build-mem"
1918#------------------------------------------------------------------------------
2019
2120# XXX take these from command line
22−GHC_PRIME_NIX="ghc8107"
23−GHC_PRIME_VER="8.10"
21+GHC_PRIME_NIX="ghc922"
22+GHC_PRIME_VER="9.2.2"
2423JOBS=1
2524
2625# Without cabal project file, it will not run any tests
@@ -73,9 +72,9 @@ ghc_prime_perf () {
7372 --argstr compiler "$GHC_PRIME_NIX" \
7473 --argstr c2nix "--flag inspection" \
7574 --run "\
76− bin/test.sh --cabal-build-options \
75+ bin/test-runner --cabal-build-options \
7776 \"--jobs=$JOBS --project-file cabal.project.Werror $PERF_FLAGS\";\
78− bin/bench.sh --cabal-build-options \
77+ bin/bench-runner --cabal-build-options \
7978 \"--jobs=$JOBS --project-file cabal.project.Werror $PERF_FLAGS\" \
8079 --quick --raw;"
8180}
@@ -84,7 +83,7 @@ ghc_prime_O0 () {
8483 nix-shell \
8584 --argstr compiler "$GHC_PRIME_NIX" \
8685 --run "\
87− bin/test.sh --cabal-build-options \
86+ bin/test-runner --cabal-build-options \
8887 \"--jobs=$JOBS --project-file cabal.project.O0\""
8988}
9089
@@ -109,7 +108,7 @@ werror () {
109108ghc_prime_Werror () {
110109 nix-shell \
111110 --argstr compiler "$GHC_PRIME_NIX" \
112− --run "cabal build $CABAL_BUILD_OPTIONS --jobs=$JOBS --project-file cabal.project.Werror all"
111+ --run "cabal build $CABAL_BUILD_OPTIONS --jobs=$JOBS --project-file cabal.project.Werror --enable-tests --enable-benchmarks all"
113112}
114113
115114ghc_prime_doctests () {
@@ -128,7 +127,7 @@ ghc_prime_doctests () {
128127ghc_prime_coverage () {
129128 nix-shell \
130129 --argstr compiler "$GHC_PRIME_NIX" \
131− --run "bin/test.sh --cabal-build-options \"--jobs=$JOBS\" --coverage"
130+ --run "bin/test-runner --cabal-build-options \"--jobs=$JOBS\" --coverage"
132131}
133132
134133#------------------------------------------------------------------------------
@@ -139,7 +138,7 @@ ghc_prime_dev_test () {
139138 nix-shell \
140139 --argstr compiler "$GHC_PRIME_NIX" \
141140 --run "\
142− bin/test.sh --cabal-build-options \
141+ bin/test-runner --cabal-build-options \
143142 \"--jobs=$JOBS --flag dev\""
144143}
145144
@@ -147,26 +146,14 @@ ghc_prime_dev_perf () {
147146 nix-shell \
148147 --argstr compiler "$GHC_PRIME_NIX" \
149148 --run "\
150− bin/bench.sh --cabal-build-options \
149+ bin/bench-runner --cabal-build-options \
151150 \"--jobs=$JOBS --flag dev $PERF_FLAGS\" --quick --raw"
152151}
153152
154−ghc_prime_c_malloc () {
155− nix-shell \
156− --argstr compiler "$GHC_PRIME_NIX" \
157− --run "bin/test.sh --cabal-build-options \"--jobs=$JOBS --flag use-c-malloc\""
158−}
159−
160153ghc_prime_debug () {
161154 nix-shell \
162155 --argstr compiler "$GHC_PRIME_NIX" \
163− --run "bin/test.sh --cabal-build-options \"--jobs=$JOBS --flag debug\""
164−}
165−
166−ghc_prime_streamk () {
167− nix-shell \
168− --argstr compiler "$GHC_PRIME_NIX" \
169− --run "bin/test.sh --cabal-build-options \"--jobs=$JOBS --flag streamk\""
156+ --run "bin/test-runner --cabal-build-options \"--jobs=$JOBS --flag debug\""
170157}
171158
172159#------------------------------------------------------------------------------
@@ -213,11 +200,15 @@ ghcHEAD () {
213200# ghcjs
214201#------------------------------------------------------------------------------
215202
203+# Use the following nix expression for ghcjs
204+# nix-env -f https://github.com/composewell/nixpkgs/archive/refs/tags/22.05-composewell.tar.gz -iA pkgs.haskell.compiler.ghcjs
216205ghcjs () {
217− export PATH=~/.local/bin:/opt/ghc/bin:/opt/ghcjs/bin:/usr/local/bin:/usr/bin:/bin:/usr/sbin:/sbin:$PATH
206+ # We don't pass 'CABAL_BUILD_OPTIONS="--flag limit-build-mem"' here as
207+ # ghcjs requires more memory to build. Adding a conditional for ghcjs in
208+ # the cabal file is a maintainence overhead.
218209 packcheck.sh cabal-v2 \
219− GHCVER=8.4.0 \
220− CABAL_BUILD_OPTIONS="$CABAL_BUILD_OPTIONS --jobs=$JOBS" \
210+ GHCVER=8.10.7 \
211+ CABAL_BUILD_OPTIONS="--jobs=$JOBS" \
221212 CABAL_CHECK_RELAX=y \
222213 DISABLE_SDIST_BUILD=y \
223214 DISABLE_TEST=y \
@@ -238,9 +229,7 @@ ghc_prime_O0 \
238229ghc_prime_Werror \
239230ghc_prime_doctests \
240231ghc_prime_coverage \
241−ghc_prime_c_malloc \
242232ghc_prime_debug \
243−ghc_prime_streamk \
244233ghc901 \
245234ghc884 \
246235ghcjs \
@@ -299,6 +288,17 @@ else
299288 fi
300289fi
301290
291+has_item () {
292+ for i in $1
293+ do
294+ if test "$i" = "$2"
295+ then
296+ echo "$i"
297+ break
298+ fi
299+ done
300+}
301+
302302for i in $TARGETS
303303do
304304 if test "$(has_item "$ALL_TARGETS" "$i")" != "$i"
bin/run-repl-quick.sh+1−1
@@ -13,7 +13,7 @@ set -e
1313
1414SCRIPT_DIR=$(dirname $0)
1515
16−STREAMLY_VERSION=0.8.2
16+STREAMLY_VERSION=0.9.0
1717BENCH_REPORT_DIR=benchmark/bench-report
1818source $SCRIPT_DIR/targets.sh
1919
bin/targets.shdeleted−120
@@ -1,120 +0,0 @@
1−#------------------------------------------------------------------------------
2−# test and benchmark groups
3−#------------------------------------------------------------------------------
4−
5−# Depends on RUNNING_TESTS, RUNNING_BENCHMARKS, RUNNING_DEVBUILD variables
6−# being set for dev_build, test_only, bench_only functions to work. So the
7−# "targets" fucntion should be called only after these are set.
8−
9−# IMPORTANT NOTE: the names "_grp" and "_cmp" suffixes are special, do
10−# not rename them to something else.
11−
12−targets () {
13− base_stream_grp="\
14− `bench_only Data.Stream.StreamD` \
15− `bench_only Data.Stream.StreamK` \
16− `bench_only Data.Stream.StreamDK`"
17−
18− prelude_serial_grp="\
19− Prelude.Serial \
20− Prelude.WSerial \
21− Prelude.ZipSerial"
22−
23− prelude_concurrent_grp="\
24− Prelude.Async \
25− Prelude.WAsync \
26− Prelude.Ahead \
27− Prelude.Parallel \
28− Prelude.ZipAsync"
29−
30− prelude_other_grp="\
31− `test_only Prelude` \
32− $(test_only $(dev_build Prelude.Rate)) \
33− `bench_only Prelude.Rate` \
34− `test_only Prelude.Fold` \
35− `test_only Prelude.Concurrent` \
36− $(bench_only $(dev_build Prelude.Concurrent)) \
37− `bench_only Prelude.Adaptive`"
38−
39− array_grp="\
40− Data.Array \
41− Data.Array.Foreign \
42− Data.Array.Prim \
43− Data.SmallArray \
44− Data.Array.Prim.Pinned"
45−
46− base_parser_grp="\
47− Data.Parser.ParserD \
48− `bench_only Data.Parser.ParserK`"
49−
50− parser_grp="\
51− Data.Fold \
52− Data.Parser"
53−
54− list_grp="\
55− `test_only Data.List.Base` \
56− `test_only Data.List`"
57−
58− #------------------------------------------------------------------------------
59− # Streaming vs non-streaming
60− #------------------------------------------------------------------------------
61− # The "o-1-space" groups of these benchmarks are run with long stream
62− # sizes when --long option is used.
63−
64− infinite_grp="\
65− $prelude_serial_grp \
66− $prelude_concurrent_grp \
67− `bench_only Prelude.Rate`"
68−
69− #------------------------------------------------------------------------------
70− # Benchmark comparison groups
71− #------------------------------------------------------------------------------
72−
73− # *_cmp denotes a comparison benchmark, the benchmarks provided in *_cmp
74− # variables are compared with each other
75− base_stream_cmp="Data.Stream.StreamD Data.Stream.StreamK"
76− serial_wserial_cmp="Prelude.Serial Prelude.WSerial"
77− serial_async_cmp="Prelude.Serial Prelude.Async"
78− concurrent_cmp="Prelude.Async Prelude.WAsync Prelude.Ahead Prelude.Parallel"
79− array_cmp="Data.Array.Foreign Data.Array.Prim Data.Array Data.Array.Prim.Pinned"
80− pinned_array_cmp="Data.Array.Foreign Data.Array.Prim.Pinned"
81− base_parser_cmp=$base_parser_grp
82−
83− COMPARISONS="\
84− base_stream_cmp \
85− serial_wserial_cmp \
86− serial_async_cmp \
87− concurrent_cmp \
88− array_cmp \
89− pinned_array_cmp \
90− base_parser_cmp"
91−
92− #------------------------------------------------------------------------------
93− # All test/benchmark modules must be in at least one of these
94− #------------------------------------------------------------------------------
95−
96− # All groups
97− GROUP_TARGETS="\
98− base_stream_grp \
99− prelude_serial_grp \
100− prelude_concurrent_grp \
101− prelude_other_grp \
102− array_grp \
103− base_parser_grp \
104− parser_grp \
105− list_grp \
106− infinite_grp"
107−
108− # Not in any groups
109− INDIVIDUAL_TARGETS="\
110− Data.Unfold \
111− Unicode.Stream \
112− $(test_only $(dev_build Unicode.Char)) \
113− `bench_only Unicode.Char` \
114− `bench_only Unicode.Utf8` \
115− FileSystem.Handle \
116− `test_only FileSystem.Event` \
117− `test_only Network.Socket` \
118− `test_only Network.Inet.TCP` \
119− `test_only version-bounds`"
120−}
bin/test.shdeleted−247
@@ -1,247 +0,0 @@
1−#!/usr/bin/env bash
2−
3−SCRIPT_DIR=$(dirname $0)
4−
5−STREAMLY_VERSION=0.8.2
6−BENCH_REPORT_DIR=benchmark/bench-report
7−source $SCRIPT_DIR/targets.sh
8−
9−#------------------------------------------------------------------------------
10−# Script
11−#------------------------------------------------------------------------------
12−
13−print_help () {
14− echo "Usage: $0 "
15− echo " [--targets <"target1 target2 ..." | help>]"
16− echo
17− echo " [--quick]"
18− echo " [--with-compiler <compiler exe name>]"
19− echo " [--cabal-build-options <option>]"
20− echo " [--dev-build]"
21− echo
22− echo " [--coverage]"
23− echo " [--hpc-report-options <option>]"
24− echo " [--no-measure]"
25− echo " [--raw]"
26− echo
27− echo " [--rtsopts <option>]"
28− echo " -- <hspec options or test names>"
29− echo
30− echo "--targets: targets to run, use 'help' for list of targets"
31− echo
32− echo "--quick: disable optimizations to build quickly"
33− echo "--cabal-build-options: Pass any cabal build options to be used for build"
34− echo "--dev-build: runs some additional tests"
35− echo
36− echo "--coverage: enable coverage and report coverage info"
37− echo "--hpc-report-options: option for 'hpc report'"
38− echo "--no-measure: with --coverage, do not run tests, only show coverage info"
39− echo "--raw: with --coverage, do not run hpc"
40− echo
41− echo "--rtsopts: pass GHC RTS options to the test executable"
42− echo "Any arguments after a '--' are passed directly to hspec"
43− exit
44−}
45−
46−#-----------------------------------------------------------------------------
47−# Read command line
48−#-----------------------------------------------------------------------------
49−
50−RUNNING_TESTS=y
51−source $BENCH_REPORT_DIR/bin/build-lib.sh
52−
53−USE_GIT_CABAL=1
54−set_common_vars
55−COVERAGE=0
56−MEASURE=1
57−HPC_REPORT_OPTIONS=
58−RAW=0
59−CABAL_BUILD_OPTIONS="--flag limit-build-mem"
60−TEST_QUICK_MODE=0
61−
62−# XXX add a bisect option
63−while test -n "$1"
64−do
65− case $1 in
66− -h|--help|help) print_help ;;
67− # options with arguments
68− --targets) shift; TARGETS=$1; shift ;;
69− --with-compiler) shift; CABAL_WITH_COMPILER=$1; shift ;;
70− --cabal-build-options) shift; CABAL_BUILD_OPTIONS+=" $1"; shift ;;
71− --hpc-report-options) shift; HPC_REPORT_OPTIONS="$1"; shift ;;
72− --rtsopts) shift; RTS_OPTIONS="$1"; shift ;;
73− # flags
74− --raw) RAW=1; shift ;;
75− #--slow) SLOW=1; shift ;; # not implemented
76− --quick) TEST_QUICK_MODE=1; shift ;;
77− --dev-build) RUNNING_DEVBUILD=1 CABAL_BUILD_OPTIONS+=" --flag dev"; shift ;;
78− --coverage) COVERAGE=1; shift ;;
79− --no-measure) MEASURE=0; shift ;;
80− --) shift; break ;;
81− -*|--*) echo "Unknown flags: $*"; echo; print_help ;;
82− *) break ;;
83− esac
84−done
85−TARGET_EXE_ARGS=$*
86−
87−set_derived_vars
88−
89−if test $TEST_QUICK_MODE -eq 1
90−then
91− CABAL_BUILD_OPTIONS+=" --disable-optimization --flags -opt"
92−fi
93−
94−#-----------------------------------------------------------------------------
95−# Determine targets
96−#-----------------------------------------------------------------------------
97−
98−# Defined in targets.sh
99−targets
100−
101−if test "$(has_item "$TARGETS" help)" = "help"
102−then
103− list_target_groups
104− list_targets
105− exit
106−fi
107−
108−DEFAULT_TARGETS="$(all_grp)"
109−TARGETS=$(set_targets)
110−
111−echo "Using targets [$TARGETS]"
112−
113−#-----------------------------------------------------------------------------
114−# Build targets
115−#-----------------------------------------------------------------------------
116−
117−test_exe_rts_opts () {
118− case "$1" in
119− # XXX Data.Array.* heap requirement increased for GHC-8.10
120− Data.Array.Foreign) echo -n "-M128M" ;;
121− Data.Array.Prim) echo -n "-M128M" ;;
122− Data.Array.Prim.Pinned) echo -n "-M128M" ;;
123− Prelude.Rate) echo -n "-M512M" ;;
124− # For -O0 case writeChunks test fails, maybe we should have a separate flag
125− # for O0 case?
126− FileSystem.Handle) echo -n "-K16M" ;;
127− *) if test "$COVERAGE" -eq "1"
128− then
129− echo -n "-K8M -M1024M"
130− else
131− echo -n "-K8M -M64M"
132− fi ;;
133− esac
134−}
135−
136−# $1: bench name
137−# $2: bench executable
138−target_exe_extra_args () {
139− local bench_name=$1
140− local bench_prog=$2
141−
142− echo "+RTS \
143− $(test_exe_rts_opts $(basename $bench_prog)) \
144− $RTS_OPTIONS \
145− -RTS"
146−}
147−
148−if test "$COVERAGE" -eq "1"
149−then
150− # Used to determine the hpc tix dir
151− PACKAGE_FULL_NAME=streamly-$STREAMLY_VERSION
152− case `uname` in
153− Linux) SYSTEM=x86_64-linux ;;
154− *) echo "Unsupported system"; exit 1 ;;
155− esac
156−
157− # With the --enable-coverage option the tests as well as the library get
158− # compiled with -fhpc, and we get coverage for tests as well. But we want to
159− # exclude that, so a project file is needed.
160− CABAL_BUILD_OPTIONS+=" --project-file cabal.project.coverage"
161− mkdir -p $BUILD_DIR/hpc
162−fi
163−BUILD_TEST="$CABAL_EXECUTABLE v2-build $CABAL_BUILD_OPTIONS --enable-tests"
164−
165−if test "$MEASURE" -eq "1"
166−then
167−run_build "$BUILD_TEST" streamly-tests test "$TARGETS"
168−fi
169−
170−#-----------------------------------------------------------------------------
171−# Run targets
172−#-----------------------------------------------------------------------------
173−
174−# $1: target name
175−get_tix_file () {
176− echo $BUILD_DIR/build/$SYSTEM/ghc-${GHC_VERSION}/$PACKAGE_FULL_NAME/hpc/vanilla/tix/$1/$1.tix
177−}
178−
179−# $1: package name
180−# $2: component
181−# $3: target
182−# $4: args generator func
183−run_target () {
184− local package_name=$1
185− local component=$2
186− local target_name=$3
187− local extra_args=$4
188−
189− local target_prog
190−
191− target_prog=$(cabal_target_prog $package_name $component $target_name) || \
192− die "Cannot find executable for target $target_name"
193−
194− echo "Running executable $target_name ..."
195−
196− mkdir -p $(dirname $(get_tix_file $target_name))
197− export HPCTIXFILE=$(get_tix_file $target_name)
198−
199− run_verbose $target_prog $($extra_args $target_name $target_prog) \
200− || die "Target exe failed"
201−
202− # hpc-coveralls fails if there is an empty dir and no .tix file generated
203− rmdir $(dirname $(get_tix_file $target_name)) 2>/dev/null || true
204−}
205−
206−# $1: package name with version
207−# $2: component
208−# $3: targets
209−# $4: args generator func
210−run_targets() {
211− for i in $3
212− do
213− run_target $1 $2 $i $4
214− done
215−}
216−
217−if test "$MEASURE" -eq "1"
218−then
219−run_targets "streamly-tests-0.0.0" t "$TARGETS" target_exe_extra_args
220−fi
221−
222−#-----------------------------------------------------------------------------
223−# Run coverage reports
224−#-----------------------------------------------------------------------------
225−
226−PACKAGE_NAME=streamly-$STREAMLY_VERSION
227−MIX_DIR=$BUILD_DIR/build/$SYSTEM/ghc-${GHC_VERSION}/$PACKAGE_NAME/hpc/vanilla/mix/$PACKAGE_NAME/
228−ALLTIX=$BUILD_DIR/hpc/all.tix
229−
230−if test "$COVERAGE" -eq "1" -a "$RAW" -eq 0
231−then
232− TIXFILES=
233− for i in $TARGETS
234− do
235− tixfile="$(get_tix_file ${i})"
236− if test -f "$tixfile"
237− then
238− TIXFILES+="$tixfile "
239− fi
240− done
241−
242− #echo "Combining tix files:"
243− #echo $TIXFILES | tr ' ' '\n'
244− hpc sum --union --output=$ALLTIX $TIXFILES
245− run_verbose hpc markup $ALLTIX --hpcdir $MIX_DIR
246− run_verbose hpc report $ALLTIX $HPC_REPORT_OPTIONS --hpcdir $MIX_DIR
247−fi
cabal.project.O0+4−4
@@ -9,16 +9,16 @@ packages:
99
1010package streamly
1111 flags: -opt
12− ghc-options: -O0 -Werror
12+ ghc-options: -O0
1313
1414package streamly-core
1515 flags: -opt
16− ghc-options: -O0 -Werror
16+ ghc-options: -O0
1717
1818package streamly-tests
1919 flags: -opt
20− ghc-options: -O0 -Werror
20+ ghc-options: -O0
2121
2222package streamly-benchmarks
2323 flags: -opt
24− ghc-options: -O0 -Werror
24+ ghc-options: -O0
cabal.project.Werror-nocode+7−3
@@ -4,14 +4,18 @@ packages:
44 test
55 core
66
7−package streamly
8− ghc-options: -Werror -fno-code
9−
107package streamly-core
8+ flags: -opt
9+ ghc-options: -Werror -O0
10+
11+package streamly
12+ flags: -opt
1113 ghc-options: -Werror -fno-code
1214
1315package streamly-benchmarks
16+ flags: -opt
1417 ghc-options: -Werror -fno-code
1518
1619package streamly-tests
20+ flags: -opt
1721 ghc-options: -Werror -fno-code
cabal.project.doctest+10−4
@@ -1,18 +1,24 @@
11packages: streamly.cabal
22 , core/streamly-core.cabal
3− , docs/streamly-docs.cabal
3+ -- , docs/streamly-docs.cabal
4+ -- for QuickCheck in property doctests
5+ , test/streamly-tests.cabal
46
57-- Keep the flags same as cabal.project.O0 because we utilize the same build
68-- for doctest in CI.
79
810package streamly
911 flags: -opt
10− ghc-options: -O0 -Werror
12+ ghc-options: -O0
1113
1214package streamly-core
1315 flags: -opt
14− ghc-options: -O0 -Werror
16+ ghc-options: -O0
1517
1618package streamly-docs
1719 flags: -opt
18− ghc-options: -O0 -Werror
20+ ghc-options: -O0
21+
22+package streamly-tests
23+ flags: -opt
24+ ghc-options: -O0
cabal.project.ghc-head+9−1
@@ -24,4 +24,12 @@ active-repositories: hackage.haskell.org, head.hackage.ghc.haskell.org:override
2424source-repository-package
2525 type: git
2626 location: https://github.com/composewell/fusion-plugin
27− tag: 5fc7a38c9106e643b5ebde61400d54813a071d7b
27+ tag: 3c6535a7027d60d88c37b9a601cb180b805e7431
28+
29+source-repository-package
30+ type: git
31+ location: https://github.com/rrnewton/haskell-lockfree
32+ tag: 00a70cfe74994b41eb3627c752170d1e82118a8e
33+ subdir: lockfree-queue
34+
35+allow-newer: all
cabal.project.packdiffnew file+9
@@ -0,0 +1,9 @@
1+source-repository-package
2+ type: git
3+ location: https://github.com/composewell/packdiff.git
4+ tag: b11a50c9c0523382a19eebc0b12efdae194406a9
5+
6+source-repository-package
7+ type: git
8+ location: https://github.com/composewell/streamly-process.git
9+ tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
cabal.project.reportnew file+30
@@ -0,0 +1,30 @@
1+packages:
2+ targets/streamly-targets.cabal
3+ benchmark/bench-runner/bench-runner.cabal
4+ test/test-runner/test-runner.cabal
5+
6+package bench-report
7+ flags: +no-charts
8+
9+package bench-show
10+ flags: +no-charts
11+
12+source-repository-package
13+ type: git
14+ location: https://github.com/composewell/bench-report.git
15+ tag: 3b50bf0ad06f746bca42f30c8d40a0426e159af3
16+
17+source-repository-package
18+ type: git
19+ location: https://github.com/composewell/streamly-coreutils.git
20+ tag: 5dbb8bcefac3aefd5eb298dc410b11e36e79f35a
21+
22+source-repository-package
23+ type: git
24+ location: https://github.com/composewell/streamly-shell.git
25+ tag: b0c6318119d1cc5e2106343f17b5cff2ad94417f
26+
27+source-repository-package
28+ type: git
29+ location: https://github.com/composewell/streamly-process.git
30+ tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
cabal.project.streamlynew file+10
@@ -0,0 +1,10 @@
1+packages: streamly.cabal
2+ , test/streamly-tests.cabal
3+ , benchmark/streamly-benchmarks.cabal
4+ , docs/streamly-docs.cabal
5+
6+source-repository-package
7+ type: git
8+ location: https://github.com/composewell/streamly
9+ tag: master
10+ subdir: core
configure+9−9
@@ -1,6 +1,6 @@
11#! /bin/sh
22# Guess values for system-dependent variables and create Makefiles.
3−# Generated by GNU Autoconf 2.71 for streamly 0.8.2.
3+# Generated by GNU Autoconf 2.71 for streamly 0.10.1.
44#
55# Report bugs to <streamly@composewell.com>.
66#
@@ -610,8 +610,8 @@ MAKEFLAGS=
610610# Identity of this package.
611611PACKAGE_NAME='streamly'
612612PACKAGE_TARNAME='streamly'
613−PACKAGE_VERSION='0.8.2'
614−PACKAGE_STRING='streamly 0.8.2'
613+PACKAGE_VERSION='0.10.1'
614+PACKAGE_STRING='streamly 0.10.1'
615615PACKAGE_BUGREPORT='streamly@composewell.com'
616616PACKAGE_URL='https://streamly.composewell.com'
617617
@@ -1224,7 +1224,7 @@ if test "$ac_init_help" = "long"; then
12241224 # Omit some internal or obsolete options to make the list less imposing.
12251225 # This message is too long to be a string in the A/UX 3.1 sh.
12261226 cat <<_ACEOF
1227−\`configure' configures streamly 0.8.2 to adapt to many kinds of systems.
1227+\`configure' configures streamly 0.10.1 to adapt to many kinds of systems.
12281228
12291229Usage: $0 [OPTION]... [VAR=VALUE]...
12301230
@@ -1286,7 +1286,7 @@ fi
12861286
12871287if test -n "$ac_init_help"; then
12881288 case $ac_init_help in
1289− short | recursive ) echo "Configuration of streamly 0.8.2:";;
1289+ short | recursive ) echo "Configuration of streamly 0.10.1:";;
12901290 esac
12911291 cat <<\_ACEOF
12921292
@@ -1372,7 +1372,7 @@ fi
13721372test -n "$ac_init_help" && exit $ac_status
13731373if $ac_init_version; then
13741374 cat <<\_ACEOF
1375−streamly configure 0.8.2
1375+streamly configure 0.10.1
13761376generated by GNU Autoconf 2.71
13771377
13781378Copyright (C) 2021 Free Software Foundation, Inc.
@@ -1500,7 +1500,7 @@ cat >config.log <<_ACEOF
15001500This file contains any messages produced by compilers while
15011501running configure, to aid debugging if configure makes a mistake.
15021502
1503−It was created by streamly $as_me 0.8.2, which was
1503+It was created by streamly $as_me 0.10.1, which was
15041504generated by GNU Autoconf 2.71. Invocation command line was
15051505
15061506 $ $0$ac_configure_args_raw
@@ -3800,7 +3800,7 @@ cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
38003800# report actual input values of CONFIG_FILES etc. instead of their
38013801# values after options handling.
38023802ac_log="
3803−This file was extended by streamly $as_me 0.8.2, which was
3803+This file was extended by streamly $as_me 0.10.1, which was
38043804generated by GNU Autoconf 2.71. Invocation command line was
38053805
38063806 CONFIG_FILES = $CONFIG_FILES
@@ -3856,7 +3856,7 @@ ac_cs_config_escaped=`printf "%s\n" "$ac_cs_config" | sed "s/^ //; s/'/'\\\\\\\\
38563856cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
38573857ac_cs_config='$ac_cs_config_escaped'
38583858ac_cs_version="\\
3859−streamly config.status 0.8.2
3859+streamly config.status 0.10.1
38603860configured by $0, generated by GNU Autoconf 2.71,
38613861 with options \\"\$ac_cs_config\\"
38623862
configure.ac+1−1
@@ -3,7 +3,7 @@
33# See https://www.gnu.org/software/autoconf/manual/autoconf.html for help on
44# the macros used in this file.
55
6−AC_INIT([streamly], [0.8.2], [streamly@composewell.com], [streamly], [https://streamly.composewell.com])
6+AC_INIT([streamly], [0.10.1], [streamly@composewell.com], [streamly], [https://streamly.composewell.com])
77
88# To suppress "WARNING: unrecognized options: --with-compiler"
99AC_ARG_WITH([compiler], [GHC])
core/Changelog.mdnew file+1
@@ -0,0 +1 @@
1+docs/Changelog.md
core/LICENSEnew file+322
@@ -0,0 +1,322 @@
1+Copyright (c) 2017, Composewell Technologies
2+All rights reserved.
3+
4+Redistribution and use in source and binary forms, with or without
5+modification, are permitted provided that the following conditions are met:
6+
7+1. Redistributions of source code must retain the above copyright notice, this
8+list of conditions and the following disclaimer.
9+
10+2. Redistributions in binary form must reproduce the above copyright notice,
11+this list of conditions and the following disclaimer in the documentation
12+and/or other materials provided with the distribution.
13+
14+3. Neither the name of the copyright holder nor the names of its contributors
15+may be used to endorse or promote products derived from this software without
16+specific prior written permission.
17+
18+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
19+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
20+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
21+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
22+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
24+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
25+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
26+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28+
29+-------------------------------------------------------------------------------
30+base-4.12.0.0 (http://hackage.haskell.org/package/base-4.12.0.0)
31+-------------------------------------------------------------------------------
32+This library (libraries/base) is derived from code from several
33+sources:
34+
35+ * Code from the GHC project which is largely (c) The University of
36+ Glasgow, and distributable under a BSD-style license (see below),
37+
38+ * Code from the Haskell 98 Report which is (c) Simon Peyton Jones
39+ and freely redistributable (but see the full license for
40+ restrictions).
41+
42+ * Code from the Haskell Foreign Function Interface specification,
43+ which is (c) Manuel M. T. Chakravarty and freely redistributable
44+ (but see the full license for restrictions).
45+
46+The full text of these licenses is reproduced below. All of the
47+licenses are BSD-style or compatible.
48+
49+The Glasgow Haskell Compiler License
50+
51+Copyright 2004, The University Court of the University of Glasgow.
52+All rights reserved.
53+
54+Redistribution and use in source and binary forms, with or without
55+modification, are permitted provided that the following conditions are met:
56+
57+- Redistributions of source code must retain the above copyright notice,
58+this list of conditions and the following disclaimer.
59+
60+- Redistributions in binary form must reproduce the above copyright notice,
61+this list of conditions and the following disclaimer in the documentation
62+and/or other materials provided with the distribution.
63+
64+- Neither name of the University nor the names of its contributors may be
65+used to endorse or promote products derived from this software without
66+specific prior written permission.
67+
68+THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
69+GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
70+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
71+FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
72+UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
73+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
74+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
75+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
76+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
77+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
78+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
79+DAMAGE.
80+
81+Code derived from the document "Report on the Programming Language
82+Haskell 98", is distributed under the following license:
83+
84+ Copyright (c) 2002 Simon Peyton Jones
85+
86+ The authors intend this Report to belong to the entire Haskell
87+ community, and so we grant permission to copy and distribute it for
88+ any purpose, provided that it is reproduced in its entirety,
89+ including this Notice. Modified versions of this Report may also be
90+ copied and distributed for any purpose, provided that the modified
91+ version is clearly presented as such, and that it does not claim to
92+ be a definition of the Haskell 98 Language.
93+
94+Code derived from the document "The Haskell 98 Foreign Function
95+Interface, An Addendum to the Haskell 98 Report" is distributed under
96+the following license:
97+
98+ Copyright (c) 2002 Manuel M. T. Chakravarty
99+
100+ The authors intend this Report to belong to the entire Haskell
101+ community, and so we grant permission to copy and distribute it for
102+ any purpose, provided that it is reproduced in its entirety,
103+ including this Notice. Modified versions of this Report may also be
104+ copied and distributed for any purpose, provided that the modified
105+ version is clearly presented as such, and that it does not claim to
106+ be a definition of the Haskell 98 Foreign Function Interface.
107+
108+-------------------------------------------------------------------------------
109+bjoern-2008-2009 (http://bjoern.hoehrmann.de/utf-8/decoder/dfa/)
110+-------------------------------------------------------------------------------
111+Copyright (c) 2008-2009 Bjoern Hoehrmann <bjoern@hoehrmann.de>
112+
113+Permission is hereby granted, free of charge, to any person obtaining a copy of
114+this software and associated documentation files (the "Software"), to deal in
115+the Software without restriction, including without limitation the rights to
116+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
117+of the Software, and to permit persons to whom the Software is furnished to do
118+so, subject to the following conditions:
119+
120+The above copyright notice and this permission notice shall be included in all
121+copies or substantial portions of the Software.
122+
123+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
124+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
125+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
126+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
127+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
128+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
129+SOFTWARE.
130+
131+-------------------------------------------------------------------------------
132+clock-0.7.2 (http://hackage.haskell.org/package/clock-0.7.2)
133+-------------------------------------------------------------------------------
134+Copyright (c) 2009-2012, Cetin Sert
135+Copyright (c) 2010, Eugene Kirpichov
136+
137+All rights reserved.
138+
139+Redistribution and use in source and binary forms, with or without
140+modification, are permitted provided that the following conditions are
141+met:
142+
143+ * Redistributions of source code must retain the above copyright
144+ notice, this list of conditions and the following disclaimer.
145+
146+ * Redistributions in binary form must reproduce the above
147+ copyright notice, this list of conditions and the following
148+ disclaimer in the documentation and/or other materials provided
149+ with the distribution.
150+
151+ * The names of contributors may not be used to endorse or promote
152+ products derived from this software without specific prior
153+ written permission.
154+
155+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
156+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
157+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
158+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
159+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
160+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
161+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
162+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
163+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
164+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
165+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
166+
167+-------------------------------------------------------------------------------
168+foldl-1.4.5 (http://hackage.haskell.org/package/foldl-1.4.5)
169+-------------------------------------------------------------------------------
170+Copyright (c) 2013 Gabriel Gonzalez
171+All rights reserved.
172+
173+Redistribution and use in source and binary forms, with or without modification,
174+are permitted provided that the following conditions are met:
175+ * Redistributions of source code must retain the above copyright notice,
176+ this list of conditions and the following disclaimer.
177+ * Redistributions in binary form must reproduce the above copyright notice,
178+ this list of conditions and the following disclaimer in the documentation
179+ and/or other materials provided with the distribution.
180+ * Neither the name of Gabriel Gonzalez nor the names of other contributors
181+ may be used to endorse or promote products derived from this software
182+ without specific prior written permission.
183+
184+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
185+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
186+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
187+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
188+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
189+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
190+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
191+ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
192+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
193+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
194+
195+-------------------------------------------------------------------------------
196+primitive-0.7.0.0 (https://hackage.haskell.org/package/primitive-0.7.0.0)
197+-------------------------------------------------------------------------------
198+Copyright (c) 2008-2009, Roman Leshchinskiy
199+All rights reserved.
200+
201+Redistribution and use in source and binary forms, with or without
202+modification, are permitted provided that the following conditions are met:
203+
204+- Redistributions of source code must retain the above copyright notice,
205+this list of conditions and the following disclaimer.
206+
207+- Redistributions in binary form must reproduce the above copyright notice,
208+this list of conditions and the following disclaimer in the documentation
209+and/or other materials provided with the distribution.
210+
211+- Neither name of the University nor the names of its contributors may be
212+used to endorse or promote products derived from this software without
213+specific prior written permission.
214+
215+THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
216+GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
217+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
218+FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
219+UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
220+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
221+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
222+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
223+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
224+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
225+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
226+DAMAGE.
227+
228+-------------------------------------------------------------------------------
229+transient-0.5.5 (http://hackage.haskell.org/package/transient-0.5.5)
230+-------------------------------------------------------------------------------
231+Copyright © 2014-2016 Alberto G. Corona <https://github.com/agocorona>
232+
233+Permission is hereby granted, free of charge, to any person obtaining a copy of
234+this software and associated documentation files (the "Software"), to deal in
235+the Software without restriction, including without limitation the rights to
236+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
237+the Software, and to permit persons to whom the Software is furnished to do so,
238+subject to the following conditions:
239+
240+The above copyright notice and this permission notice shall be included in all
241+copies or substantial portions of the Software.
242+
243+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
244+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
245+FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
246+COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
247+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
248+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
249+
250+-------------------------------------------------------------------------------
251+vector-0.12.0.2 (http://hackage.haskell.org/package/vector-0.12.0.2)
252+-------------------------------------------------------------------------------
253+Copyright (c) 2008-2012, Roman Leshchinskiy
254+All rights reserved.
255+
256+Redistribution and use in source and binary forms, with or without
257+modification, are permitted provided that the following conditions are met:
258+
259+- Redistributions of source code must retain the above copyright notice,
260+this list of conditions and the following disclaimer.
261+
262+- Redistributions in binary form must reproduce the above copyright notice,
263+this list of conditions and the following disclaimer in the documentation
264+and/or other materials provided with the distribution.
265+
266+- Neither name of the University nor the names of its contributors may be
267+used to endorse or promote products derived from this software without
268+specific prior written permission.
269+
270+THIS SOFTWARE IS PROVIDED BY THE UNIVERSITY COURT OF THE UNIVERSITY OF
271+GLASGOW AND THE CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
272+INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
273+FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
274+UNIVERSITY COURT OF THE UNIVERSITY OF GLASGOW OR THE CONTRIBUTORS BE LIABLE
275+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
276+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
277+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
278+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
279+LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
280+OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
281+DAMAGE.
282+
283+-------------------------------------------------------------------------------
284+th-utilities-0.2.5.0 (https://hackage.haskell.org/package/th-utilities)
285+-------------------------------------------------------------------------------
286+Copyright (c) 2016 FP Complete Corporation.
287+
288+Permission is hereby granted, free of charge, to any person obtaining
289+a copy of this software and associated documentation files (the
290+"Software"), to deal in the Software without restriction, including
291+without limitation the rights to use, copy, modify, merge, publish,
292+distribute, sublicense, and/or sell copies of the Software, and to
293+permit persons to whom the Software is furnished to do so, subject to
294+the following conditions:
295+
296+The above copyright notice and this permission notice shall be
297+included in all copies or substantial portions of the Software.
298+
299+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
300+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
301+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
302+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
303+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
304+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
305+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
306+
307+-------------------------------------------------------------------------------
308+th-abstraction-0.5.0.0 (https://hackage.haskell.org/package/th-abstraction)
309+-------------------------------------------------------------------------------
310+Copyright (c) 2017-2020 Eric Mertens
311+
312+Permission to use, copy, modify, and/or distribute this software for any purpose
313+with or without fee is hereby granted, provided that the above copyright notice
314+and this permission notice appear in all copies.
315+
316+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
317+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
318+FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
319+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
320+OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
321+TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF
322+THIS SOFTWARE.
core/configure+9−9
@@ -1,6 +1,6 @@
11#! /bin/sh
22# Guess values for system-dependent variables and create Makefiles.
3−# Generated by GNU Autoconf 2.71 for streamly-core 0.8.2.
3+# Generated by GNU Autoconf 2.71 for streamly-core 0.2.2.
44#
55# Report bugs to <streamly@composewell.com>.
66#
@@ -610,8 +610,8 @@ MAKEFLAGS=
610610# Identity of this package.
611611PACKAGE_NAME='streamly-core'
612612PACKAGE_TARNAME='streamly-core'
613−PACKAGE_VERSION='0.8.2'
614−PACKAGE_STRING='streamly-core 0.8.2'
613+PACKAGE_VERSION='0.2.2'
614+PACKAGE_STRING='streamly-core 0.2.2'
615615PACKAGE_BUGREPORT='streamly@composewell.com'
616616PACKAGE_URL='https://streamly.composewell.com'
617617
@@ -1256,7 +1256,7 @@ if test "$ac_init_help" = "long"; then
12561256 # Omit some internal or obsolete options to make the list less imposing.
12571257 # This message is too long to be a string in the A/UX 3.1 sh.
12581258 cat <<_ACEOF
1259−\`configure' configures streamly-core 0.8.2 to adapt to many kinds of systems.
1259+\`configure' configures streamly-core 0.2.2 to adapt to many kinds of systems.
12601260
12611261Usage: $0 [OPTION]... [VAR=VALUE]...
12621262
@@ -1318,7 +1318,7 @@ fi
13181318
13191319if test -n "$ac_init_help"; then
13201320 case $ac_init_help in
1321− short | recursive ) echo "Configuration of streamly-core 0.8.2:";;
1321+ short | recursive ) echo "Configuration of streamly-core 0.2.2:";;
13221322 esac
13231323 cat <<\_ACEOF
13241324
@@ -1404,7 +1404,7 @@ fi
14041404test -n "$ac_init_help" && exit $ac_status
14051405if $ac_init_version; then
14061406 cat <<\_ACEOF
1407−streamly-core configure 0.8.2
1407+streamly-core configure 0.2.2
14081408generated by GNU Autoconf 2.71
14091409
14101410Copyright (C) 2021 Free Software Foundation, Inc.
@@ -1622,7 +1622,7 @@ cat >config.log <<_ACEOF
16221622This file contains any messages produced by compilers while
16231623running configure, to aid debugging if configure makes a mistake.
16241624
1625−It was created by streamly-core $as_me 0.8.2, which was
1625+It was created by streamly-core $as_me 0.2.2, which was
16261626generated by GNU Autoconf 2.71. Invocation command line was
16271627
16281628 $ $0$ac_configure_args_raw
@@ -3832,7 +3832,7 @@ cat >>$CONFIG_STATUS <<\_ACEOF || ac_write_fail=1
38323832# report actual input values of CONFIG_FILES etc. instead of their
38333833# values after options handling.
38343834ac_log="
3835−This file was extended by streamly-core $as_me 0.8.2, which was
3835+This file was extended by streamly-core $as_me 0.2.2, which was
38363836generated by GNU Autoconf 2.71. Invocation command line was
38373837
38383838 CONFIG_FILES = $CONFIG_FILES
@@ -3888,7 +3888,7 @@ ac_cs_config_escaped=`printf "%s\n" "$ac_cs_config" | sed "s/^ //; s/'/'\\\\\\\\
38883888cat >>$CONFIG_STATUS <<_ACEOF || ac_write_fail=1
38893889ac_cs_config='$ac_cs_config_escaped'
38903890ac_cs_version="\\
3891−streamly-core config.status 0.8.2
3891+streamly-core config.status 0.2.2
38923892configured by $0, generated by GNU Autoconf 2.71,
38933893 with options \\"\$ac_cs_config\\"
38943894
core/configure.ac+1−1
@@ -3,7 +3,7 @@
33# See https://www.gnu.org/software/autoconf/manual/autoconf.html for help on
44# the macros used in this file.
55
6−AC_INIT([streamly-core], [0.8.2], [streamly@composewell.com], [streamly-core], [https://streamly.composewell.com])
6+AC_INIT([streamly-core], [0.2.2], [streamly@composewell.com], [streamly-core], [https://streamly.composewell.com])
77
88# To suppress "WARNING: unrecognized options: --with-compiler"
99AC_ARG_WITH([compiler], [GHC])
core/docs/ApiChangelogs/0.1.0-0.2.0.txtnew file+1471
@@ -0,0 +1,1471 @@
1+---------------------------------
2+API Annotations
3+---------------------------------
4+
5+[A] : Added
6+[R] : Removed
7+[C] : Changed
8+[O] : Old definition
9+[N] : New definition
10+[D] : Deprecated
11+
12+---------------------------------
13+API diff
14+---------------------------------
15+
16+[C] Streamly.Unicode.Parser
17+ [A] double :: Monad m => Parser Char m Double
18+[C] Streamly.FileSystem.Handle
19+ [A] readWith :: MonadIO m => Int -> Handle -> Stream m Word8
20+ [A] readChunksWith :: MonadIO m => Int -> Handle -> Stream m (Array Word8)
21+[C] Streamly.FileSystem.Dir
22+ [C] readEither
23+ [O] readEither :: MonadIO m => FilePath -> Stream m (Either FilePath FilePath)
24+ [N] readEither :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Either FilePath FilePath)
25+ [C] read
26+ [O] read :: MonadIO m => FilePath -> Stream m FilePath
27+ [N] read :: (MonadIO m, MonadCatch m) => FilePath -> Stream m FilePath
28+[C] Streamly.Data.Unfold
29+ [A] class Enum a => Enumerable a
30+ [A] second :: b -> Unfold m (a, b) c -> Unfold m a c
31+ [A] first :: a -> Unfold m (a, b) c -> Unfold m b c
32+ [A] enumerateFromTo :: (Enumerable a, Monad m) => Unfold m (a, a) a
33+ [A] enumerateFromThenTo :: (Enumerable a, Monad m) => Unfold m (a, a, a) a
34+ [A] enumerateFromThen :: (Enumerable a, Monad m) => Unfold m (a, a) a
35+ [A] enumerateFrom :: (Enumerable a, Monad m) => Unfold m a a
36+[C] Streamly.Data.StreamK
37+ [C] parseChunks
38+ [O] parseChunks :: (Monad m, Unbox a) => ParserK a m b -> StreamK m (Array a) -> m (Either ParseError b)
39+ [N] parseChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b)
40+ [C] parseBreakChunks
41+ [O] parseBreakChunks :: (Monad m, Unbox a) => ParserK a m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
42+ [N] parseBreakChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
43+ [A] parseBreak :: forall m a b. Monad m => ParserK a m b -> StreamK m a -> m (Either ParseError b, StreamK m a)
44+ [A] parse :: Monad m => ParserK a m b -> StreamK m a -> m (Either ParseError b)
45+ [A] handle :: (MonadCatch m, Exception e) => (e -> m (StreamK m a)) -> StreamK m a -> StreamK m a
46+ [A] bracketIO :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> StreamK m a) -> StreamK m a
47+[C] Streamly.Data.Stream
48+ [A] wordsBy :: Monad m => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
49+ [A] splitOn :: Monad m => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
50+ [C] handle
51+ [O] handle :: (MonadCatch m, Exception e) => (e -> Stream m a) -> Stream m a -> Stream m a
52+ [N] handle :: (MonadCatch m, Exception e) => (e -> m (Stream m a)) -> Stream m a -> Stream m a
53+ [A] groupsOf :: Monad m => Int -> Fold m a b -> Stream m a -> Stream m b
54+[C] Streamly.Data.ParserK
55+ [D] fromParser :: (MonadIO m, Unbox a) => Parser a m b -> ParserK (Array a) m b
56+ [D] fromFold :: (MonadIO m, Unbox a) => Fold m a b -> ParserK (Array a) m b
57+ [A] adaptCG :: Monad m => Parser a m b -> ParserK (Array a) m b
58+ [A] adaptC :: (Monad m, Unbox a) => Parser a m b -> ParserK (Array a) m b
59+ [A] adapt :: Monad m => Parser a m b -> ParserK a m b
60+[C] Streamly.Data.Parser
61+ [A] groupByRollingEither :: Monad m => (a -> a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (Either b c)
62+ [A] groupByRolling :: Monad m => (a -> a -> Bool) -> Fold m a b -> Parser a m b
63+[A] Streamly.Data.MutByteArray
64+ [A] class Unbox a
65+ [A] class Serialize a
66+ [A] SerializeConfig
67+ [A] MutByteArray
68+ [A] unpin :: MutByteArray -> IO MutByteArray
69+ [A] sizeOf :: (Unbox a, SizeOfRep (Rep a)) => Proxy a -> Int
70+ [A] serializeAt :: Serialize a => Int -> MutByteArray -> a -> IO Int
71+ [A] pokeAt :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutByteArray -> a -> IO ()
72+ [A] pinnedNew :: Int -> IO MutByteArray
73+ [A] pin :: MutByteArray -> IO MutByteArray
74+ [A] peekAt :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutByteArray -> IO a
75+ [A] new :: Int -> IO MutByteArray
76+ [A] isPinned :: MutByteArray -> Bool
77+ [A] inlineSerializeAt :: Maybe Inline -> SerializeConfig -> SerializeConfig
78+ [A] inlineDeserializeAt :: Maybe Inline -> SerializeConfig -> SerializeConfig
79+ [A] inlineAddSizeTo :: Maybe Inline -> SerializeConfig -> SerializeConfig
80+ [A] deserializeAt :: Serialize a => Int -> MutByteArray -> Int -> IO (Int, a)
81+ [A] deriveUnbox :: Q [Dec] -> Q [Dec]
82+ [A] deriveSerializeWith :: (SerializeConfig -> SerializeConfig) -> Q [Dec] -> Q [Dec]
83+ [A] deriveSerialize :: Q [Dec] -> Q [Dec]
84+ [A] addSizeTo :: Serialize a => Int -> a -> Int
85+[C] Streamly.Data.MutArray.Generic
86+ [A] write :: MonadIO m => Fold m a (MutArray a)
87+ [A] readRev :: MonadIO m => MutArray a -> Stream m a
88+ [A] read :: MonadIO m => MutArray a -> Stream m a
89+ [A] putIndexUnsafe :: forall m a. MonadIO m => Int -> MutArray a -> a -> m ()
90+ [A] modifyIndexUnsafe :: MonadIO m => Int -> MutArray a -> (a -> (a, b)) -> m b
91+ [A] length :: MutArray a -> Int
92+ [A] getIndexUnsafe :: MonadIO m => Int -> MutArray a -> m a
93+ [C] getIndex
94+ [O] getIndex :: MonadIO m => Int -> MutArray a -> m a
95+ [N] getIndex :: MonadIO m => Int -> MutArray a -> m (Maybe a)
96+ [A] fromListN :: MonadIO m => Int -> [a] -> m (MutArray a)
97+ [A] fromList :: MonadIO m => [a] -> m (MutArray a)
98+[C] Streamly.Data.MutArray
99+ [A] unpin :: MutArray a -> IO (MutArray a)
100+ [A] readRev :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Stream m a
101+ [A] read :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Stream m a
102+ [A] putIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> a -> m ()
103+ [D] pokeByteIndex :: Unbox a => Int -> MutByteArray -> a -> IO ()
104+ [A] pokeAt :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutByteArray -> a -> IO ()
105+ [A] pinnedNew :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
106+ [A] pin :: MutArray a -> IO (MutArray a)
107+ [D] peekByteIndex :: Unbox a => Int -> MutByteArray -> IO a
108+ [A] peekAt :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutByteArray -> IO a
109+ [D] newPinned :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
110+ [A] modifyIndexUnsafe :: forall m a b. (MonadIO m, Unbox a) => Int -> MutArray a -> (a -> (a, b)) -> m b
111+ [A] modifyIndex :: forall m a b. (MonadIO m, Unbox a) => Int -> MutArray a -> (a -> (a, b)) -> m b
112+ [A] modify :: forall m a. (MonadIO m, Unbox a) => MutArray a -> (a -> a) -> m ()
113+ [A] isPinned :: MutArray a -> Bool
114+ [A] getIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
115+ [C] getIndex
116+ [O] getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
117+ [N] getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (Maybe a)
118+[C] Streamly.Data.Array.Generic
119+ [A] toList :: Array a -> [a]
120+ [A] getIndex :: Int -> Array a -> Maybe a
121+[C] Streamly.Data.Array
122+ [A] unpin :: Array a -> IO (Array a)
123+ [D] pokeByteIndex :: Unbox a => Int -> MutByteArray -> a -> IO ()
124+ [A] pokeAt :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutByteArray -> a -> IO ()
125+ [A] pin :: Array a -> IO (Array a)
126+ [D] peekByteIndex :: Unbox a => Int -> MutByteArray -> IO a
127+ [A] peekAt :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutByteArray -> IO a
128+ [A] isPinned :: Array a -> Bool
129+[C] Streamly.Console.Stdio
130+
131+---------------------------------
132+Internal API diff
133+---------------------------------
134+
135+[C] Streamly.Internal.Unicode.Stream
136+ [C] writeCharUtf8'
137+ [O] writeCharUtf8' :: Monad m => Fold m Word8 Char
138+ [N] writeCharUtf8' :: Monad m => Parser Word8 m Char
139+[C] Streamly.Internal.Unicode.Parser
140+ [A] number :: Monad m => Parser Char m (Integer, Int)
141+ [A] mkDouble :: Integer -> Int -> Double
142+ [A] doubleParser :: Monad m => Parser Char m (Int, Int)
143+ [C] double
144+ [O] double :: Parser Char m Double
145+ [N] double :: Monad m => Parser Char m Double
146+[R] Streamly.Internal.Serialize.ToBytes
147+[R] Streamly.Internal.Serialize.FromBytes
148+[C] Streamly.Internal.FileSystem.File
149+ [A] writeAppendWith :: (MonadIO m, MonadCatch m) => Int -> FilePath -> Stream m Word8 -> m ()
150+ [A] writeAppendChunks :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Array a) -> m ()
151+ [A] writeAppendArray :: FilePath -> Array a -> IO ()
152+ [A] writeAppend :: (MonadIO m, MonadCatch m) => FilePath -> Stream m Word8 -> m ()
153+ [R] appendWith :: (MonadIO m, MonadCatch m) => Int -> FilePath -> Stream m Word8 -> m ()
154+ [R] appendChunks :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Array a) -> m ()
155+ [R] appendArray :: FilePath -> Array a -> IO ()
156+ [R] append :: (MonadIO m, MonadCatch m) => FilePath -> Stream m Word8 -> m ()
157+[C] Streamly.Internal.FileSystem.Dir
158+ [C] reader
159+ [O] reader :: MonadIO m => Unfold m FilePath FilePath
160+ [N] reader :: (MonadIO m, MonadCatch m) => Unfold m FilePath FilePath
161+ [C] readFiles
162+ [O] readFiles :: MonadIO m => FilePath -> Stream m FilePath
163+ [N] readFiles :: (MonadIO m, MonadCatch m) => FilePath -> Stream m FilePath
164+ [C] readEitherPaths
165+ [O] readEitherPaths :: MonadIO m => FilePath -> Stream m (Either FilePath FilePath)
166+ [N] readEitherPaths :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Either FilePath FilePath)
167+ [C] readEither
168+ [O] readEither :: MonadIO m => FilePath -> Stream m (Either FilePath FilePath)
169+ [N] readEither :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Either FilePath FilePath)
170+ [C] readDirs
171+ [O] readDirs :: MonadIO m => FilePath -> Stream m FilePath
172+ [N] readDirs :: (MonadIO m, MonadCatch m) => FilePath -> Stream m FilePath
173+ [C] read
174+ [O] read :: MonadIO m => FilePath -> Stream m FilePath
175+ [N] read :: (MonadIO m, MonadCatch m) => FilePath -> Stream m FilePath
176+ [C] fileReader
177+ [O] fileReader :: MonadIO m => Unfold m FilePath FilePath
178+ [N] fileReader :: (MonadIO m, MonadCatch m) => Unfold m FilePath FilePath
179+ [C] eitherReaderPaths
180+ [O] eitherReaderPaths :: MonadIO m => Unfold m FilePath (Either FilePath FilePath)
181+ [N] eitherReaderPaths :: (MonadIO m, MonadCatch m) => Unfold m FilePath (Either FilePath FilePath)
182+ [C] eitherReader
183+ [O] eitherReader :: MonadIO m => Unfold m FilePath (Either FilePath FilePath)
184+ [N] eitherReader :: (MonadIO m, MonadCatch m) => Unfold m FilePath (Either FilePath FilePath)
185+ [C] dirReader
186+ [O] dirReader :: MonadIO m => Unfold m FilePath FilePath
187+ [N] dirReader :: (MonadIO m, MonadCatch m) => Unfold m FilePath FilePath
188+[R] Streamly.Internal.Data.Unfold.Type
189+[R] Streamly.Internal.Data.Unfold.Enumeration
190+[C] Streamly.Internal.Data.Unfold
191+ [C] Unfold
192+ [A] Unfold :: (s -> m (Step s b)) -> (a -> m s) -> Unfold m a b
193+ [A] takeWhileMWithInput :: Monad m => (a -> b -> m Bool) -> Unfold m a b -> Unfold m a b
194+ [A] manyInterleave :: Monad m => Unfold m a b -> Unfold m c a -> Unfold m c b
195+ [A] enumerateFromStepIntegral :: (Monad m, Integral a) => Unfold m (a, a) a
196+ [A] crossApplySnd :: Unfold m a b -> Unfold m a c -> Unfold m a c
197+ [A] crossApplyFst :: Unfold m a b -> Unfold m a c -> Unfold m a b
198+ [A] concatMap :: Monad m => (b -> Unfold m a c) -> Unfold m a b -> Unfold m a c
199+[R] Streamly.Internal.Data.Unboxed
200+[C] Streamly.Internal.Data.Time.Units
201+ [R] Streamly.Internal.Data.Unboxed.Unbox
202+ [A] Streamly.Internal.Data.Unbox.Unbox
203+ [A] instance Streamly.Internal.Data.Unbox.Unbox Streamly.Internal.Data.Time.Units.NanoSecond64
204+ [A] instance Streamly.Internal.Data.Unbox.Unbox Streamly.Internal.Data.Time.Units.MilliSecond64
205+ [A] instance Streamly.Internal.Data.Unbox.Unbox Streamly.Internal.Data.Time.Units.MicroSecond64
206+[R] Streamly.Internal.Data.Time.Clock.Type
207+[A] Streamly.Internal.Data.StreamK
208+ [A] CrossStreamK
209+ [A] (FixityR,6)
210+ [A] (FixityR,6)
211+ [A] (FixityR,6)
212+ [A] (FixityR,5)
213+ [A] (FixityR,5)
214+ [A] (FixityR,6)
215+ [A] (FixityR,5)
216+ [A] StreamK
217+ [A] MkStream :: (forall r. State StreamK m a -> (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> m r) -> StreamK m a
218+ [A] zipWithM :: Monad m => (a -> b -> m c) -> StreamK m a -> StreamK m b -> StreamK m c
219+ [A] zipWith :: Monad m => (a -> b -> c) -> StreamK m a -> StreamK m b -> StreamK m c
220+ [A] unfoldrMWith :: Monad m => (m a -> StreamK m a -> StreamK m a) -> (b -> m (Maybe (a, b))) -> b -> StreamK m a
221+ [A] unfoldrM :: Monad m => (b -> m (Maybe (a, b))) -> b -> StreamK m a
222+ [A] unfoldr :: (b -> Maybe (a, b)) -> b -> StreamK m a
223+ [A] uncons :: Applicative m => StreamK m a -> m (Maybe (a, StreamK m a))
224+ [A] unShare :: StreamK m a -> StreamK m a
225+ [A] unCross :: CrossStreamK m a -> StreamK m a
226+ [A] toStream :: Applicative m => StreamK m a -> Stream m a
227+ [A] toList :: Monad m => StreamK m a -> m [a]
228+ [A] the :: (Eq a, Monad m) => StreamK m a -> m (Maybe a)
229+ [A] takeWhile :: (a -> Bool) -> StreamK m a -> StreamK m a
230+ [A] take :: Int -> StreamK m a -> StreamK m a
231+ [A] tail :: Applicative m => StreamK m a -> m (Maybe (StreamK m a))
232+ [A] sortBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> StreamK m a
233+ [A] sequence :: Monad m => StreamK m (m a) -> StreamK m a
234+ [A] scanlx' :: (x -> a -> x) -> x -> (x -> b) -> StreamK m a -> StreamK m b
235+ [A] scanl' :: (b -> a -> b) -> b -> StreamK m a -> StreamK m b
236+ [A] reverse :: StreamK m a -> StreamK m a
237+ [A] replicateMWith :: (m a -> StreamK m a -> StreamK m a) -> Int -> m a -> StreamK m a
238+ [A] replicateM :: Monad m => Int -> m a -> StreamK m a
239+ [A] replicate :: Int -> a -> StreamK m a
240+ [A] repeatMWith :: (m a -> t m a -> t m a) -> m a -> t m a
241+ [A] repeatM :: Monad m => m a -> StreamK m a
242+ [A] repeat :: a -> StreamK m a
243+ [A] parseDBreak :: Monad m => Parser a m b -> StreamK m a -> m (Either ParseError b, StreamK m a)
244+ [A] parseD :: Monad m => Parser a m b -> StreamK m a -> m (Either ParseError b)
245+ [A] parseChunksGeneric :: Monad m => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b)
246+ [A] parseChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b)
247+ [A] parseBreakChunksGeneric :: forall m a b. Monad m => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
248+ [A] parseBreakChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
249+ [A] parseBreak :: forall m a b. Monad m => ParserK a m b -> StreamK m a -> m (Either ParseError b, StreamK m a)
250+ [A] parse :: Monad m => ParserK a m b -> StreamK m a -> m (Either ParseError b)
251+ [A] null :: Monad m => StreamK m a -> m Bool
252+ [A] notElem :: (Monad m, Eq a) => a -> StreamK m a -> m Bool
253+ [A] nilM :: Applicative m => m b -> StreamK m a
254+ [A] nil :: StreamK m a
255+ [A] mkStream :: (forall r. State StreamK m a -> (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> m r) -> StreamK m a
256+ [A] mkCross :: StreamK m a -> CrossStreamK m a
257+ [A] minimumBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> m (Maybe a)
258+ [A] minimum :: (Monad m, Ord a) => StreamK m a -> m (Maybe a)
259+ [A] mfix :: Monad m => (m a -> StreamK m a) -> StreamK m a
260+ [A] mergeMapWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b
261+ [A] mergeIterateWith :: (StreamK m a -> StreamK m a -> StreamK m a) -> (a -> StreamK m a) -> StreamK m a -> StreamK m a
262+ [A] mergeByM :: Monad m => (a -> a -> m Ordering) -> StreamK m a -> StreamK m a -> StreamK m a
263+ [A] mergeBy :: (a -> a -> Ordering) -> StreamK m a -> StreamK m a -> StreamK m a
264+ [A] maximumBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> m (Maybe a)
265+ [A] maximum :: (Monad m, Ord a) => StreamK m a -> m (Maybe a)
266+ [A] mapMaybe :: (a -> Maybe b) -> StreamK m a -> StreamK m b
267+ [A] mapM_ :: Monad m => (a -> m b) -> StreamK m a -> m ()
268+ [A] mapMWith :: (m b -> StreamK m b -> StreamK m b) -> (a -> m b) -> StreamK m a -> StreamK m b
269+ [A] mapMSerial :: Monad m => (a -> m b) -> StreamK m a -> StreamK m b
270+ [A] mapM :: Monad m => (a -> m b) -> StreamK m a -> StreamK m b
271+ [A] map :: (a -> b) -> StreamK m a -> StreamK m b
272+ [A] lookup :: (Monad m, Eq a) => a -> StreamK m (a, b) -> m (Maybe b)
273+ [A] liftInner :: (Monad m, MonadTrans t, Monad (t m)) => StreamK m a -> StreamK (t m) a
274+ [A] last :: Monad m => StreamK m a -> m (Maybe a)
275+ [A] iterateMWith :: Monad m => (m a -> StreamK m a -> StreamK m a) -> (a -> m a) -> m a -> StreamK m a
276+ [A] iterateM :: Monad m => (a -> m a) -> m a -> StreamK m a
277+ [A] iterate :: (a -> a) -> a -> StreamK m a
278+ [A] intersperseM :: Monad m => m a -> StreamK m a -> StreamK m a
279+ [A] intersperse :: Monad m => a -> StreamK m a -> StreamK m a
280+ [A] interleaveMin :: StreamK m a -> StreamK m a -> StreamK m a
281+ [A] interleaveFst :: StreamK m a -> StreamK m a -> StreamK m a
282+ [A] interleave :: StreamK m a -> StreamK m a -> StreamK m a
283+ [A] insertBy :: (a -> a -> Ordering) -> a -> StreamK m a -> StreamK m a
284+ [A] init :: Applicative m => StreamK m a -> m (Maybe (StreamK m a))
285+ [A] hoist :: (Monad m, Monad n) => (forall x. m x -> n x) -> StreamK m a -> StreamK n a
286+ [A] head :: Monad m => StreamK m a -> m (Maybe a)
287+ [A] handle :: (MonadCatch m, Exception e) => (e -> m (StreamK m a)) -> StreamK m a -> StreamK m a
288+ [A] fromYieldK :: YieldK m a -> StreamK m a
289+ [A] fromStream :: Monad m => Stream m a -> StreamK m a
290+ [A] fromStopK :: StopK m -> StreamK m a
291+ [A] fromPure :: a -> StreamK m a
292+ [A] fromList :: [a] -> StreamK m a
293+ [A] fromIndicesMWith :: (m a -> StreamK m a -> StreamK m a) -> (Int -> m a) -> StreamK m a
294+ [A] fromIndicesM :: Monad m => (Int -> m a) -> StreamK m a
295+ [A] fromIndices :: (Int -> a) -> StreamK m a
296+ [A] fromFoldableM :: (Foldable f, Monad m) => f (m a) -> StreamK m a
297+ [A] fromFoldable :: Foldable f => f a -> StreamK m a
298+ [A] fromEffect :: Monad m => m a -> StreamK m a
299+ [A] foldrT :: (Monad m, Monad (s m), MonadTrans s) => (a -> s m b -> s m b) -> s m b -> StreamK m a -> s m b
300+ [A] foldrSShared :: (a -> StreamK m b -> StreamK m b) -> StreamK m b -> StreamK m a -> StreamK m b
301+ [A] foldrSM :: Monad m => (m a -> StreamK m b -> StreamK m b) -> StreamK m b -> StreamK m a -> StreamK m b
302+ [A] foldrS :: (a -> StreamK m b -> StreamK m b) -> StreamK m b -> StreamK m a -> StreamK m b
303+ [A] foldrM :: (a -> m b -> m b) -> m b -> StreamK m a -> m b
304+ [A] foldr1 :: Monad m => (a -> a -> a) -> StreamK m a -> m (Maybe a)
305+ [A] foldr :: Monad m => (a -> b -> b) -> b -> StreamK m a -> m b
306+ [A] foldlx' :: forall m a b x. Monad m => (x -> a -> x) -> x -> (x -> b) -> StreamK m a -> m b
307+ [A] foldlT :: (Monad m, Monad (s m), MonadTrans s) => (s m b -> a -> s m b) -> s m b -> StreamK m a -> s m b
308+ [A] foldlS :: (StreamK m b -> a -> StreamK m b) -> StreamK m b -> StreamK m a -> StreamK m b
309+ [A] foldlMx' :: Monad m => (x -> a -> m x) -> m x -> (x -> m b) -> StreamK m a -> m b
310+ [A] foldlM' :: Monad m => (b -> a -> m b) -> m b -> StreamK m a -> m b
311+ [A] foldl' :: Monad m => (b -> a -> b) -> b -> StreamK m a -> m b
312+ [A] foldStreamShared :: State StreamK m a -> (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> StreamK m a -> m r
313+ [A] foldStream :: State StreamK m a -> (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> StreamK m a -> m r
314+ [A] foldEither :: Monad m => Fold m a b -> StreamK m a -> m (Either (Fold m a b) (b, StreamK m a))
315+ [A] foldConcat :: Monad m => Producer m a b -> Fold m b c -> StreamK m a -> m (c, StreamK m a)
316+ [A] foldBreak :: Monad m => Fold m a b -> StreamK m a -> m (b, StreamK m a)
317+ [A] fold :: Monad m => Fold m a b -> StreamK m a -> m b
318+ [A] findM :: Monad m => (a -> m Bool) -> StreamK m a -> m (Maybe a)
319+ [A] findIndices :: (a -> Bool) -> StreamK m a -> StreamK m Int
320+ [A] find :: Monad m => (a -> Bool) -> StreamK m a -> m (Maybe a)
321+ [A] filter :: (a -> Bool) -> StreamK m a -> StreamK m a
322+ [A] evalStateT :: Monad m => m s -> StreamK (StateT s m) a -> StreamK m a
323+ [A] elem :: (Monad m, Eq a) => a -> StreamK m a -> m Bool
324+ [A] dropWhile :: (a -> Bool) -> StreamK m a -> StreamK m a
325+ [A] drop :: Int -> StreamK m a -> StreamK m a
326+ [A] drain :: Monad m => StreamK m a -> m ()
327+ [A] deleteBy :: (a -> a -> Bool) -> a -> StreamK m a -> StreamK m a
328+ [A] crossWith :: Monad m => (a -> b -> c) -> StreamK m a -> StreamK m b -> StreamK m c
329+ [A] crossApplyWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> StreamK m (a -> b) -> StreamK m a -> StreamK m b
330+ [A] crossApplySnd :: StreamK m a -> StreamK m b -> StreamK m b
331+ [A] crossApplyFst :: StreamK m a -> StreamK m b -> StreamK m a
332+ [A] crossApply :: StreamK m (a -> b) -> StreamK m a -> StreamK m b
333+ [A] cross :: Monad m => StreamK m a -> StreamK m b -> StreamK m (a, b)
334+ [A] consMBy :: Monad m => (StreamK m a -> StreamK m a -> StreamK m a) -> m a -> StreamK m a -> StreamK m a
335+ [A] consM :: Monad m => m a -> StreamK m a -> StreamK m a
336+ [A] consK :: YieldK m a -> StreamK m a -> StreamK m a
337+ [A] cons :: a -> StreamK m a -> StreamK m a
338+ [A] conjoin :: Monad m => StreamK m a -> StreamK m a -> StreamK m a
339+ [A] concatMapWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b
340+ [A] concatMapEffect :: Monad m => (b -> StreamK m a) -> m b -> StreamK m a
341+ [A] concatMap :: (a -> StreamK m b) -> StreamK m a -> StreamK m b
342+ [A] concatIterateWith :: (StreamK m a -> StreamK m a -> StreamK m a) -> (a -> StreamK m a) -> StreamK m a -> StreamK m a
343+ [A] concatIterateScanWith :: Monad m => (StreamK m a -> StreamK m a -> StreamK m a) -> (b -> a -> m (b, StreamK m a)) -> m b -> StreamK m a -> StreamK m a
344+ [A] concatIterateLeftsWith :: b ~ Either a c => (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m b -> StreamK m b
345+ [A] concatEffect :: Monad m => m (StreamK m a) -> StreamK m a
346+ [A] buildSM :: Monad m => ((m a -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a) -> StreamK m a
347+ [A] buildS :: ((a -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a) -> StreamK m a
348+ [A] buildM :: Monad m => (forall r. (a -> StreamK m a -> m r) -> (a -> m r) -> m r -> m r) -> StreamK m a
349+ [A] build :: forall m a. (forall b. (a -> b -> b) -> b -> b) -> StreamK m a
350+ [A] bracketIO :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> StreamK m a) -> StreamK m a
351+ [A] bindWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> StreamK m a -> (a -> StreamK m b) -> StreamK m b
352+ [A] before :: Monad m => m b -> StreamK m a -> StreamK m a
353+ [A] augmentSM :: Monad m => ((m a -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a
354+ [A] augmentS :: ((a -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a) -> StreamK m a -> StreamK m a
355+ [A] append :: StreamK m a -> StreamK m a -> StreamK m a
356+ [A] any :: Monad m => (a -> Bool) -> StreamK m a -> m Bool
357+ [A] all :: Monad m => (a -> Bool) -> StreamK m a -> m Bool
358+ [A] (.:) :: a -> StreamK m a -> StreamK m a
359+ [A] (!!) :: Monad m => StreamK m a -> Int -> m (Maybe a)
360+[R] Streamly.Internal.Data.Stream.StreamK.Type
361+[R] Streamly.Internal.Data.Stream.StreamK.Transformer
362+[R] Streamly.Internal.Data.Stream.StreamK
363+[R] Streamly.Internal.Data.Stream.StreamD.Type
364+[R] Streamly.Internal.Data.Stream.StreamD.Transformer
365+[R] Streamly.Internal.Data.Stream.StreamD.Transform
366+[R] Streamly.Internal.Data.Stream.StreamD.Top
367+[R] Streamly.Internal.Data.Stream.StreamD.Step
368+[R] Streamly.Internal.Data.Stream.StreamD.Nesting
369+[R] Streamly.Internal.Data.Stream.StreamD.Lift
370+[R] Streamly.Internal.Data.Stream.StreamD.Generate
371+[R] Streamly.Internal.Data.Stream.StreamD.Exception
372+[R] Streamly.Internal.Data.Stream.StreamD.Eliminate
373+[R] Streamly.Internal.Data.Stream.StreamD.Container
374+[D] Streamly.Internal.Data.Stream.StreamD
375+[R] Streamly.Internal.Data.Stream.Common
376+[R] Streamly.Internal.Data.Stream.Chunked
377+[C] Streamly.Internal.Data.Stream
378+ [A] class Enum a => Enumerable a
379+ [A] Stream
380+ [A] UnStream :: (State StreamK m a -> s -> m (Step s a)) -> s -> Stream m a
381+ [A] Step
382+ [A] Yield :: a -> s -> Step s a
383+ [A] Stop :: Step s a
384+ [A] Skip :: s -> Step s a
385+ [A] InterleaveState
386+ [A] InterleaveSecondOnly :: s2 -> InterleaveState s1 s2
387+ [A] InterleaveSecond :: s1 -> s2 -> InterleaveState s1 s2
388+ [A] InterleaveFirstOnly :: s1 -> InterleaveState s1 s2
389+ [A] InterleaveFirst :: s1 -> s2 -> InterleaveState s1 s2
390+ [A] FoldManyPost
391+ [A] FoldManyPostYield :: b -> FoldManyPost s fs b a -> FoldManyPost s fs b a
392+ [A] FoldManyPostStart :: s -> FoldManyPost s fs b a
393+ [A] FoldManyPostLoop :: s -> fs -> FoldManyPost s fs b a
394+ [A] FoldManyPostDone :: FoldManyPost s fs b a
395+ [A] FoldMany
396+ [A] FoldManyYield :: b -> FoldMany s fs b a -> FoldMany s fs b a
397+ [A] FoldManyStart :: s -> FoldMany s fs b a
398+ [A] FoldManyLoop :: s -> fs -> FoldMany s fs b a
399+ [A] FoldManyFirst :: fs -> s -> FoldMany s fs b a
400+ [A] FoldManyDone :: FoldMany s fs b a
401+ [A] CrossStream
402+ [A] ConcatUnfoldInterleaveState
403+ [A] ConcatUnfoldInterleaveOuter :: o -> [i] -> ConcatUnfoldInterleaveState o i
404+ [A] ConcatUnfoldInterleaveInnerR :: [i] -> [i] -> ConcatUnfoldInterleaveState o i
405+ [A] ConcatUnfoldInterleaveInnerL :: [i] -> [i] -> ConcatUnfoldInterleaveState o i
406+ [A] ConcatUnfoldInterleaveInner :: o -> [i] -> ConcatUnfoldInterleaveState o i
407+ [A] ConcatMapUState
408+ [A] ConcatMapUOuter :: o -> ConcatMapUState o i
409+ [A] ConcatMapUInner :: o -> i -> ConcatMapUState o i
410+ [A] AppendState
411+ [A] AppendSecond :: s2 -> AppendState s1 s2
412+ [A] AppendFirst :: s1 -> AppendState s1 s2
413+ [A] pattern Stream :: (State StreamK m a -> s -> m (Step s a)) -> s -> Stream m a
414+ [A] zipWithM :: Monad m => (a -> b -> m c) -> Stream m a -> Stream m b -> Stream m c
415+ [A] zipWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
416+ [A] wordsBy :: Monad m => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
417+ [A] with :: Monad m => (Stream m a -> Stream m (s, a)) -> (((s, a) -> b) -> Stream m (s, a) -> Stream m (s, a)) -> ((s, a) -> b) -> Stream m a -> Stream m a
418+ [A] usingStateT :: Monad m => m s -> (Stream (StateT s m) a -> Stream (StateT s m) a) -> Stream m a -> Stream m a
419+ [A] usingReaderT :: Monad m => m r -> (Stream (ReaderT r m) a -> Stream (ReaderT r m) a) -> Stream m a -> Stream m a
420+ [A] uniqBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Stream m a
421+ [A] uniq :: (Eq a, Monad m) => Stream m a -> Stream m a
422+ [A] unionWithStreamGenericBy :: MonadIO m => (a -> a -> Bool) -> Stream m a -> Stream m a -> Stream m a
423+ [A] unionWithStreamAscBy :: (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
424+ [A] unfoldrM :: Monad m => (s -> m (Maybe (a, s))) -> s -> Stream m a
425+ [A] unfoldr :: Monad m => (s -> Maybe (a, s)) -> s -> Stream m a
426+ [A] unfoldRoundRobin :: Monad m => Unfold m a b -> Stream m a -> Stream m b
427+ [A] unfoldMany :: Monad m => Unfold m a b -> Stream m a -> Stream m b
428+ [A] unfoldIterateDfs :: Monad m => Unfold m a a -> Stream m a -> Stream m a
429+ [A] unfoldIterateBfsRev :: Monad m => Unfold m a a -> Stream m a -> Stream m a
430+ [A] unfoldIterateBfs :: Monad m => Unfold m a a -> Stream m a -> Stream m a
431+ [A] unfoldInterleave :: Monad m => Unfold m a b -> Stream m a -> Stream m b
432+ [A] unfold :: Applicative m => Unfold m a b -> a -> Stream m b
433+ [A] uncons :: Monad m => Stream m a -> m (Maybe (a, Stream m a))
434+ [A] unCross :: CrossStream m a -> Stream m a
435+ [A] transform :: Monad m => Pipe m a b -> Stream m a -> Stream m b
436+ [A] trace_ :: Monad m => m b -> Stream m a -> Stream m a
437+ [A] trace :: Monad m => (a -> m b) -> Stream m a -> Stream m a
438+ [A] toStreamK :: Monad m => Stream m a -> StreamK m a
439+ [A] toListRev :: Monad m => Stream m a -> m [a]
440+ [A] toList :: Monad m => Stream m a -> m [a]
441+ [A] timestamped :: MonadIO m => Stream m a -> Stream m (AbsTime, a)
442+ [A] timestampWith :: MonadIO m => Double -> Stream m a -> Stream m (AbsTime, a)
443+ [A] timesWith :: MonadIO m => Double -> Stream m (AbsTime, RelTime64)
444+ [A] times :: MonadIO m => Stream m (AbsTime, RelTime64)
445+ [A] timeout :: AbsTime -> t m ()
446+ [A] timeIndexed :: MonadIO m => Stream m a -> Stream m (RelTime64, a)
447+ [A] timeIndexWith :: MonadIO m => Double -> Stream m a -> Stream m (RelTime64, a)
448+ [A] the :: (Eq a, Monad m) => Stream m a -> m (Maybe a)
449+ [A] tapOffsetEvery :: Monad m => Int -> Int -> Fold m a b -> Stream m a -> Stream m a
450+ [A] tap :: Monad m => Fold m a b -> Stream m a -> Stream m a
451+ [A] takeWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
452+ [A] takeWhileLast :: (a -> Bool) -> Stream m a -> Stream m a
453+ [A] takeWhileAround :: (a -> Bool) -> Stream m a -> Stream m a
454+ [A] takeWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
455+ [A] takeEndByM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
456+ [A] takeEndBy :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
457+ [A] take :: Applicative m => Int -> Stream m a -> Stream m a
458+ [A] tail :: Monad m => Stream m a -> m (Maybe (Stream m a))
459+ [A] stripSuffixUnbox :: (MonadIO m, Eq a, Unbox a) => Stream m a -> Stream m a -> m (Maybe (Stream m a))
460+ [A] stripSuffix :: (Monad m, Eq a) => Stream m a -> Stream m a -> m (Maybe (Stream m a))
461+ [A] stripPrefix :: (Monad m, Eq a) => Stream m a -> Stream m a -> m (Maybe (Stream m a))
462+ [A] strideFromThen :: Monad m => Int -> Int -> Stream m a -> Stream m a
463+ [A] splitOnSuffixSeqAny :: [Array a] -> Fold m a b -> Stream m a -> Stream m b
464+ [A] splitOnSuffixSeq :: forall m a b. (MonadIO m, Storable a, Unbox a, Enum a, Eq a) => Bool -> Array a -> Fold m a b -> Stream m a -> Stream m b
465+ [A] splitOnSeq :: forall m a b. (MonadIO m, Storable a, Unbox a, Enum a, Eq a) => Array a -> Fold m a b -> Stream m a -> Stream m b
466+ [A] splitOnPrefix :: (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
467+ [A] splitOnAny :: [Array a] -> Fold m a b -> Stream m a -> Stream m b
468+ [A] splitOn :: Monad m => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
469+ [A] splitInnerBySuffix :: (Monad m, Eq (f a), Monoid (f a)) => (f a -> m (f a, Maybe (f a))) -> (f a -> f a -> m (f a)) -> Stream m (f a) -> Stream m (f a)
470+ [A] splitInnerBy :: Monad m => (f a -> m (f a, Maybe (f a))) -> (f a -> f a -> m (f a)) -> Stream m (f a) -> Stream m (f a)
471+ [A] slicesBy :: Monad m => (a -> Bool) -> Stream m a -> Stream m (Int, Int)
472+ [A] sliceOnSuffix :: Monad m => (a -> Bool) -> Stream m a -> Stream m (Int, Int)
473+ [A] sequence :: Monad m => Stream m (m a) -> Stream m a
474+ [A] scanlx' :: Monad m => (x -> a -> x) -> x -> (x -> b) -> Stream m a -> Stream m b
475+ [A] scanlMx' :: Monad m => (x -> a -> m x) -> m x -> (x -> m b) -> Stream m a -> Stream m b
476+ [A] scanlMAfter' :: Monad m => (b -> a -> m b) -> m b -> (b -> m b) -> Stream m a -> Stream m b
477+ [A] scanlM' :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
478+ [A] scanlM :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
479+ [A] scanl1M' :: Monad m => (a -> a -> m a) -> Stream m a -> Stream m a
480+ [A] scanl1M :: Monad m => (a -> a -> m a) -> Stream m a -> Stream m a
481+ [A] scanl1' :: Monad m => (a -> a -> a) -> Stream m a -> Stream m a
482+ [A] scanl1 :: Monad m => (a -> a -> a) -> Stream m a -> Stream m a
483+ [A] scanl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> Stream m b
484+ [A] scanl :: Monad m => (b -> a -> b) -> b -> Stream m a -> Stream m b
485+ [A] scanMaybe :: Monad m => Fold m a (Maybe b) -> Stream m a -> Stream m b
486+ [A] scanMany :: Monad m => Fold m a b -> Stream m a -> Stream m b
487+ [A] scan :: Monad m => Fold m a b -> Stream m a -> Stream m b
488+ [A] runStateT :: Monad m => m s -> Stream (StateT s m) a -> Stream m (s, a)
489+ [A] runReaderT :: Monad m => m s -> Stream (ReaderT s m) a -> Stream m a
490+ [A] runInnerWithState :: Monad m => (forall b. s -> t m b -> m (b, s)) -> m s -> Stream (t m) a -> Stream m (s, a)
491+ [A] runInnerWith :: Monad m => (forall b. t m b -> m b) -> Stream (t m) a -> Stream m a
492+ [A] roundRobin :: Monad m => Stream m a -> Stream m a -> Stream m a
493+ [A] rollingMapM :: Monad m => (Maybe a -> a -> m b) -> Stream m a -> Stream m b
494+ [A] rollingMap2 :: Monad m => (a -> a -> b) -> Stream m a -> Stream m b
495+ [A] rollingMap :: Monad m => (Maybe a -> a -> b) -> Stream m a -> Stream m b
496+ [A] reverseUnbox :: (MonadIO m, Unbox a) => Stream m a -> Stream m a
497+ [A] reverse :: Monad m => Stream m a -> Stream m a
498+ [A] replicateM :: Monad m => Int -> m a -> Stream m a
499+ [A] replicate :: Monad m => Int -> a -> Stream m a
500+ [A] repeated :: Stream m a -> Stream m a
501+ [A] repeatM :: Monad m => m a -> Stream m a
502+ [A] repeat :: Monad m => a -> Stream m a
503+ [A] relTimesWith :: MonadIO m => Double -> Stream m RelTime64
504+ [A] relTimes :: MonadIO m => Stream m RelTime64
505+ [A] refoldMany :: Monad m => Refold m x a b -> m x -> Stream m a -> Stream m b
506+ [A] refoldIterateM :: Monad m => Refold m b a b -> m b -> Stream m a -> Stream m b
507+ [A] reduceIterateBfs :: Monad m => (a -> a -> m a) -> Stream m a -> m (Maybe a)
508+ [A] reassembleBy :: Fold m a b -> (a -> a -> Int) -> Stream m a -> Stream m b
509+ [A] prune :: (a -> Bool) -> Stream m a -> Stream m a
510+ [A] prescanlM' :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
511+ [A] prescanl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> Stream m b
512+ [A] postscanlx' :: Monad m => (x -> a -> x) -> x -> (x -> b) -> Stream m a -> Stream m b
513+ [A] postscanlMx' :: Monad m => (x -> a -> m x) -> m x -> (x -> m b) -> Stream m a -> Stream m b
514+ [A] postscanlMAfter' :: Monad m => (b -> a -> m b) -> m b -> (b -> m b) -> Stream m a -> Stream m b
515+ [A] postscanlM' :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
516+ [A] postscanlM :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> Stream m b
517+ [A] postscanl' :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a
518+ [A] postscanl :: Monad m => (a -> b -> a) -> a -> Stream m b -> Stream m a
519+ [A] postscan :: Monad m => Fold m a b -> Stream m a -> Stream m b
520+ [A] parseSequence :: Stream m (Parser a m b) -> Stream m a -> Stream m b
521+ [A] parseManyTill :: Parser a m b -> Parser a m x -> Stream m a -> Stream m b
522+ [A] parseManyD :: Monad m => Parser a m b -> Stream m a -> Stream m (Either ParseError b)
523+ [A] parseMany :: Monad m => Parser a m b -> Stream m a -> Stream m (Either ParseError b)
524+ [A] parseIterateD :: Monad m => (b -> Parser a m b) -> b -> Stream m a -> Stream m (Either ParseError b)
525+ [A] parseIterate :: Monad m => (b -> Parser a m b) -> b -> Stream m a -> Stream m (Either ParseError b)
526+ [A] parseD :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b)
527+ [A] parseBreakD :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b, Stream m a)
528+ [A] parseBreak :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b, Stream m a)
529+ [A] parse :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b)
530+ [A] onException :: MonadCatch m => m b -> Stream m a -> Stream m a
531+ [A] null :: Monad m => Stream m a -> m Bool
532+ [A] nub :: (Monad m, Ord a) => Stream m a -> Stream m a
533+ [A] notElem :: (Monad m, Eq a) => a -> Stream m a -> m Bool
534+ [A] nilM :: Applicative m => m b -> Stream m a
535+ [A] nil :: Applicative m => Stream m a
536+ [A] morphInner :: Monad n => (forall x. m x -> n x) -> Stream m a -> Stream n a
537+ [A] mkCross :: Stream m a -> CrossStream m a
538+ [A] minimumBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> m (Maybe a)
539+ [A] minimum :: (Monad m, Ord a) => Stream m a -> m (Maybe a)
540+ [A] mergeMinBy :: (a -> a -> m Ordering) -> Stream m a -> Stream m a -> Stream m a
541+ [A] mergeFstBy :: (a -> a -> m Ordering) -> Stream m a -> Stream m a -> Stream m a
542+ [A] mergeByM :: Monad m => (a -> a -> m Ordering) -> Stream m a -> Stream m a -> Stream m a
543+ [A] mergeBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
544+ [A] maximumBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> m (Maybe a)
545+ [A] maximum :: (Monad m, Ord a) => Stream m a -> m (Maybe a)
546+ [A] mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m b
547+ [A] mapMaybe :: Monad m => (a -> Maybe b) -> Stream m a -> Stream m b
548+ [A] mapM_ :: Monad m => (a -> m b) -> Stream m a -> m ()
549+ [A] mapM :: Monad m => (a -> m b) -> Stream m a -> Stream m b
550+ [A] map :: Monad m => (a -> b) -> Stream m a -> Stream m b
551+ [A] lookup :: (Monad m, Eq a) => a -> Stream m (a, b) -> m (Maybe b)
552+ [A] liftInnerWith :: Monad (t m) => (forall b. m b -> t m b) -> Stream m a -> Stream (t m) a
553+ [A] liftInner :: (Monad m, MonadTrans t, Monad (t m)) => Stream m a -> Stream (t m) a
554+ [A] last :: Monad m => Stream m a -> m (Maybe a)
555+ [A] joinOuterGeneric :: MonadIO m => (a -> b -> Bool) -> Stream m a -> Stream m b -> Stream m (Maybe a, Maybe b)
556+ [A] joinOuterAscBy :: (a -> b -> Ordering) -> Stream m a -> Stream m b -> Stream m (Maybe a, Maybe b)
557+ [A] joinOuter :: (Ord k, MonadIO m) => Stream m (k, a) -> Stream m (k, b) -> Stream m (k, Maybe a, Maybe b)
558+ [A] joinLeftGeneric :: Monad m => (a -> b -> Bool) -> Stream m a -> Stream m b -> Stream m (a, Maybe b)
559+ [A] joinLeftAscBy :: (a -> b -> Ordering) -> Stream m a -> Stream m b -> Stream m (a, Maybe b)
560+ [A] joinLeft :: (Ord k, Monad m) => Stream m (k, a) -> Stream m (k, b) -> Stream m (k, a, Maybe b)
561+ [A] joinInnerGeneric :: Monad m => (a -> b -> Bool) -> Stream m a -> Stream m b -> Stream m (a, b)
562+ [A] joinInnerAscBy :: (a -> b -> Ordering) -> Stream m a -> Stream m b -> Stream m (a, b)
563+ [A] joinInner :: (Monad m, Ord k) => Stream m (k, a) -> Stream m (k, b) -> Stream m (k, a, b)
564+ [A] iterateM :: Monad m => (a -> m a) -> m a -> Stream m a
565+ [A] iterate :: Monad m => (a -> a) -> a -> Stream m a
566+ [A] isSuffixOfUnbox :: (MonadIO m, Eq a, Unbox a) => Stream m a -> Stream m a -> m Bool
567+ [A] isSuffixOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
568+ [A] isSubsequenceOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
569+ [A] isPrefixOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
570+ [A] isInfixOf :: (MonadIO m, Eq a, Enum a, Storable a, Unbox a) => Stream m a -> Stream m a -> m Bool
571+ [A] intersperseM_ :: Monad m => m b -> Stream m a -> Stream m a
572+ [A] intersperseMWith :: Int -> m a -> Stream m a -> Stream m a
573+ [A] intersperseMSuffix_ :: Monad m => m b -> Stream m a -> Stream m a
574+ [A] intersperseMSuffixWith :: forall m a. Monad m => Int -> m a -> Stream m a -> Stream m a
575+ [A] intersperseMSuffix :: forall m a. Monad m => m a -> Stream m a -> Stream m a
576+ [A] intersperseMPrefix_ :: Monad m => m b -> Stream m a -> Stream m a
577+ [A] intersperseM :: Monad m => m a -> Stream m a -> Stream m a
578+ [A] intersperse :: Monad m => a -> Stream m a -> Stream m a
579+ [A] intersectBySorted :: Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
580+ [A] interposeSuffixM :: Monad m => m c -> Unfold m b c -> Stream m b -> Stream m c
581+ [A] interposeSuffix :: Monad m => c -> Unfold m b c -> Stream m b -> Stream m c
582+ [A] interposeM :: Monad m => m c -> Unfold m b c -> Stream m b -> Stream m c
583+ [A] interpose :: Monad m => c -> Unfold m b c -> Stream m b -> Stream m c
584+ [A] interleaveMin :: Monad m => Stream m a -> Stream m a -> Stream m a
585+ [A] interleaveFstSuffix :: Monad m => Stream m a -> Stream m a -> Stream m a
586+ [A] interleaveFst :: Monad m => Stream m a -> Stream m a -> Stream m a
587+ [A] interleave :: Monad m => Stream m a -> Stream m a -> Stream m a
588+ [A] intercalateSuffix :: Monad m => Unfold m b c -> b -> Stream m b -> Stream m c
589+ [A] intercalate :: Monad m => Unfold m b c -> b -> Stream m b -> Stream m c
590+ [A] insertBy :: Monad m => (a -> a -> Ordering) -> a -> Stream m a -> Stream m a
591+ [A] indexedR :: Monad m => Int -> Stream m a -> Stream m (Int, a)
592+ [A] indexed :: Monad m => Stream m a -> Stream m (Int, a)
593+ [A] headElse :: Monad m => a -> Stream m a -> m a
594+ [A] head :: Monad m => Stream m a -> m (Maybe a)
595+ [A] handle :: (MonadCatch m, Exception e) => (e -> m (Stream m a)) -> Stream m a -> Stream m a
596+ [A] groupsWhile :: Monad m => (a -> a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
597+ [A] groupsRollingBy :: Monad m => (a -> a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
598+ [A] groupsOf :: Monad m => Int -> Fold m a b -> Stream m a -> Stream m b
599+ [A] gintercalateSuffix :: Monad m => Unfold m a c -> Stream m a -> Unfold m b c -> Stream m b -> Stream m c
600+ [A] gintercalate :: Monad m => Unfold m a c -> Stream m a -> Unfold m b c -> Stream m b -> Stream m c
601+ [A] ghandle :: (MonadCatch m, Exception e) => (e -> Stream m a -> m (Stream m a)) -> Stream m a -> Stream m a
602+ [A] generateM :: Monad m => Int -> (Int -> m a) -> Stream m a
603+ [A] generate :: Monad m => Int -> (Int -> a) -> Stream m a
604+ [A] generalizeInner :: Monad m => Stream Identity a -> Stream m a
605+ [A] gbracket_ :: Monad m => m c -> (c -> m d) -> (c -> e -> Stream m b -> m (Stream m b)) -> (forall s. m s -> m (Either e s)) -> (c -> Stream m b) -> Stream m b
606+ [A] gbracket :: MonadIO m => IO c -> (c -> IO d1) -> (c -> e -> Stream m b -> IO (Stream m b)) -> (c -> IO d2) -> (forall s. m s -> m (Either e s)) -> (c -> Stream m b) -> Stream m b
607+ [A] fromStreamK :: Applicative m => StreamK m a -> Stream m a
608+ [A] fromPure :: Applicative m => a -> Stream m a
609+ [A] fromPtrN :: (Monad m, Storable a) => Int -> Ptr a -> Stream m a
610+ [A] fromPtr :: forall m a. (Monad m, Storable a) => Ptr a -> Stream m a
611+ [A] fromListM :: Monad m => [m a] -> Stream m a
612+ [A] fromList :: Applicative m => [a] -> Stream m a
613+ [A] fromIndicesM :: Monad m => (Int -> m a) -> Stream m a
614+ [A] fromIndices :: Monad m => (Int -> a) -> Stream m a
615+ [A] fromFoldableM :: (Monad m, Foldable f) => f (m a) -> Stream m a
616+ [A] fromFoldable :: (Monad m, Foldable f) => f a -> Stream m a
617+ [A] fromEffect :: Applicative m => m a -> Stream m a
618+ [A] fromByteStr# :: Monad m => Addr# -> Stream m Word8
619+ [A] foldrT :: (Monad m, Monad (t m), MonadTrans t) => (a -> t m b -> t m b) -> t m b -> Stream m a -> t m b
620+ [A] foldrS :: Monad m => (a -> Stream m b -> Stream m b) -> Stream m b -> Stream m a -> Stream m b
621+ [A] foldrMx :: Monad m => (a -> m x -> m x) -> m x -> (m x -> m b) -> Stream m a -> m b
622+ [A] foldrM :: Monad m => (a -> m b -> m b) -> m b -> Stream m a -> m b
623+ [A] foldr1 :: Monad m => (a -> a -> a) -> Stream m a -> m (Maybe a)
624+ [A] foldr :: Monad m => (a -> b -> b) -> b -> Stream m a -> m b
625+ [A] foldlx' :: Monad m => (x -> a -> x) -> x -> (x -> b) -> Stream m a -> m b
626+ [A] foldlT :: (Monad m, Monad (s m), MonadTrans s) => (s m b -> a -> s m b) -> s m b -> Stream m a -> s m b
627+ [A] foldlS :: Monad m => (Stream m b -> a -> Stream m b) -> Stream m b -> Stream m a -> Stream m b
628+ [A] foldlMx' :: Monad m => (x -> a -> m x) -> m x -> (x -> m b) -> Stream m a -> m b
629+ [A] foldlM' :: Monad m => (b -> a -> m b) -> m b -> Stream m a -> m b
630+ [A] foldl' :: Monad m => (b -> a -> b) -> b -> Stream m a -> m b
631+ [A] foldSequence :: Stream m (Fold m a b) -> Stream m a -> Stream m b
632+ [A] foldManyPost :: Monad m => Fold m a b -> Stream m a -> Stream m b
633+ [A] foldMany :: Monad m => Fold m a b -> Stream m a -> Stream m b
634+ [A] foldIterateM :: Monad m => (b -> m (Fold m a b)) -> m b -> Stream m a -> Stream m b
635+ [A] foldIterateBfs :: Fold m a (Either a a) -> Stream m a -> m (Maybe a)
636+ [A] foldEither :: Monad m => Fold m a b -> Stream m a -> m (Either (Fold m a b) (b, Stream m a))
637+ [A] foldBreak :: Monad m => Fold m a b -> Stream m a -> m (b, Stream m a)
638+ [A] foldAddLazy :: Monad m => Fold m a b -> Stream m a -> Fold m a b
639+ [A] foldAdd :: Monad m => Fold m a b -> Stream m a -> m (Fold m a b)
640+ [A] fold :: Monad m => Fold m a b -> Stream m a -> m b
641+ [A] findM :: Monad m => (a -> m Bool) -> Stream m a -> m (Maybe a)
642+ [A] findIndices :: Monad m => (a -> Bool) -> Stream m a -> Stream m Int
643+ [A] find :: Monad m => (a -> Bool) -> Stream m a -> m (Maybe a)
644+ [A] finallyUnsafe :: MonadCatch m => m b -> Stream m a -> Stream m a
645+ [A] finallyIO :: (MonadIO m, MonadCatch m) => IO b -> Stream m a -> Stream m a
646+ [A] filterM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
647+ [A] filterInStreamGenericBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Stream m a -> Stream m a
648+ [A] filterInStreamAscBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
649+ [A] filter :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
650+ [A] evalStateT :: Monad m => m s -> Stream (StateT s m) a -> Stream m a
651+ [A] eqBy :: Monad m => (a -> b -> Bool) -> Stream m a -> Stream m b -> m Bool
652+ [A] enumerateTo :: (Monad m, Bounded a, Enumerable a) => a -> Stream m a
653+ [A] enumerateFromToSmall :: (Monad m, Enum a) => a -> a -> Stream m a
654+ [A] enumerateFromToIntegral :: (Monad m, Integral a) => a -> a -> Stream m a
655+ [A] enumerateFromToFractional :: (Monad m, Fractional a, Ord a) => a -> a -> Stream m a
656+ [A] enumerateFromTo :: (Enumerable a, Monad m) => a -> a -> Stream m a
657+ [A] enumerateFromThenToSmall :: (Monad m, Enum a) => a -> a -> a -> Stream m a
658+ [A] enumerateFromThenToIntegral :: (Monad m, Integral a) => a -> a -> a -> Stream m a
659+ [A] enumerateFromThenToFractional :: (Monad m, Fractional a, Ord a) => a -> a -> a -> Stream m a
660+ [A] enumerateFromThenTo :: (Enumerable a, Monad m) => a -> a -> a -> Stream m a
661+ [A] enumerateFromThenSmallBounded :: (Monad m, Enumerable a, Bounded a) => a -> a -> Stream m a
662+ [A] enumerateFromThenNum :: (Monad m, Num a) => a -> a -> Stream m a
663+ [A] enumerateFromThenIntegral :: (Monad m, Integral a, Bounded a) => a -> a -> Stream m a
664+ [A] enumerateFromThenFractional :: (Monad m, Fractional a) => a -> a -> Stream m a
665+ [A] enumerateFromThen :: (Enumerable a, Monad m) => a -> a -> Stream m a
666+ [A] enumerateFromStepNum :: (Monad m, Num a) => a -> a -> Stream m a
667+ [A] enumerateFromStepIntegral :: (Integral a, Monad m) => a -> a -> Stream m a
668+ [A] enumerateFromNum :: (Monad m, Num a) => a -> Stream m a
669+ [A] enumerateFromIntegral :: (Monad m, Integral a, Bounded a) => a -> Stream m a
670+ [A] enumerateFromFractional :: (Monad m, Fractional a) => a -> Stream m a
671+ [A] enumerateFromBounded :: (Monad m, Enumerable a, Bounded a) => a -> Stream m a
672+ [A] enumerateFrom :: (Enumerable a, Monad m) => a -> Stream m a
673+ [A] enumerate :: (Monad m, Bounded a, Enumerable a) => Stream m a
674+ [A] elemIndices :: (Monad m, Eq a) => a -> Stream m a -> Stream m Int
675+ [A] elem :: (Monad m, Eq a) => a -> Stream m a -> m Bool
676+ [A] durations :: Double -> t m RelTime64
677+ [A] dropWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
678+ [A] dropWhileLast :: (a -> Bool) -> Stream m a -> Stream m a
679+ [A] dropWhileAround :: (a -> Bool) -> Stream m a -> Stream m a
680+ [A] dropWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
681+ [A] dropSuffix :: Stream m a -> Stream m a -> Stream m a
682+ [A] dropPrefix :: Stream m a -> Stream m a -> Stream m a
683+ [A] dropLast :: Int -> Stream m a -> Stream m a
684+ [A] dropInfix :: Stream m a -> Stream m a -> Stream m a
685+ [A] drop :: Monad m => Int -> Stream m a -> Stream m a
686+ [A] drain :: Monad m => Stream m a -> m ()
687+ [A] deleteInStreamGenericBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Stream m a -> Stream m a
688+ [A] deleteInStreamAscBy :: (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
689+ [A] deleteBy :: Monad m => (a -> a -> Bool) -> a -> Stream m a -> Stream m a
690+ [A] delayPre :: MonadIO m => Double -> Stream m a -> Stream m a
691+ [A] delayPost :: MonadIO m => Double -> Stream m a -> Stream m a
692+ [A] delay :: MonadIO m => Double -> Stream m a -> Stream m a
693+ [A] crossWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
694+ [A] crossApplySnd :: Functor f => Stream f a -> Stream f b -> Stream f b
695+ [A] crossApplyFst :: Functor f => Stream f a -> Stream f b -> Stream f a
696+ [A] crossApply :: Functor f => Stream f (a -> b) -> Stream f a -> Stream f b
697+ [A] cross :: Monad m => Stream m a -> Stream m b -> Stream m (a, b)
698+ [A] consM :: Applicative m => m a -> Stream m a -> Stream m a
699+ [A] cons :: Applicative m => a -> Stream m a -> Stream m a
700+ [A] concatMapM :: Monad m => (a -> m (Stream m b)) -> Stream m a -> Stream m b
701+ [A] concatMap :: Monad m => (a -> Stream m b) -> Stream m a -> Stream m b
702+ [A] concatIterateScan :: Monad m => (b -> a -> m b) -> (b -> m (Maybe (b, Stream m a))) -> b -> Stream m a
703+ [A] concatIterateDfs :: Monad m => (a -> Maybe (Stream m a)) -> Stream m a -> Stream m a
704+ [A] concatIterateBfsRev :: Monad m => (a -> Maybe (Stream m a)) -> Stream m a -> Stream m a
705+ [A] concatIterateBfs :: Monad m => (a -> Maybe (Stream m a)) -> Stream m a -> Stream m a
706+ [A] concatEffect :: Monad m => m (Stream m a) -> Stream m a
707+ [A] concat :: Monad m => Stream m (Stream m a) -> Stream m a
708+ [A] cmpBy :: Monad m => (a -> b -> Ordering) -> Stream m a -> Stream m b -> m Ordering
709+ [A] catRights :: Monad m => Stream m (Either a b) -> Stream m b
710+ [A] catMaybes :: Monad m => Stream m (Maybe a) -> Stream m a
711+ [A] catLefts :: Monad m => Stream m (Either a b) -> Stream m a
712+ [A] catEithers :: Monad m => Stream m (Either a a) -> Stream m a
713+ [A] bracketUnsafe :: MonadCatch m => m b -> (b -> m c) -> (b -> Stream m a) -> Stream m a
714+ [A] bracketIO3 :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> IO d) -> (b -> IO e) -> (b -> Stream m a) -> Stream m a
715+ [A] bracketIO :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> Stream m a) -> Stream m a
716+ [A] before :: Monad m => m b -> Stream m a -> Stream m a
717+ [A] append :: Monad m => Stream m a -> Stream m a -> Stream m a
718+ [A] any :: Monad m => (a -> Bool) -> Stream m a -> m Bool
719+ [A] all :: Monad m => (a -> Bool) -> Stream m a -> m Bool
720+ [A] afterUnsafe :: Monad m => m b -> Stream m a -> Stream m a
721+ [A] afterIO :: MonadIO m => IO b -> Stream m a -> Stream m a
722+ [A] absTimesWith :: MonadIO m => Double -> Stream m AbsTime
723+ [A] absTimes :: MonadIO m => Stream m AbsTime
724+ [A] (!!) :: Monad m => Stream m a -> Int -> m (Maybe a)
725+[R] Streamly.Internal.Data.Ring.Unboxed
726+[A] Streamly.Internal.Data.Ring.Generic
727+ [A] Ring
728+ [A] [ringMax] :: Ring a -> !Int
729+ [A] [ringHead] :: Ring a -> !Int
730+ [A] [ringArr] :: Ring a -> MutArray a
731+ [A] Ring :: MutArray a -> !Int -> !Int -> Ring a
732+ [A] writeLastN :: MonadIO m => Int -> Fold m a (Ring a)
733+ [A] unsafeInsertRingWith :: Ring a -> a -> IO Int
734+ [A] toStreamWith :: Int -> Ring a -> Stream m a
735+ [A] toMutArray :: MonadIO m => Int -> Int -> Ring a -> m (MutArray a)
736+ [A] seek :: MonadIO m => Int -> Ring a -> m (Ring a)
737+ [A] createRing :: MonadIO m => Int -> m (Ring a)
738+ [A] copyToMutArray :: MonadIO m => Int -> Int -> Ring a -> m (MutArray a)
739+[C] Streamly.Internal.Data.Ring
740+ [C] Ring
741+ [A] [ringStart] :: Ring a -> {-# UNPACK #-} !ForeignPtr a
742+ [R] [ringMax] :: Ring a -> !Int
743+ [R] [ringHead] :: Ring a -> !Int
744+ [A] [ringBound] :: Ring a -> {-# UNPACK #-} !Ptr a
745+ [R] [ringArr] :: Ring a -> MutArray a
746+ [C] Ring
747+ [O] Ring :: MutArray a -> !Int -> !Int -> Ring a
748+ [N] Ring :: {-# UNPACK #-} !ForeignPtr a -> {-# UNPACK #-} !Ptr a -> Ring a
749+ [A] GHC.Show.Show
750+ [A] instance (GHC.Show.Show a, GHC.Show.Show b, GHC.Show.Show c, GHC.Show.Show d) => GHC.Show.Show (Streamly.Internal.Data.Ring.Tuple4' a b c d)
751+ [A] writeN :: Int -> Fold m a (Ring a)
752+ [R] writeLastN :: MonadIO m => Int -> Fold m a (Ring a)
753+ [R] unsafeInsertRingWith :: Ring a -> a -> IO Int
754+ [A] unsafeInsert :: Storable a => Ring a -> Ptr a -> a -> IO (Ptr a)
755+ [A] unsafeFoldRingNM :: forall m a b. (MonadIO m, Storable a) => Int -> Ptr a -> (b -> a -> m b) -> b -> Ring a -> m b
756+ [A] unsafeFoldRingM :: forall m a b. (MonadIO m, Storable a) => Ptr a -> (b -> a -> m b) -> b -> Ring a -> m b
757+ [A] unsafeFoldRingFullM :: forall m a b. (MonadIO m, Storable a) => Ptr a -> (b -> a -> m b) -> b -> Ring a -> m b
758+ [A] unsafeFoldRing :: forall a b. Storable a => Ptr a -> (b -> a -> b) -> b -> Ring a -> b
759+ [A] unsafeEqArrayN :: Ring a -> Ptr a -> Array a -> Int -> Bool
760+ [A] unsafeEqArray :: Ring a -> Ptr a -> Array a -> Bool
761+ [R] toStreamWith :: Int -> Ring a -> Stream m a
762+ [R] toMutArray :: MonadIO m => Int -> Int -> Ring a -> m (MutArray a)
763+ [A] startOf :: Ring a -> Ptr a
764+ [A] slidingWindowWith :: forall m a b. (MonadIO m, Storable a, Unbox a) => Int -> Fold m ((a, Maybe a), m (MutArray a)) b -> Fold m a b
765+ [A] slidingWindow :: forall m a b. (MonadIO m, Storable a, Unbox a) => Int -> Fold m (a, Maybe a) b -> Fold m a b
766+ [A] slide :: Ring a -> a -> m (Ring a)
767+ [R] seek :: MonadIO m => Int -> Ring a -> m (Ring a)
768+ [A] ringsOf :: Int -> Stream m a -> Stream m (MutArray a)
769+ [A] readRev :: Unfold m (MutArray a) a
770+ [A] read :: forall m a. (MonadIO m, Storable a) => Unfold m (Ring a, Ptr a, Int) a
771+ [A] putIndex :: Ring a -> Int -> a -> m ()
772+ [A] newRing :: Int -> m (Ring a)
773+ [A] new :: forall a. Storable a => Int -> IO (Ring a, Ptr a)
774+ [A] moveBy :: forall a. Storable a => Int -> Ring a -> Ptr a -> Ptr a
775+ [A] modifyIndex :: Ring a -> Int -> (a -> (a, b)) -> m b
776+ [A] length :: Ring a -> Int
777+ [A] getIndexUnsafe :: Ring a -> Int -> m a
778+ [A] getIndexRev :: Ring a -> Int -> m a
779+ [A] getIndex :: Ring a -> Int -> m a
780+ [A] fromArray :: MutArray a -> Ring a
781+ [R] createRing :: MonadIO m => Int -> m (Ring a)
782+ [A] castUnsafe :: Ring a -> Ring b
783+ [A] cast :: forall a b. Storable b => Ring a -> Maybe (Ring b)
784+ [A] bytesFree :: Ring a -> Int
785+ [A] byteLength :: Ring a -> Int
786+ [A] byteCapacity :: Ring a -> Int
787+ [A] asBytes :: Ring a -> Ring Word8
788+ [A] advance :: forall a. Storable a => Ring a -> Ptr a -> Ptr a
789+[R] Streamly.Internal.Data.Producer.Type
790+[R] Streamly.Internal.Data.Producer.Source
791+[C] Streamly.Internal.Data.Producer
792+ [A] Source
793+ [A] unread :: [b] -> Source a b -> Source a b
794+ [A] translate :: Functor m => (a -> c) -> (c -> a) -> Producer m c b -> Producer m a b
795+ [A] source :: Maybe a -> Source a b
796+ [A] producer :: Monad m => Producer m a b -> Producer m (Source a b) b
797+ [A] parseManyD :: Monad m => Parser a m b -> Producer m (Source x a) a -> Producer m (Source x a) (Either ParseError b)
798+ [A] parseMany :: Monad m => Parser a m b -> Producer m (Source x a) a -> Producer m (Source x a) (Either ParseError b)
799+ [A] parse :: Monad m => Parser a m b -> Producer m (Source s a) a -> Source s a -> m (Either ParseError b, Source s a)
800+ [A] lmap :: (a -> a) -> Producer m a b -> Producer m a b
801+ [A] isEmpty :: Source a b -> Bool
802+[R] Streamly.Internal.Data.Pipe.Type
803+[C] Streamly.Internal.Data.Pipe
804+ [A] Step
805+ [A] Yield :: a -> s -> Step s a
806+ [A] Continue :: s -> Step s a
807+ [A] PipeState
808+ [A] Produce :: s2 -> PipeState s1 s2
809+ [A] Consume :: s1 -> PipeState s1 s2
810+ [C] Pipe
811+ [A] Pipe :: (s1 -> a -> m (Step (PipeState s1 s2) b)) -> (s2 -> m (Step (PipeState s1 s2) b)) -> s1 -> Pipe m a b
812+[A] Streamly.Internal.Data.ParserK
813+ [A] Step
814+ [A] Partial :: !Int -> (Input a -> m (Step a m r)) -> Step a m r
815+ [A] Error :: !Int -> String -> Step a m r
816+ [A] Done :: !Int -> r -> Step a m r
817+ [A] Continue :: !Int -> (Input a -> m (Step a m r)) -> Step a m r
818+ [A] ParseResult
819+ [A] Success :: !Int -> !b -> ParseResult b
820+ [A] Failure :: !Int -> !String -> ParseResult b
821+ [A] Input
822+ [A] None :: Input a
823+ [A] Chunk :: a -> Input a
824+ [A] ParserK
825+ [A] [runParser] :: ParserK a m b -> forall r. (ParseResult b -> Int -> Input a -> m (Step a m r)) -> Int -> Int -> Input a -> m (Step a m r)
826+ [A] MkParser :: (forall r. (ParseResult b -> Int -> Input a -> m (Step a m r)) -> Int -> Int -> Input a -> m (Step a m r)) -> ParserK a m b
827+ [A] fromPure :: b -> ParserK a m b
828+ [A] fromEffect :: Monad m => m b -> ParserK a m b
829+ [A] die :: String -> ParserK a m b
830+ [A] adaptCG :: Monad m => Parser a m b -> ParserK (Array a) m b
831+ [A] adaptC :: (Monad m, Unbox a) => Parser a m b -> ParserK (Array a) m b
832+ [A] adapt :: Monad m => Parser a m b -> ParserK a m b
833+[R] Streamly.Internal.Data.Parser.ParserK.Type
834+[R] Streamly.Internal.Data.Parser.ParserD.Type
835+[R] Streamly.Internal.Data.Parser.ParserD.Tee
836+[R] Streamly.Internal.Data.Parser.ParserD
837+[C] Streamly.Internal.Data.Parser
838+ [A] Step
839+ [A] Partial :: !Int -> !s -> Step s b
840+ [A] Error :: !String -> Step s b
841+ [A] Done :: !Int -> !b -> Step s b
842+ [A] Continue :: !Int -> !s -> Step s b
843+ [A] Parser
844+ [A] Parser :: (s -> a -> m (Step s b)) -> m (Initial s b) -> (s -> m (Step s b)) -> Parser a m b
845+ [A] Initial
846+ [A] IPartial :: !s -> Initial s b
847+ [A] IError :: !String -> Initial s b
848+ [A] IDone :: !b -> Initial s b
849+ [A] GHC.Show.Show
850+ [A] instance (GHC.Show.Show a, GHC.Show.Show b) => GHC.Show.Show (Streamly.Internal.Data.Parser.Tuple'Fused a b)
851+ [A] ParseError
852+ [A] ParseError :: String -> ParseError
853+ [A] zipWithM :: Monad m => (a -> b -> m c) -> Stream m a -> Fold m c x -> Parser b m x
854+ [A] zip :: Monad m => Stream m a -> Fold m (a, b) x -> Parser b m x
855+ [A] wordWithQuotes :: (Monad m, Eq a) => Bool -> (a -> a -> Maybe a) -> a -> (a -> Maybe a) -> (a -> Bool) -> Fold m a b -> Parser a m b
856+ [A] wordProcessQuotes :: (Monad m, Eq a) => a -> (a -> Maybe a) -> (a -> Bool) -> Fold m a b -> Parser a m b
857+ [A] wordKeepQuotes :: (Monad m, Eq a) => a -> (a -> Maybe a) -> (a -> Bool) -> Fold m a b -> Parser a m b
858+ [A] wordFramedBy :: Monad m => (a -> Bool) -> (a -> Bool) -> (a -> Bool) -> (a -> Bool) -> Fold m a b -> Parser a m b
859+ [A] wordBy :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
860+ [A] toFold :: Monad m => Parser a m b -> Fold m a b
861+ [A] takeWhileP :: Monad m => (a -> Bool) -> Parser a m b -> Parser a m b
862+ [A] takeWhile1 :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
863+ [A] takeWhile :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
864+ [A] takeStartBy_ :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
865+ [A] takeStartBy :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
866+ [A] takeP :: Monad m => Int -> Parser a m b -> Parser a m b
867+ [A] takeGE :: Monad m => Int -> Fold m a b -> Parser a m b
868+ [A] takeFramedBy_ :: Monad m => (a -> Bool) -> (a -> Bool) -> Fold m a b -> Parser a m b
869+ [A] takeFramedByGeneric :: Monad m => Maybe (a -> Bool) -> Maybe (a -> Bool) -> Maybe (a -> Bool) -> Fold m a b -> Parser a m b
870+ [A] takeFramedByEsc_ :: Monad m => (a -> Bool) -> (a -> Bool) -> (a -> Bool) -> Fold m a b -> Parser a m b
871+ [A] takeEndBy_ :: (a -> Bool) -> Parser a m b -> Parser a m b
872+ [A] takeEndByEsc :: Monad m => (a -> Bool) -> (a -> Bool) -> Parser a m b -> Parser a m b
873+ [A] takeEndBy :: Monad m => (a -> Bool) -> Parser a m b -> Parser a m b
874+ [A] takeEitherSepBy :: (a -> Bool) -> Fold m (Either a b) c -> Parser a m c
875+ [A] takeEQ :: Monad m => Int -> Fold m a b -> Parser a m b
876+ [A] takeBetween :: Monad m => Int -> Int -> Fold m a b -> Parser a m b
877+ [A] subsequenceBy :: (a -> a -> Bool) -> Stream m a -> Parser a m ()
878+ [A] streamEqBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Parser a m ()
879+ [A] split_ :: Monad m => Parser x m a -> Parser x m b -> Parser x m b
880+ [A] splitWith :: Monad m => (a -> b -> c) -> Parser x m a -> Parser x m b -> Parser x m c
881+ [A] splitSome :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
882+ [A] splitManyPost :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
883+ [A] splitMany :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
884+ [A] spanByRolling :: Monad m => (a -> a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (b, c)
885+ [A] spanBy :: Monad m => (a -> a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (b, c)
886+ [A] span :: Monad m => (a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (b, c)
887+ [A] some :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
888+ [A] sequence :: Monad m => Stream m (Parser a m b) -> Fold m b c -> Parser a m c
889+ [A] sepByAll :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
890+ [A] sepBy1 :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
891+ [A] sepBy :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
892+ [A] satisfy :: Monad m => (a -> Bool) -> Parser a m a
893+ [A] sampleFromthen :: Monad m => Int -> Int -> Fold m a b -> Parser a m b
894+ [A] roundRobin :: t (Parser a m b) -> Fold m b c -> Parser a m c
895+ [A] rmapM :: Monad m => (b -> m c) -> Parser a m b -> Parser a m c
896+ [A] retryMaxTotal :: Int -> Parser a m b -> Fold m b c -> Parser a m c
897+ [A] retryMaxSuccessive :: Int -> Parser a m b -> Fold m b c -> Parser a m c
898+ [A] retry :: Parser a m b -> Parser a m b
899+ [A] postscan :: Fold m a b -> Parser b m c -> Parser a m c
900+ [A] peek :: Monad m => Parser a m a
901+ [A] oneOf :: (Monad m, Eq a, Foldable f) => f a -> Parser a m a
902+ [A] oneNotEq :: (Monad m, Eq a) => a -> Parser a m a
903+ [A] oneEq :: (Monad m, Eq a) => a -> Parser a m a
904+ [A] one :: Monad m => Parser a m a
905+ [A] noneOf :: (Monad m, Eq a, Foldable f) => f a -> Parser a m a
906+ [A] noErrorUnsafeSplit_ :: Monad m => Parser x m a -> Parser x m b -> Parser x m b
907+ [A] noErrorUnsafeSplitWith :: Monad m => (a -> b -> c) -> Parser x m a -> Parser x m b -> Parser x m c
908+ [A] noErrorUnsafeConcatMap :: Monad m => (b -> Parser a m c) -> Parser a m b -> Parser a m c
909+ [A] maybe :: Monad m => (a -> Maybe b) -> Parser a m b
910+ [A] manyTillP :: Parser a m b -> Parser a m x -> Parser b m c -> Parser a m c
911+ [A] manyTill :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
912+ [A] manyThen :: Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
913+ [A] manyP :: Parser a m b -> Parser b m c -> Parser a m c
914+ [A] many :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
915+ [A] makeIndexFilter :: (Fold m (s, a) b -> Parser a m b) -> (((s, a) -> Bool) -> Fold m (s, a) b -> Fold m (s, a) b) -> ((s, a) -> Bool) -> Fold m a b -> Parser a m b
916+ [A] lookAhead :: Monad m => Parser a m b -> Parser a m b
917+ [A] lmapM :: Monad m => (a -> m b) -> Parser b m r -> Parser a m r
918+ [A] lmap :: (a -> b) -> Parser b m r -> Parser a m r
919+ [A] listEqBy :: Monad m => (a -> a -> Bool) -> [a] -> Parser a m [a]
920+ [A] listEq :: (Monad m, Eq a) => [a] -> Parser a m [a]
921+ [A] indexed :: forall m a b. Monad m => Fold m (Int, a) b -> Parser a m b
922+ [A] groupByRollingEither :: Monad m => (a -> a -> Bool) -> Fold m a b -> Fold m a c -> Parser a m (Either b c)
923+ [A] groupByRolling :: Monad m => (a -> a -> Bool) -> Fold m a b -> Parser a m b
924+ [A] groupBy :: Monad m => (a -> a -> Bool) -> Fold m a b -> Parser a m b
925+ [A] fromPure :: Monad m => b -> Parser a m b
926+ [A] fromFoldMaybe :: Monad m => String -> Fold m a (Maybe b) -> Parser a m b
927+ [A] fromFold :: Monad m => Fold m a b -> Parser a m b
928+ [A] fromEffect :: Monad m => m b -> Parser a m b
929+ [A] filter :: Monad m => (a -> Bool) -> Parser a m b -> Parser a m b
930+ [A] extractStep :: Monad m => (s -> m (Step s1 b)) -> Step s b -> m (Step s1 b)
931+ [A] eof :: Monad m => Parser a m ()
932+ [A] either :: Monad m => (a -> Either String b) -> Parser a m b
933+ [A] dropWhile :: Monad m => (a -> Bool) -> Parser a m ()
934+ [A] dieM :: Monad m => m String -> Parser a m b
935+ [A] die :: Monad m => String -> Parser a m b
936+ [A] deintercalateAll :: Monad m => Parser a m x -> Parser a m y -> Fold m (Either x y) z -> Parser a m z
937+ [A] deintercalate1 :: Monad m => Parser a m x -> Parser a m y -> Fold m (Either x y) z -> Parser a m z
938+ [A] deintercalate :: Monad m => Parser a m x -> Parser a m y -> Fold m (Either x y) z -> Parser a m z
939+ [A] countBetween :: Int -> Int -> Parser a m b -> Fold m b c -> Parser a m c
940+ [A] count :: Int -> Parser a m b -> Fold m b c -> Parser a m c
941+ [A] concatMap :: Monad m => (b -> Parser a m c) -> Parser a m b -> Parser a m c
942+ [A] blockWithQuotes :: (Monad m, Eq a) => (a -> Bool) -> (a -> Bool) -> a -> a -> Fold m a b -> Parser a m b
943+ [A] bimapOverrideCount :: Int -> (s -> s1) -> (b -> b1) -> Step s b -> Step s1 b1
944+ [A] alt :: Monad m => Parser x m a -> Parser x m a -> Parser x m a
945+[A] Streamly.Internal.Data.MutByteArray
946+ [A] class Unbox a
947+ [A] class SizeOfRep (f :: Type -> Type)
948+ [A] class Serialize a
949+ [A] TypeOfType
950+ [A] UnitType :: Name -> TypeOfType
951+ [A] TheType :: SimpleDataCon -> TypeOfType
952+ [A] MultiType :: [SimpleDataCon] -> TypeOfType
953+ [A] SimpleDataCon
954+ [A] SimpleDataCon :: Name -> [Field] -> SimpleDataCon
955+ [A] SerializeConfig
956+ [A] [cfgRecordSyntaxWithHeader] :: SerializeConfig -> Bool
957+ [A] [cfgInlineSize] :: SerializeConfig -> Maybe Inline
958+ [A] [cfgInlineSerialize] :: SerializeConfig -> Maybe Inline
959+ [A] [cfgInlineDeserialize] :: SerializeConfig -> Maybe Inline
960+ [A] [cfgConstructorTagAsString] :: SerializeConfig -> Bool
961+ [A] SerializeConfig :: Maybe Inline -> Maybe Inline -> Maybe Inline -> Bool -> Bool -> SerializeConfig
962+ [A] PinnedState
963+ [A] Unpinned :: PinnedState
964+ [A] Pinned :: PinnedState
965+ [A] MutByteArray
966+ [A] MutByteArray :: MutableByteArray# RealWorld -> MutByteArray
967+ [A] DataType
968+ [A] [dtTvs] :: DataType -> [Name]
969+ [A] [dtName] :: DataType -> Name
970+ [A] [dtCxt] :: DataType -> Cxt
971+ [A] [dtCons] :: DataType -> [DataCon]
972+ [A] DataType :: Name -> [Name] -> Cxt -> [DataCon] -> DataType
973+ [A] DataCon
974+ [A] [dcTvs] :: DataCon -> [Name]
975+ [A] [dcName] :: DataCon -> Name
976+ [A] [dcFields] :: DataCon -> [(Maybe Name, Type)]
977+ [A] [dcCxt] :: DataCon -> Cxt
978+ [A] DataCon :: Name -> [Name] -> Cxt -> [(Maybe Name, Type)] -> DataCon
979+ [A] BoundedPtr
980+ [A] BoundedPtr :: MutByteArray -> Int -> Int -> BoundedPtr
981+ [A] Streamly.Internal.Data.Serialize.Type.Serialize
982+ [A] instance Streamly.Internal.Data.Serialize.Type.Serialize Streamly.Internal.Data.MutByteArray.LiftedInteger
983+ [A] instance Streamly.Internal.Data.Serialize.Type.Serialize GHC.Num.Integer.Integer
984+ [A] instance Streamly.Internal.Data.Serialize.Type.Serialize a => Streamly.Internal.Data.Serialize.Type.Serialize (GHC.Maybe.Maybe a)
985+ [A] instance Streamly.Internal.Data.Serialize.Type.Serialize (Data.Proxy.Proxy a)
986+ [A] instance (Streamly.Internal.Data.Serialize.Type.Serialize a, Streamly.Internal.Data.Serialize.Type.Serialize b) => Streamly.Internal.Data.Serialize.Type.Serialize (Data.Either.Either a b)
987+ [A] Peeker
988+ [A] Peeker :: Builder BoundedPtr IO a -> Peeker a
989+ [A] type Field = (Maybe Name, Type)
990+ [A] xorCmp :: [Word8] -> Name -> Name -> Q Exp
991+ [A] wListToString :: [Word8] -> String
992+ [A] w8_int :: Word8 -> Int
993+ [A] w32_int :: Word32 -> Int
994+ [A] unpin :: MutByteArray -> IO MutByteArray
995+ [A] typeOfType :: Type -> [DataCon] -> TypeOfType
996+ [A] skipByte :: Peeker ()
997+ [A] sizeOfRep :: SizeOfRep f => f x -> Int
998+ [A] sizeOfMutableByteArray :: MutByteArray -> IO Int
999+ [A] sizeOf :: (Unbox a, SizeOfRep (Rep a)) => Proxy a -> Int
1000+ [A] simplifyDataCon :: DataCon -> SimpleDataCon
1001+ [A] serializeW8List :: Name -> Name -> [Word8] -> Q Exp
1002+ [A] serializeConfig :: SerializeConfig
1003+ [A] serializeAt :: Serialize a => Int -> MutByteArray -> a -> IO Int
1004+ [A] runPeeker :: Peeker a -> BoundedPtr -> IO a
1005+ [A] reifyDataType :: Name -> Q DataType
1006+ [A] readUnsafe :: Unbox a => Peeker a
1007+ [A] read :: Unbox a => Peeker a
1008+ [A] putSliceUnsafe :: MonadIO m => MutByteArray -> Int -> MutByteArray -> Int -> Int -> m ()
1009+ [A] pokeRep :: PokeRep f => f a -> BoundedPtr -> IO BoundedPtr
1010+ [A] pokeBoundedPtrUnsafe :: forall a. Unbox a => a -> BoundedPtr -> IO BoundedPtr
1011+ [A] pokeBoundedPtr :: forall a. Unbox a => a -> BoundedPtr -> IO BoundedPtr
1012+ [A] pokeAt :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutByteArray -> a -> IO ()
1013+ [A] pinnedNewAlignedBytes :: Int -> Int -> IO MutByteArray
1014+ [A] pinnedNew :: Int -> IO MutByteArray
1015+ [A] pinnedCloneSliceUnsafe :: MonadIO m => Int -> Int -> MutByteArray -> m MutByteArray
1016+ [A] pin :: MutByteArray -> IO MutByteArray
1017+ [A] peekRep :: PeekRep f => Peeker (f x)
1018+ [A] peekAt :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutByteArray -> IO a
1019+ [A] openConstructor :: Name -> Int -> Q Pat
1020+ [A] nil :: MutByteArray
1021+ [A] newBytesAs :: PinnedState -> Int -> IO MutByteArray
1022+ [A] new :: Int -> IO MutByteArray
1023+ [A] mkSerializeExprFields :: Name -> [Field] -> Q Exp
1024+ [A] mkRecSizeOfExpr :: SimpleDataCon -> Q Exp
1025+ [A] mkRecSerializeExpr :: Name -> SimpleDataCon -> Q Exp
1026+ [A] mkRecDeserializeExpr :: Name -> Name -> Name -> SimpleDataCon -> Q Exp
1027+ [A] mkFieldName :: Int -> Name
1028+ [A] mkDeserializeKeysDec :: Name -> Name -> SimpleDataCon -> Q [Dec]
1029+ [A] mkDeserializeExprOne :: Name -> SimpleDataCon -> Q Exp
1030+ [A] matchConstructor :: Name -> Int -> Q Exp -> Q Match
1031+ [A] makeN :: Int -> Name
1032+ [A] makeI :: Int -> Name
1033+ [A] makeA :: Int -> Name
1034+ [A] litProxy :: Unbox a => Proxy a -> Q Exp
1035+ [A] litIntegral :: Integral a => a -> Q Exp
1036+ [A] isUnitType :: [DataCon] -> Bool
1037+ [A] isRecordSyntax :: SimpleDataCon -> Bool
1038+ [A] isPinned :: MutByteArray -> Bool
1039+ [A] int_w8 :: Int -> Word8
1040+ [A] int_w32 :: Int -> Word32
1041+ [A] inlineSerializeAt :: Maybe Inline -> SerializeConfig -> SerializeConfig
1042+ [A] inlineDeserializeAt :: Maybe Inline -> SerializeConfig -> SerializeConfig
1043+ [A] inlineAddSizeTo :: Maybe Inline -> SerializeConfig -> SerializeConfig
1044+ [A] getMutableByteArray# :: MutByteArray -> MutableByteArray# RealWorld
1045+ [A] genericSizeOf :: forall a. SizeOfRep (Rep a) => Proxy a -> Int
1046+ [A] genericPokeByteIndex :: (Generic a, PokeRep (Rep a)) => MutByteArray -> Int -> a -> IO ()
1047+ [A] genericPeekByteIndex :: (Generic a, PeekRep (Rep a)) => MutByteArray -> Int -> IO a
1048+ [A] errorUnsupported :: String -> a
1049+ [A] errorUnimplemented :: a
1050+ [A] encodeRecordFields :: Bool -> SerializeConfig -> SerializeConfig
1051+ [A] encodeConstrNames :: Bool -> SerializeConfig -> SerializeConfig
1052+ [A] deserializeAt :: Serialize a => Int -> MutByteArray -> Int -> IO (Int, a)
1053+ [A] deriveUnbox :: Q [Dec] -> Q [Dec]
1054+ [A] deriveSerializeWith :: (SerializeConfig -> SerializeConfig) -> Q [Dec] -> Q [Dec]
1055+ [A] deriveSerialize :: Q [Dec] -> Q [Dec]
1056+ [A] conUpdateFuncDec :: Name -> [Field] -> Q [Dec]
1057+ [A] cloneSliceUnsafeAs :: MonadIO m => PinnedState -> Int -> Int -> MutByteArray -> m MutByteArray
1058+ [A] cloneSliceUnsafe :: MonadIO m => Int -> Int -> MutByteArray -> m MutByteArray
1059+ [A] c2w :: Char -> Word8
1060+ [A] asPtrUnsafe :: MonadIO m => MutByteArray -> (Ptr a -> m b) -> m b
1061+ [A] addSizeTo :: Serialize a => Int -> a -> Int
1062+ [A] _x :: Name
1063+ [A] _val :: Name
1064+ [A] _tag :: Name
1065+ [A] _initialOffset :: Name
1066+ [A] _endOffset :: Name
1067+ [A] _arr :: Name
1068+ [A] _acc :: Name
1069+[A] Streamly.Internal.Data.MutArray.Stream
1070+ [A] SpliceState
1071+ [A] SpliceYielding :: arr -> SpliceState s arr -> SpliceState s arr
1072+ [A] SpliceInitial :: s -> SpliceState s arr
1073+ [A] SpliceFinish :: SpliceState s arr
1074+ [A] SpliceBuffering :: s -> arr -> SpliceState s arr
1075+ [A] writeChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
1076+ [A] splitOn :: (MonadIO m, Unbox a) => (a -> Bool) -> MutArray a -> Stream m (MutArray a)
1077+ [A] pinnedChunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)
1078+ [A] packArraysChunksOf :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
1079+ [A] lpackArraysChunksOf :: (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) () -> Fold m (MutArray a) ()
1080+ [A] fromArrayStreamK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
1081+ [A] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
1082+ [A] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
1083+ [A] compactLE :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (Either ParseError (MutArray a))
1084+ [A] compactGE :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
1085+ [A] compactEQ :: Int -> Stream m (MutArray a) -> Stream m (MutArray a)
1086+ [A] compact :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
1087+ [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)
1088+[A] Streamly.Internal.Data.MutArray.Generic
1089+ [A] MutArray
1090+ [A] [arrTrueLen] :: MutArray a -> {-# UNPACK #-} !Int
1091+ [A] [arrStart] :: MutArray a -> {-# UNPACK #-} !Int
1092+ [A] [arrLen] :: MutArray a -> {-# UNPACK #-} !Int
1093+ [A] [arrContents#] :: MutArray a -> MutableArray# RealWorld a
1094+ [A] MutArray :: MutableArray# RealWorld a -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> MutArray a
1095+ [A] writeWith :: MonadIO m => Int -> Fold m a (MutArray a)
1096+ [A] writeNUnsafe :: MonadIO m => Int -> Fold m a (MutArray a)
1097+ [A] writeN :: MonadIO m => Int -> Fold m a (MutArray a)
1098+ [A] write :: MonadIO m => Fold m a (MutArray a)
1099+ [A] uninit :: MonadIO m => MutArray a -> Int -> m (MutArray a)
1100+ [A] toStreamK :: MonadIO m => MutArray a -> StreamK m a
1101+ [A] toList :: MonadIO m => MutArray a -> m [a]
1102+ [A] strip :: MonadIO m => (a -> Bool) -> MutArray a -> m (MutArray a)
1103+ [A] snocWith :: MonadIO m => (Int -> Int) -> MutArray a -> a -> m (MutArray a)
1104+ [A] snocUnsafe :: MonadIO m => MutArray a -> a -> m (MutArray a)
1105+ [A] snoc :: MonadIO m => MutArray a -> a -> m (MutArray a)
1106+ [A] realloc :: MonadIO m => Int -> MutArray a -> m (MutArray a)
1107+ [A] reader :: MonadIO m => Unfold m (MutArray a) a
1108+ [A] readRev :: MonadIO m => MutArray a -> Stream m a
1109+ [A] read :: MonadIO m => MutArray a -> Stream m a
1110+ [A] putSliceUnsafe :: MonadIO m => MutArray a -> Int -> MutArray a -> Int -> Int -> m ()
1111+ [A] putIndices :: MonadIO m => MutArray a -> Fold m (Int, a) ()
1112+ [A] putIndexUnsafe :: forall m a. MonadIO m => Int -> MutArray a -> a -> m ()
1113+ [A] putIndex :: MonadIO m => Int -> MutArray a -> a -> m ()
1114+ [A] producerWith :: Monad m => (forall b. IO b -> m b) -> Producer m (MutArray a) a
1115+ [A] producer :: MonadIO m => Producer m (MutArray a) a
1116+ [A] nil :: MonadIO m => m (MutArray a)
1117+ [A] new :: MonadIO m => Int -> m (MutArray a)
1118+ [A] modifyIndexUnsafe :: MonadIO m => Int -> MutArray a -> (a -> (a, b)) -> m b
1119+ [A] modifyIndex :: MonadIO m => Int -> MutArray a -> (a -> (a, b)) -> m b
1120+ [A] length :: MutArray a -> Int
1121+ [A] getSliceUnsafe :: Int -> Int -> MutArray a -> MutArray a
1122+ [A] getSlice :: Int -> Int -> MutArray a -> MutArray a
1123+ [A] getIndexUnsafeWith :: MonadIO m => MutableArray# RealWorld a -> Int -> m a
1124+ [A] getIndexUnsafe :: MonadIO m => Int -> MutArray a -> m a
1125+ [A] getIndex :: MonadIO m => Int -> MutArray a -> m (Maybe a)
1126+ [A] fromStreamN :: MonadIO m => Int -> Stream m a -> m (MutArray a)
1127+ [A] fromStream :: MonadIO m => Stream m a -> m (MutArray a)
1128+ [A] fromPureStream :: MonadIO m => Stream Identity a -> m (MutArray a)
1129+ [A] fromListN :: MonadIO m => Int -> [a] -> m (MutArray a)
1130+ [A] fromList :: MonadIO m => [a] -> m (MutArray a)
1131+ [A] eq :: (MonadIO m, Eq a) => MutArray a -> MutArray a -> m Bool
1132+ [A] cmp :: (MonadIO m, Ord a) => MutArray a -> MutArray a -> m Ordering
1133+ [A] clone :: MonadIO m => MutArray a -> m (MutArray a)
1134+ [A] chunksOf :: forall m a. MonadIO m => Int -> Stream m a -> Stream m (MutArray a)
1135+[A] Streamly.Internal.Data.MutArray
1136+ [A] MutByteArray
1137+ [A] MutArray
1138+ [A] [arrStart] :: MutArray a -> {-# UNPACK #-} !Int
1139+ [A] [arrEnd] :: MutArray a -> {-# UNPACK #-} !Int
1140+ [A] [arrContents] :: MutArray a -> {-# UNPACK #-} !MutByteArray
1141+ [A] [arrBound] :: MutArray a -> {-# UNPACK #-} !Int
1142+ [A] MutArray :: {-# UNPACK #-} !MutByteArray -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> MutArray a
1143+ [A] IORef
1144+ [A] ArrayUnsafe
1145+ [A] ArrayUnsafe :: {-# UNPACK #-} !MutByteArray -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> ArrayUnsafe a
1146+ [A] writeWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1147+ [A] writeRevN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1148+ [A] writeNWithUnsafe :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
1149+ [A] writeNWith :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
1150+ [A] writeNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1151+ [A] writeN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1152+ [A] writeIORef :: Unbox a => IORef a -> a -> IO ()
1153+ [A] writeChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
1154+ [A] writeAppendWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int) -> m (MutArray a) -> Fold m a (MutArray a)
1155+ [A] writeAppendNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
1156+ [A] writeAppendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
1157+ [A] writeAppend :: forall m a. (MonadIO m, Unbox a) => m (MutArray a) -> Fold m a (MutArray a)
1158+ [A] write :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
1159+ [A] unsafeSwapIndices :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> MutArray a -> m ()
1160+ [A] unpin :: MutArray a -> IO (MutArray a)
1161+ [A] toStreamKWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> StreamK m a
1162+ [A] toStreamKRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> StreamK m a
1163+ [A] toStreamKRev :: forall m a. (MonadIO m, Unbox a) => MutArray a -> StreamK m a
1164+ [A] toStreamK :: forall m a. (MonadIO m, Unbox a) => MutArray a -> StreamK m a
1165+ [A] toStreamDWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
1166+ [A] toStreamDRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
1167+ [A] toList :: forall m a. (MonadIO m, Unbox a) => MutArray a -> m [a]
1168+ [A] swapIndices :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> MutArray a -> m ()
1169+ [A] strip :: forall a m. (Unbox a, MonadIO m) => (a -> Bool) -> MutArray a -> m (MutArray a)
1170+ [A] splitOn :: (MonadIO m, Unbox a) => (a -> Bool) -> MutArray a -> Stream m (MutArray a)
1171+ [A] splitAt :: forall a. Unbox a => Int -> MutArray a -> (MutArray a, MutArray a)
1172+ [A] spliceWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int -> Int) -> MutArray a -> MutArray a -> m (MutArray a)
1173+ [A] spliceUnsafe :: MonadIO m => MutArray a -> MutArray a -> m (MutArray a)
1174+ [A] spliceExp :: (MonadIO m, Unbox a) => MutArray a -> MutArray a -> m (MutArray a)
1175+ [A] spliceCopy :: forall m a. MonadIO m => MutArray a -> MutArray a -> m (MutArray a)
1176+ [A] splice :: (MonadIO m, Unbox a) => MutArray a -> MutArray a -> m (MutArray a)
1177+ [A] snocWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int) -> MutArray a -> a -> m (MutArray a)
1178+ [A] snocUnsafe :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (MutArray a)
1179+ [A] snocMay :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (Maybe (MutArray a))
1180+ [A] snocLinear :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (MutArray a)
1181+ [A] snoc :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (MutArray a)
1182+ [A] shuffleBy :: (a -> a -> m Bool) -> MutArray a -> MutArray a -> m ()
1183+ [A] roundUpToPower2 :: Int -> Int
1184+ [A] rightSize :: forall m a. (MonadIO m, Unbox a) => MutArray a -> m (MutArray a)
1185+ [A] reverse :: forall m a. (MonadIO m, Unbox a) => MutArray a -> m ()
1186+ [A] resizeExp :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
1187+ [A] resize :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
1188+ [A] realloc :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
1189+ [A] readerRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> Unfold m (MutArray a) a
1190+ [A] readerRev :: forall m a. (MonadIO m, Unbox a) => Unfold m (MutArray a) a
1191+ [A] reader :: forall m a. (MonadIO m, Unbox a) => Unfold m (MutArray a) a
1192+ [A] readRev :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Stream m a
1193+ [A] readIORef :: Unbox a => IORef a -> IO a
1194+ [A] read :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Stream m a
1195+ [A] putIndices :: forall m a. (MonadIO m, Unbox a) => MutArray a -> Fold m (Int, a) ()
1196+ [A] putIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> a -> m ()
1197+ [A] putIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> a -> m ()
1198+ [A] producerWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> Producer m (MutArray a) a
1199+ [A] producer :: forall m a. (MonadIO m, Unbox a) => Producer m (MutArray a) a
1200+ [A] pollIntIORef :: (MonadIO m, Unbox a) => IORef a -> Stream m a
1201+ [A] pinnedWriteNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1202+ [A] pinnedWriteNAligned :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> Fold m a (MutArray a)
1203+ [A] pinnedWriteN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
1204+ [A] pinnedWrite :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
1205+ [A] pinnedNewBytes :: MonadIO m => Int -> m (MutArray a)
1206+ [A] pinnedNewAligned :: (MonadIO m, Unbox a) => Int -> Int -> m (MutArray a)
1207+ [A] pinnedNew :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
1208+ [A] pinnedFromListN :: (MonadIO m, Unbox a) => Int -> [a] -> m (MutArray a)
1209+ [A] pinnedFromList :: (MonadIO m, Unbox a) => [a] -> m (MutArray a)
1210+ [A] pinnedClone :: MonadIO m => MutArray a -> m (MutArray a)
1211+ [A] pinnedChunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)
1212+ [A] pin :: MutArray a -> IO (MutArray a)
1213+ [A] permute :: MutArray a -> m Bool
1214+ [A] partitionBy :: forall m a. (MonadIO m, Unbox a) => (a -> Bool) -> MutArray a -> m (MutArray a, MutArray a)
1215+ [A] nil :: MutArray a
1216+ [A] newIORef :: forall a. Unbox a => a -> IO (IORef a)
1217+ [A] newArrayWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int -> m MutByteArray) -> Int -> Int -> m (MutArray a)
1218+ [A] new :: (MonadIO m, Unbox a) => Int -> m (MutArray a)
1219+ [A] modifyIndices :: forall m a. (MonadIO m, Unbox a) => MutArray a -> (Int -> a -> a) -> Fold m Int ()
1220+ [A] modifyIndexUnsafe :: forall m a b. (MonadIO m, Unbox a) => Int -> MutArray a -> (a -> (a, b)) -> m b
1221+ [A] modifyIndex :: forall m a b. (MonadIO m, Unbox a) => Int -> MutArray a -> (a -> (a, b)) -> m b
1222+ [A] modifyIORef' :: Unbox a => IORef a -> (a -> a) -> IO ()
1223+ [A] modify :: forall m a. (MonadIO m, Unbox a) => MutArray a -> (a -> a) -> m ()
1224+ [A] mergeBy :: Int -> (MutArray a -> MutArray a -> m ()) -> MutArray a -> m ()
1225+ [A] memcpy :: Ptr Word8 -> Ptr Word8 -> Int -> IO ()
1226+ [A] memcmp :: Ptr Word8 -> Ptr Word8 -> Int -> IO Bool
1227+ [A] length :: forall a. Unbox a => MutArray a -> Int
1228+ [A] isPinned :: MutArray a -> Bool
1229+ [A] getSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (MutArray a)
1230+ [A] getSliceUnsafe :: forall a. Unbox a => Int -> Int -> MutArray a -> MutArray a
1231+ [A] getSlice :: forall a. Unbox a => Int -> Int -> MutArray a -> MutArray a
1232+ [A] getIndicesD :: (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m Int -> Unfold m (MutArray a) a
1233+ [A] getIndices :: (MonadIO m, Unbox a) => Stream m Int -> Unfold m (MutArray a) a
1234+ [A] getIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
1235+ [A] getIndexRev :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
1236+ [A] getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (Maybe a)
1237+ [A] genSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (Int, Int)
1238+ [A] fromStreamDN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (MutArray a)
1239+ [A] fromStreamD :: (MonadIO m, Unbox a) => Stream m a -> m (MutArray a)
1240+ [A] fromStream :: (MonadIO m, Unbox a) => Stream m a -> m (MutArray a)
1241+ [A] fromPureStream :: (MonadIO m, Unbox a) => Stream Identity a -> m (MutArray a)
1242+ [A] fromListRevN :: (MonadIO m, Unbox a) => Int -> [a] -> m (MutArray a)
1243+ [A] fromListRev :: (MonadIO m, Unbox a) => [a] -> m (MutArray a)
1244+ [A] fromListN :: (MonadIO m, Unbox a) => Int -> [a] -> m (MutArray a)
1245+ [A] fromList :: (MonadIO m, Unbox a) => [a] -> m (MutArray a)
1246+ [A] fromArrayStreamK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
1247+ [A] foldr :: (MonadIO m, Unbox a) => (a -> b -> b) -> b -> MutArray a -> m b
1248+ [A] foldl' :: (MonadIO m, Unbox a) => (b -> a -> b) -> b -> MutArray a -> m b
1249+ [A] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
1250+ [A] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
1251+ [A] divideBy :: Int -> (MutArray a -> m (MutArray a, MutArray a)) -> MutArray a -> m ()
1252+ [A] cmp :: MonadIO m => MutArray a -> MutArray a -> m Ordering
1253+ [A] clone :: MonadIO m => MutArray a -> m (MutArray a)
1254+ [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (MutArray a)
1255+ [A] castUnsafe :: MutArray a -> MutArray b
1256+ [A] cast :: forall a b. Unbox b => MutArray a -> Maybe (MutArray b)
1257+ [A] c_memchr :: Ptr Word8 -> Word8 -> CSize -> IO (Ptr Word8)
1258+ [A] bytesFree :: MutArray a -> Int
1259+ [A] byteLength :: MutArray a -> Int
1260+ [A] byteCapacity :: MutArray a -> Int
1261+ [A] bubble :: (MonadIO m, Unbox a) => (a -> a -> Ordering) -> MutArray a -> m ()
1262+ [A] breakOn :: MonadIO m => Word8 -> MutArray Word8 -> m (MutArray Word8, Maybe (MutArray Word8))
1263+ [A] blockSize :: Int
1264+ [A] asPtrUnsafe :: MonadIO m => MutArray a -> (Ptr a -> m b) -> m b
1265+ [A] asBytes :: MutArray a -> MutArray Word8
1266+ [A] arrayChunkBytes :: Int
1267+ [A] allocBytesToElemCount :: Unbox a => a -> Int -> Int
1268+[C] Streamly.Internal.Data.IsMap
1269+ [A] mapTraverseWithKey :: (IsMap f, Applicative t) => (Key f -> a -> t b) -> f a -> t (f b)
1270+[R] Streamly.Internal.Data.IORef.Unboxed
1271+[R] Streamly.Internal.Data.Fold.Window
1272+[R] Streamly.Internal.Data.Fold.Type
1273+[R] Streamly.Internal.Data.Fold.Tee
1274+[R] Streamly.Internal.Data.Fold.Step
1275+[R] Streamly.Internal.Data.Fold.Container
1276+[D] Streamly.Internal.Data.Fold.Chunked
1277+[C] Streamly.Internal.Data.Fold
1278+ [A] ManyState
1279+ [C] Fold
1280+ [C] Fold
1281+ [O] Fold :: (s -> a -> m (Step s b)) -> m (Step s b) -> (s -> m b) -> Fold m a b
1282+ [N] Fold :: (s -> a -> m (Step s b)) -> m (Step s b) -> (s -> m b) -> (s -> m b) -> Fold m a b
1283+ [A] windowSumInt :: forall m a. (Monad m, Integral a) => Fold m (a, Maybe a) a
1284+ [A] windowSum :: forall m a. (Monad m, Num a) => Fold m (a, Maybe a) a
1285+ [A] windowRollingMapM :: Monad m => (Maybe a -> a -> m (Maybe b)) -> Fold m (a, Maybe a) (Maybe b)
1286+ [A] windowRollingMap :: Monad m => (Maybe a -> a -> Maybe b) -> Fold m (a, Maybe a) (Maybe b)
1287+ [A] windowRange :: (MonadIO m, Storable a, Ord a) => Int -> Fold m a (Maybe (a, a))
1288+ [A] windowPowerSumFrac :: (Monad m, Floating a) => a -> Fold m (a, Maybe a) a
1289+ [A] windowPowerSum :: (Monad m, Num a) => Int -> Fold m (a, Maybe a) a
1290+ [A] windowMinimum :: (MonadIO m, Storable a, Ord a) => Int -> Fold m a (Maybe a)
1291+ [A] windowMean :: forall m a. (Monad m, Fractional a) => Fold m (a, Maybe a) a
1292+ [A] windowMaximum :: (MonadIO m, Storable a, Ord a) => Int -> Fold m a (Maybe a)
1293+ [A] windowLmap :: (c -> a) -> Fold m (a, Maybe a) b -> Fold m (c, Maybe c) b
1294+ [A] windowLength :: (Monad m, Num b) => Fold m (a, Maybe a) b
1295+ [A] toSet :: (Monad m, Ord a) => Fold m a (Set a)
1296+ [A] toMapIO :: (MonadIO m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (Map k b)
1297+ [A] toMap :: (Monad m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (Map k b)
1298+ [A] toIntSet :: Monad m => Fold m Int IntSet
1299+ [A] toContainerIO :: (MonadIO m, IsMap f, Traversable f, Ord (Key f)) => (a -> Key f) -> Fold m a b -> Fold m a (f b)
1300+ [A] toContainer :: (Monad m, IsMap f, Traversable f, Ord (Key f)) => (a -> Key f) -> Fold m a b -> Fold m a (f b)
1301+ [A] nubInt :: Monad m => Fold m Int (Maybe Int)
1302+ [A] nub :: (Monad m, Ord a) => Fold m a (Maybe a)
1303+ [A] mapMStep :: Applicative m => (a -> m b) -> Step s a -> m (Step s b)
1304+ [A] kvToMap :: (Monad m, Ord k) => Fold m a b -> Fold m (k, a) (Map k b)
1305+ [A] frequency :: (Monad m, Ord a) => Fold m a (Map a Int)
1306+ [A] demuxToMapIO :: (MonadIO m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (Map k b)
1307+ [A] demuxToMap :: (Monad m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (Map k b)
1308+ [A] demuxToContainerIO :: (MonadIO m, IsMap f, Traversable f) => (a -> Key f) -> (a -> m (Fold m a b)) -> Fold m a (f b)
1309+ [A] demuxToContainer :: (Monad m, IsMap f, Traversable f) => (a -> Key f) -> (a -> m (Fold m a b)) -> Fold m a (f b)
1310+ [A] demuxKvToMap :: (Monad m, Ord k) => (k -> m (Fold m a b)) -> Fold m (k, a) (Map k b)
1311+ [A] demuxKvToContainer :: (Monad m, IsMap f, Traversable f) => (Key f -> m (Fold m a b)) -> Fold m (Key f, a) (f b)
1312+ [A] demuxIO :: (MonadIO m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (m (Map k b), Maybe (k, b))
1313+ [A] demuxGenericIO :: (MonadIO m, IsMap f, Traversable f) => (a -> Key f) -> (a -> m (Fold m a b)) -> Fold m a (m (f b), Maybe (Key f, b))
1314+ [A] demuxGeneric :: (Monad m, IsMap f, Traversable f) => (a -> Key f) -> (a -> m (Fold m a b)) -> Fold m a (m (f b), Maybe (Key f, b))
1315+ [A] demux :: (Monad m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (m (Map k b), Maybe (k, b))
1316+ [A] cumulative :: Fold m (a, Maybe a) b -> Fold m a b
1317+ [A] countDistinctInt :: Monad m => Fold m Int Int
1318+ [A] countDistinct :: (Monad m, Ord a) => Fold m a Int
1319+ [A] classifyIO :: (MonadIO m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (m (Map k b), Maybe (k, b))
1320+ [A] classifyGenericIO :: (MonadIO m, IsMap f, Traversable f, Ord (Key f)) => (a -> Key f) -> Fold m a b -> Fold m a (m (f b), Maybe (Key f, b))
1321+ [A] classifyGeneric :: (Monad m, IsMap f, Traversable f, Ord (Key f)) => (a -> Key f) -> Fold m a b -> Fold m a (m (f b), Maybe (Key f, b))
1322+ [A] classify :: (Monad m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (m (Map k b), Maybe (k, b))
1323+ [A] chainStepM :: Applicative m => (s1 -> m s2) -> (a -> m (Step s2 b)) -> Step s1 a -> m (Step s2 b)
1324+[C] Streamly.Internal.Data.Builder
1325+ [C] Builder
1326+ [C] Builder
1327+ [O] Builder :: (s -> m (s, a)) -> Builder s m a
1328+ [N] Builder :: (s -> m (a, s)) -> Builder s m a
1329+[A] Streamly.Internal.Data.Binary.Stream
1330+ [A] class ToBytes a
1331+ [A] word8 :: Applicative m => Word8 -> Stream m Word8
1332+ [A] word64le :: Monad m => Word64 -> Stream m Word8
1333+ [A] word64host :: Monad m => Word64 -> Stream m Word8
1334+ [A] word64be :: Monad m => Word64 -> Stream m Word8
1335+ [A] word32le :: Monad m => Word32 -> Stream m Word8
1336+ [A] word32be :: Monad m => Word32 -> Stream m Word8
1337+ [A] word16le :: Monad m => Word16 -> Stream m Word8
1338+ [A] word16be :: Monad m => Word16 -> Stream m Word8
1339+ [A] unit :: Applicative m => Stream m Word8
1340+ [A] toBytes :: ToBytes a => a -> Stream m Word8
1341+ [A] ordering :: Applicative m => Ordering -> Stream m Word8
1342+ [A] int8 :: Applicative m => Int8 -> Stream m Word8
1343+ [A] int64le :: Monad m => Int64 -> Stream m Word8
1344+ [A] int64be :: Monad m => Int64 -> Stream m Word8
1345+ [A] int32le :: Monad m => Int32 -> Stream m Word8
1346+ [A] int32be :: Monad m => Int32 -> Stream m Word8
1347+ [A] int16le :: Monad m => Int16 -> Stream m Word8
1348+ [A] int16be :: Monad m => Int16 -> Stream m Word8
1349+ [A] float32le :: Monad m => Float -> Stream m Word8
1350+ [A] float32be :: Monad m => Float -> Stream m Word8
1351+ [A] double64le :: Monad m => Double -> Stream m Word8
1352+ [A] double64be :: Monad m => Double -> Stream m Word8
1353+ [A] charUtf8 :: Monad m => Char -> Stream m Word8
1354+ [A] charLatin1 :: Applicative m => Char -> Stream m Word8
1355+ [A] bool :: Applicative m => Bool -> Stream m Word8
1356+[A] Streamly.Internal.Data.Binary.Parser
1357+ [A] class FromBytes a
1358+ [A] word8 :: Monad m => Parser Word8 m Word8
1359+ [A] word64le :: Monad m => Parser Word8 m Word64
1360+ [A] word64host :: MonadIO m => Parser Word8 m Word64
1361+ [A] word64be :: Monad m => Parser Word8 m Word64
1362+ [A] word32le :: Monad m => Parser Word8 m Word32
1363+ [A] word32be :: Monad m => Parser Word8 m Word32
1364+ [A] word16le :: Monad m => Parser Word8 m Word16
1365+ [A] word16be :: Monad m => Parser Word8 m Word16
1366+ [A] unit :: Monad m => Parser Word8 m ()
1367+ [A] ordering :: Monad m => Parser Word8 m Ordering
1368+ [A] int8 :: Monad m => Parser Word8 m Int8
1369+ [A] int64le :: Monad m => Parser Word8 m Int64
1370+ [A] int64be :: Monad m => Parser Word8 m Int64
1371+ [A] int32le :: Monad m => Parser Word8 m Int32
1372+ [A] int32be :: Monad m => Parser Word8 m Int32
1373+ [A] int16le :: Monad m => Parser Word8 m Int16
1374+ [A] int16be :: Monad m => Parser Word8 m Int16
1375+ [A] fromBytes :: FromBytes a => Parser Word8 m a
1376+ [A] float32le :: MonadIO m => Parser Word8 m Float
1377+ [A] float32be :: MonadIO m => Parser Word8 m Float
1378+ [A] eqWord8 :: Monad m => Word8 -> Parser Word8 m Word8
1379+ [A] double64le :: MonadIO m => Parser Word8 m Double
1380+ [A] double64be :: MonadIO m => Parser Word8 m Double
1381+ [A] charLatin1 :: Monad m => Parser Word8 m Char
1382+ [A] bool :: Monad m => Parser Word8 m Bool
1383+[R] Streamly.Internal.Data.Array.Type
1384+[A] Streamly.Internal.Data.Array.Stream
1385+ [A] unlines :: forall m a. (MonadIO m, Unbox a) => a -> Stream m (Array a) -> Stream m a
1386+ [A] toArray :: (MonadIO m, Unbox a) => Stream m (Array a) -> m (Array a)
1387+ [A] splitOnSuffix :: MonadIO m => Word8 -> Stream m (Array Word8) -> Stream m (Array Word8)
1388+ [A] splitOn :: MonadIO m => Word8 -> Stream m (Array Word8) -> Stream m (Array Word8)
1389+ [A] runArrayParserDBreak :: forall m a b. (MonadIO m, Unbox a) => Parser (Array a) m b -> Stream m (Array a) -> m (Either ParseError b, Stream m (Array a))
1390+ [A] runArrayFoldMany :: (Monad m, Unbox a) => ChunkFold m a b -> StreamK m (Array a) -> StreamK m (Either ParseError b)
1391+ [A] runArrayFoldBreak :: (MonadIO m, Unbox a) => ChunkFold m a b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
1392+ [A] runArrayFold :: (MonadIO m, Unbox a) => ChunkFold m a b -> StreamK m (Array a) -> m (Either ParseError b)
1393+ [A] pinnedChunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
1394+ [A] parseChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b)
1395+ [A] parseBreakChunks :: (Monad m, Unbox a) => ParserK (Array a) m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
1396+ [A] parseBreak :: (MonadIO m, Unbox a) => Parser a m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
1397+ [A] lpackArraysChunksOf :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) () -> Fold m (Array a) ()
1398+ [A] interposeSuffix :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
1399+ [A] interpose :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
1400+ [A] intercalateSuffix :: (Monad m, Unbox a) => Array a -> Stream m (Array a) -> Stream m a
1401+ [A] foldBreakD :: forall m a b. (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m (b, Stream m (Array a))
1402+ [A] foldBreak :: (MonadIO m, Unbox a) => Fold m a b -> StreamK m (Array a) -> m (b, StreamK m (Array a))
1403+ [A] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
1404+ [A] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
1405+ [A] concatRev :: (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
1406+ [A] concat :: (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
1407+ [A] compact :: (MonadIO m, Unbox a) => Int -> Stream m (Array a) -> Stream m (Array a)
1408+ [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
1409+ [A] bufferChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
1410+[R] Streamly.Internal.Data.Array.Mut.Type
1411+[R] Streamly.Internal.Data.Array.Mut.Stream
1412+[R] Streamly.Internal.Data.Array.Mut
1413+[R] Streamly.Internal.Data.Array.Generic.Mut.Type
1414+[C] Streamly.Internal.Data.Array.Generic
1415+ [A] getIndex :: Int -> Array a -> Maybe a
1416+ [A] fromPureStream :: Stream Identity a -> Array a
1417+ [A] fromByteStr# :: Addr# -> Array Word8
1418+ [A] chunksOf :: forall m a. MonadIO m => Int -> Stream m a -> Stream m (Array a)
1419+[C] Streamly.Internal.Data.Array
1420+ [A] ArrayUnsafe
1421+ [A] ArrayUnsafe :: {-# UNPACK #-} !MutByteArray -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> ArrayUnsafe a
1422+ [C] Array
1423+ [A] [arrStart] :: Array a -> {-# UNPACK #-} !Int
1424+ [A] [arrEnd] :: Array a -> {-# UNPACK #-} !Int
1425+ [A] [arrContents] :: Array a -> {-# UNPACK #-} !MutByteArray
1426+ [A] Array :: {-# UNPACK #-} !MutByteArray -> {-# UNPACK #-} !Int -> {-# UNPACK #-} !Int -> Array a
1427+ [A] writeWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1428+ [A] writeNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1429+ [R] writeNAligned :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> Fold m a (Array a)
1430+ [A] unsafeMakePure :: Monad m => Fold IO a b -> Fold m a b
1431+ [A] unsafeIndexIO :: forall a. Unbox a => Int -> Array a -> IO a
1432+ [D] unsafeIndex :: forall a. Unbox a => Int -> Array a -> a
1433+ [A] unsafeFreezeWithShrink :: Unbox a => MutArray a -> Array a
1434+ [A] unpin :: Array a -> IO (Array a)
1435+ [A] toStreamKRev :: forall m a. (Monad m, Unbox a) => Array a -> StreamK m a
1436+ [A] toStreamK :: forall m a. (Monad m, Unbox a) => Array a -> StreamK m a
1437+ [A] toStreamDRev :: forall m a. (Monad m, Unbox a) => Array a -> Stream m a
1438+ [A] toStreamD :: forall m a. (Monad m, Unbox a) => Array a -> Stream m a
1439+ [A] splitAt :: Unbox a => Int -> Array a -> (Array a, Array a)
1440+ [A] splice :: (MonadIO m, Unbox a) => Array a -> Array a -> m (Array a)
1441+ [A] serialize :: Serialize a => a -> Array Word8
1442+ [A] pinnedWriteNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1443+ [A] pinnedWriteNAligned :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> Fold m a (Array a)
1444+ [A] pinnedWriteN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1445+ [A] pinnedWrite :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
1446+ [A] pinnedSerialize :: Serialize a => a -> Array Word8
1447+ [A] pinnedFromListN :: Unbox a => Int -> [a] -> Array a
1448+ [A] pinnedFromList :: Unbox a => [a] -> Array a
1449+ [A] pinnedClone :: MonadIO m => Array a -> m (Array a)
1450+ [A] pinnedChunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
1451+ [A] pin :: Array a -> IO (Array a)
1452+ [A] nil :: Array a
1453+ [A] isPinned :: Array a -> Bool
1454+ [A] getIndexUnsafe :: forall a. Unbox a => Int -> Array a -> a
1455+ [A] fromStreamDN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (Array a)
1456+ [A] fromStreamD :: forall m a. (MonadIO m, Unbox a) => Stream m a -> m (Array a)
1457+ [A] fromPureStream :: Unbox a => Stream Identity a -> Array a
1458+ [A] fromListRevN :: Unbox a => Int -> [a] -> Array a
1459+ [A] fromListRev :: Unbox a => [a] -> Array a
1460+ [A] fromByteStr# :: Addr# -> Array Word8
1461+ [A] foldr :: Unbox a => (a -> b -> b) -> b -> Array a -> b
1462+ [A] foldl' :: forall a b. Unbox a => (b -> a -> b) -> b -> Array a -> b
1463+ [A] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
1464+ [A] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
1465+ [A] encodeAs :: forall a. Serialize a => PinnedState -> a -> Array Word8
1466+ [A] deserialize :: Serialize a => Array Word8 -> a
1467+ [A] clone :: MonadIO m => Array a -> m (Array a)
1468+ [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
1469+ [A] byteLength :: Array a -> Int
1470+ [A] bufferChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
1471+ [A] breakOn :: MonadIO m => Word8 -> Array Word8 -> m (Array Word8, Maybe (Array Word8))
core/docs/ApiChangelogs/0.1.0.txtnew file+405
@@ -0,0 +1,405 @@
1+---------------------------------
2+Terminology
3+---------------------------------
4+
5+[A]: Added
6+[R]: Removed
7+[C]: Changed
8+[D]: Deprecated
9+[O]: Old
10+[N]: New
11+
12+---------------------------------
13+Difference
14+---------------------------------
15+
16+The moved modules have been compared with their version in streamly v0.8.3
17+
18+[A] Streamly.Unicode.String
19+ [A] str :: QuasiQuoter
20+[C] Streamly.Unicode.Stream
21+ [C] encodeUtf8'
22+ [O] encodeUtf8' :: (Monad m, IsStream t) => t m Char -> t m Word8
23+ [N] encodeUtf8' :: Monad m => Stream m Char -> Stream m Word8
24+ [C] encodeUtf8
25+ [O] encodeUtf8 :: (Monad m, IsStream t) => t m Char -> t m Word8
26+ [N] encodeUtf8 :: Monad m => Stream m Char -> Stream m Word8
27+ [C] encodeStrings
28+ [O] encodeStrings :: (MonadIO m, IsStream t) => (SerialT m Char -> SerialT m Word8) -> t m String -> t m (Array Word8)
29+ [N] encodeStrings :: MonadIO m => (Stream m Char -> Stream m Word8) -> Stream m String -> Stream m (Array Word8)
30+ [C] encodeLatin1'
31+ [O] encodeLatin1' :: (IsStream t, Monad m) => t m Char -> t m Word8
32+ [N] encodeLatin1' :: Monad m => Stream m Char -> Stream m Word8
33+ [C] encodeLatin1
34+ [O] encodeLatin1 :: (IsStream t, Monad m) => t m Char -> t m Word8
35+ [N] encodeLatin1 :: Monad m => Stream m Char -> Stream m Word8
36+ [A] decodeUtf8Chunks :: MonadIO m => Stream m (Array Word8) -> Stream m Char
37+ [C] decodeUtf8'
38+ [O] decodeUtf8' :: (Monad m, IsStream t) => t m Word8 -> t m Char
39+ [N] decodeUtf8' :: Monad m => Stream m Word8 -> Stream m Char
40+ [C] decodeUtf8
41+ [O] decodeUtf8 :: (Monad m, IsStream t) => t m Word8 -> t m Char
42+ [N] decodeUtf8 :: Monad m => Stream m Word8 -> Stream m Char
43+ [C] decodeLatin1
44+ [O] decodeLatin1 :: (IsStream t, Monad m) => t m Word8 -> t m Char
45+ [N] decodeLatin1 :: Monad m => Stream m Word8 -> Stream m Char
46+[A] Streamly.Unicode.Parser
47+ [A] upper :: Monad m => Parser Char m Char
48+ [A] symbol :: Monad m => Parser Char m Char
49+ [A] stringIgnoreCase :: Monad m => String -> Parser Char m String
50+ [A] string :: Monad m => String -> Parser Char m String
51+ [A] space :: Monad m => Parser Char m Char
52+ [A] signed :: (Num a, Monad m) => Parser Char m a -> Parser Char m a
53+ [A] separator :: Monad m => Parser Char m Char
54+ [A] punctuation :: Monad m => Parser Char m Char
55+ [A] printable :: Monad m => Parser Char m Char
56+ [A] octDigit :: Monad m => Parser Char m Char
57+ [A] numeric :: Monad m => Parser Char m Char
58+ [A] mark :: Monad m => Parser Char m Char
59+ [A] lower :: Monad m => Parser Char m Char
60+ [A] letter :: Monad m => Parser Char m Char
61+ [A] latin1 :: Monad m => Parser Char m Char
62+ [A] hexadecimal :: (Monad m, Integral a, Bits a) => Parser Char m a
63+ [A] hexDigit :: Monad m => Parser Char m Char
64+ [A] dropSpace1 :: Monad m => Parser Char m ()
65+ [A] dropSpace :: Monad m => Parser Char m ()
66+ [A] digit :: Monad m => Parser Char m Char
67+ [A] decimal :: (Monad m, Integral a) => Parser Char m a
68+ [A] charIgnoreCase :: Monad m => Char -> Parser Char m Char
69+ [A] char :: Monad m => Char -> Parser Char m Char
70+ [A] asciiUpper :: Monad m => Parser Char m Char
71+ [A] asciiLower :: Monad m => Parser Char m Char
72+ [A] ascii :: Monad m => Parser Char m Char
73+ [A] alphaNum :: Monad m => Parser Char m Char
74+ [A] alpha :: Monad m => Parser Char m Char
75+[C] Streamly.FileSystem.Handle
76+ [D] writeWithBufferOf :: MonadIO m => Int -> Handle -> Fold m Word8 ()
77+ [A] writeWith :: MonadIO m => Int -> Handle -> Fold m Word8 ()
78+ [C] writeChunks
79+ [O] writeChunks :: (MonadIO m, Storable a) => Handle -> Fold m (Array a) ()
80+ [N] writeChunks :: MonadIO m => Handle -> Fold m (Array a) ()
81+ [A] readerWith :: MonadIO m => Unfold m (Int, Handle) Word8
82+ [A] reader :: MonadIO m => Unfold m Handle Word8
83+ [D] readWithBufferOf :: MonadIO m => Unfold m (Int, Handle) Word8
84+ [D] readChunksWithBufferOf :: MonadIO m => Unfold m (Int, Handle) (Array Word8)
85+ [D] readChunks :: MonadIO m => Unfold m Handle (Array Word8)
86+ [D] read :: MonadIO m => Unfold m Handle Word8
87+ [C] putChunk
88+ [O] putChunk :: (MonadIO m, Storable a) => Handle -> Array a -> m ()
89+ [N] putChunk :: MonadIO m => Handle -> Array a -> m ()
90+ [A] chunkReaderWith :: MonadIO m => Unfold m (Int, Handle) (Array Word8)
91+ [A] chunkReader :: MonadIO m => Unfold m Handle (Array Word8)
92+[A] Streamly.FileSystem.File
93+ [A] writeWith :: (MonadIO m, MonadCatch m) => Int -> FilePath -> Fold m Word8 ()
94+ [A] writeChunks :: (MonadIO m, MonadCatch m) => FilePath -> Fold m (Array a) ()
95+ [A] write :: (MonadIO m, MonadCatch m) => FilePath -> Fold m Word8 ()
96+ [A] withFile :: (MonadIO m, MonadCatch m) => FilePath -> IOMode -> (Handle -> Stream m a) -> Stream m a
97+ [A] readChunksWith :: (MonadIO m, MonadCatch m) => Int -> FilePath -> Stream m (Array Word8)
98+ [A] readChunks :: (MonadIO m, MonadCatch m) => FilePath -> Stream m (Array Word8)
99+ [A] read :: (MonadIO m, MonadCatch m) => FilePath -> Stream m Word8
100+[A] Streamly.FileSystem.Dir
101+ [A] readEither :: MonadIO m => FilePath -> Stream m (Either FilePath FilePath)
102+ [A] read :: MonadIO m => FilePath -> Stream m FilePath
103+[C] Streamly.Data.Unfold
104+ [C] take
105+ [O] take :: Monad m => Int -> Unfold m a b -> Unfold m a b
106+ [N] take :: Applicative m => Int -> Unfold m a b -> Unfold m a b
107+ [C] replicateM
108+ [O] replicateM :: Monad m => Int -> Unfold m (m a) a
109+ [N] replicateM :: Applicative m => Unfold m (Int, m a) a
110+ [C] repeatM
111+ [O] repeatM :: Monad m => Unfold m (m a) a
112+ [N] repeatM :: Applicative m => Unfold m (m a) a
113+ [C] many
114+ [O] many :: Monad m => Unfold m a b -> Unfold m b c -> Unfold m a c
115+ [N] many :: Monad m => Unfold m b c -> Unfold m a b -> Unfold m a c
116+ [C] iterateM
117+ [O] iterateM :: Monad m => (a -> m a) -> Unfold m (m a) a
118+ [N] iterateM :: Applicative m => (a -> m a) -> Unfold m (m a) a
119+ [C] fromStream
120+ [O] fromStream :: (IsStream t, Monad m) => Unfold m (t m a) a
121+ [N] fromStream :: Applicative m => Unfold m (Stream m a) a
122+ [C] fromListM
123+ [O] fromListM :: Monad m => Unfold m [m a] a
124+ [N] fromListM :: Applicative m => Unfold m [m a] a
125+ [C] fromList
126+ [O] fromList :: Monad m => Unfold m [a] a
127+ [N] fromList :: Applicative m => Unfold m [a] a
128+ [C] drop
129+ [O] drop :: Monad m => Int -> Unfold m a b -> Unfold m a b
130+ [N] drop :: Applicative m => Int -> Unfold m a b -> Unfold m a b
131+[A] Streamly.Data.StreamK
132+ [A] StreamK
133+ [A] zipWithM :: Monad m => (a -> b -> m c) -> StreamK m a -> StreamK m b -> StreamK m c
134+ [A] zipWith :: Monad m => (a -> b -> c) -> StreamK m a -> StreamK m b -> StreamK m c
135+ [A] uncons :: Applicative m => StreamK m a -> m (Maybe (a, StreamK m a))
136+ [A] toStream :: Applicative m => StreamK m a -> Stream m a
137+ [A] sortBy :: Monad m => (a -> a -> Ordering) -> StreamK m a -> StreamK m a
138+ [A] reverse :: StreamK m a -> StreamK m a
139+ [A] parseChunks :: (Monad m, Unbox a) => ParserK a m b -> StreamK m (Array a) -> m (Either ParseError b)
140+ [A] parseBreakChunks :: (Monad m, Unbox a) => ParserK a m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
141+ [A] nilM :: Applicative m => m b -> StreamK m a
142+ [A] nil :: StreamK m a
143+ [A] mergeMapWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b
144+ [A] mergeByM :: Monad m => (a -> a -> m Ordering) -> StreamK m a -> StreamK m a -> StreamK m a
145+ [A] mergeBy :: (a -> a -> Ordering) -> StreamK m a -> StreamK m a -> StreamK m a
146+ [A] interleave :: StreamK m a -> StreamK m a -> StreamK m a
147+ [A] fromStream :: Monad m => Stream m a -> StreamK m a
148+ [A] fromPure :: a -> StreamK m a
149+ [A] fromFoldable :: Foldable f => f a -> StreamK m a
150+ [A] fromEffect :: Monad m => m a -> StreamK m a
151+ [A] crossWith :: Monad m => (a -> b -> c) -> StreamK m a -> StreamK m b -> StreamK m c
152+ [A] consM :: Monad m => m a -> StreamK m a -> StreamK m a
153+ [A] cons :: a -> StreamK m a -> StreamK m a
154+ [A] concatMapWith :: (StreamK m b -> StreamK m b -> StreamK m b) -> (a -> StreamK m b) -> StreamK m a -> StreamK m b
155+ [A] concatEffect :: Monad m => m (StreamK m a) -> StreamK m a
156+ [A] append :: StreamK m a -> StreamK m a -> StreamK m a
157+[A] Streamly.Data.Stream
158+ [A] class Enum a => Enumerable a
159+ [A] Stream
160+ [A] zipWithM :: Monad m => (a -> b -> m c) -> Stream m a -> Stream m b -> Stream m c
161+ [A] zipWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
162+ [A] unfoldrM :: Monad m => (s -> m (Maybe (a, s))) -> s -> Stream m a
163+ [A] unfoldr :: Monad m => (s -> Maybe (a, s)) -> s -> Stream m a
164+ [A] unfoldMany :: Monad m => Unfold m a b -> Stream m a -> Stream m b
165+ [A] unfold :: Applicative m => Unfold m a b -> a -> Stream m b
166+ [A] uncons :: Monad m => Stream m a -> m (Maybe (a, Stream m a))
167+ [A] trace :: Monad m => (a -> m b) -> Stream m a -> Stream m a
168+ [A] toList :: Monad m => Stream m a -> m [a]
169+ [A] tap :: Monad m => Fold m a b -> Stream m a -> Stream m a
170+ [A] takeWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
171+ [A] takeWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
172+ [A] take :: Applicative m => Int -> Stream m a -> Stream m a
173+ [A] stripPrefix :: (Monad m, Eq a) => Stream m a -> Stream m a -> m (Maybe (Stream m a))
174+ [A] sequence :: Monad m => Stream m (m a) -> Stream m a
175+ [A] scanMaybe :: Monad m => Fold m a (Maybe b) -> Stream m a -> Stream m b
176+ [A] scan :: Monad m => Fold m a b -> Stream m a -> Stream m b
177+ [A] runStateT :: Monad m => m s -> Stream (StateT s m) a -> Stream m (s, a)
178+ [A] runReaderT :: Monad m => m s -> Stream (ReaderT s m) a -> Stream m a
179+ [A] reverse :: Monad m => Stream m a -> Stream m a
180+ [A] replicateM :: Monad m => Int -> m a -> Stream m a
181+ [A] replicate :: Monad m => Int -> a -> Stream m a
182+ [A] repeatM :: Monad m => m a -> Stream m a
183+ [A] repeat :: Monad m => a -> Stream m a
184+ [A] postscan :: Monad m => Fold m a b -> Stream m a -> Stream m b
185+ [A] parseMany :: Monad m => Parser a m b -> Stream m a -> Stream m (Either ParseError b)
186+ [A] parse :: Monad m => Parser a m b -> Stream m a -> m (Either ParseError b)
187+ [A] onException :: MonadCatch m => m b -> Stream m a -> Stream m a
188+ [A] nilM :: Applicative m => m b -> Stream m a
189+ [A] nil :: Applicative m => Stream m a
190+ [A] morphInner :: Monad n => (forall x. m x -> n x) -> Stream m a -> Stream n a
191+ [A] mergeByM :: Monad m => (a -> a -> m Ordering) -> Stream m a -> Stream m a -> Stream m a
192+ [A] mergeBy :: Monad m => (a -> a -> Ordering) -> Stream m a -> Stream m a -> Stream m a
193+ [A] mapMaybeM :: Monad m => (a -> m (Maybe b)) -> Stream m a -> Stream m b
194+ [A] mapMaybe :: Monad m => (a -> Maybe b) -> Stream m a -> Stream m b
195+ [A] mapM :: Monad m => (a -> m b) -> Stream m a -> Stream m b
196+ [A] liftInner :: (Monad m, MonadTrans t, Monad (t m)) => Stream m a -> Stream (t m) a
197+ [A] iterateM :: Monad m => (a -> m a) -> m a -> Stream m a
198+ [A] iterate :: Monad m => (a -> a) -> a -> Stream m a
199+ [A] isSubsequenceOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
200+ [A] isPrefixOf :: (Monad m, Eq a) => Stream m a -> Stream m a -> m Bool
201+ [A] intersperseM_ :: Monad m => m b -> Stream m a -> Stream m a
202+ [A] intersperseM :: Monad m => m a -> Stream m a -> Stream m a
203+ [A] intersperse :: Monad m => a -> Stream m a -> Stream m a
204+ [A] interleave :: Monad m => Stream m a -> Stream m a -> Stream m a
205+ [A] intercalateSuffix :: Monad m => Unfold m b c -> b -> Stream m b -> Stream m c
206+ [A] intercalate :: Monad m => Unfold m b c -> b -> Stream m b -> Stream m c
207+ [A] insertBy :: Monad m => (a -> a -> Ordering) -> a -> Stream m a -> Stream m a
208+ [A] indexed :: Monad m => Stream m a -> Stream m (Int, a)
209+ [A] handle :: (MonadCatch m, Exception e) => (e -> Stream m a) -> Stream m a -> Stream m a
210+ [A] fromPure :: Applicative m => a -> Stream m a
211+ [A] fromList :: Applicative m => [a] -> Stream m a
212+ [A] fromEffect :: Applicative m => m a -> Stream m a
213+ [A] foldrM :: Monad m => (a -> m b -> m b) -> m b -> Stream m a -> m b
214+ [A] foldr :: Monad m => (a -> b -> b) -> b -> Stream m a -> m b
215+ [A] foldMany :: Monad m => Fold m a b -> Stream m a -> Stream m b
216+ [A] foldBreak :: Monad m => Fold m a b -> Stream m a -> m (b, Stream m a)
217+ [A] fold :: Monad m => Fold m a b -> Stream m a -> m b
218+ [A] finallyIO :: (MonadIO m, MonadCatch m) => IO b -> Stream m a -> Stream m a
219+ [A] filterM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
220+ [A] filter :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
221+ [A] eqBy :: Monad m => (a -> b -> Bool) -> Stream m a -> Stream m b -> m Bool
222+ [A] enumerateTo :: (Monad m, Bounded a, Enumerable a) => a -> Stream m a
223+ [A] enumerateFromTo :: (Enumerable a, Monad m) => a -> a -> Stream m a
224+ [A] enumerateFromThenTo :: (Enumerable a, Monad m) => a -> a -> a -> Stream m a
225+ [A] enumerateFromThen :: (Enumerable a, Monad m) => a -> a -> Stream m a
226+ [A] enumerateFrom :: (Enumerable a, Monad m) => a -> Stream m a
227+ [A] enumerate :: (Monad m, Bounded a, Enumerable a) => Stream m a
228+ [A] dropWhileM :: Monad m => (a -> m Bool) -> Stream m a -> Stream m a
229+ [A] dropWhile :: Monad m => (a -> Bool) -> Stream m a -> Stream m a
230+ [A] drop :: Monad m => Int -> Stream m a -> Stream m a
231+ [A] delay :: MonadIO m => Double -> Stream m a -> Stream m a
232+ [A] crossWith :: Monad m => (a -> b -> c) -> Stream m a -> Stream m b -> Stream m c
233+ [A] consM :: Applicative m => m a -> Stream m a -> Stream m a
234+ [A] cons :: Applicative m => a -> Stream m a -> Stream m a
235+ [A] concatMapM :: Monad m => (a -> m (Stream m b)) -> Stream m a -> Stream m b
236+ [A] concatMap :: Monad m => (a -> Stream m b) -> Stream m a -> Stream m b
237+ [A] concatEffect :: Monad m => m (Stream m a) -> Stream m a
238+ [A] cmpBy :: Monad m => (a -> b -> Ordering) -> Stream m a -> Stream m b -> m Ordering
239+ [A] chunksOf :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> Stream m (Array a)
240+ [A] catRights :: Monad m => Stream m (Either a b) -> Stream m b
241+ [A] catMaybes :: Monad m => Stream m (Maybe a) -> Stream m a
242+ [A] catLefts :: Monad m => Stream m (Either a b) -> Stream m a
243+ [A] catEithers :: Monad m => Stream m (Either a a) -> Stream m a
244+ [A] bracketIO3 :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> IO d) -> (b -> IO e) -> (b -> Stream m a) -> Stream m a
245+ [A] bracketIO :: (MonadIO m, MonadCatch m) => IO b -> (b -> IO c) -> (b -> Stream m a) -> Stream m a
246+ [A] before :: Monad m => m b -> Stream m a -> Stream m a
247+ [A] append :: Monad m => Stream m a -> Stream m a -> Stream m a
248+ [A] afterIO :: MonadIO m => IO b -> Stream m a -> Stream m a
249+[A] Streamly.Data.ParserK
250+ [A] ParserK
251+ [A] fromPure :: b -> ParserK a m b
252+ [A] fromParser :: (Monad m, Unbox a) => Parser a m b -> ParserK a m b
253+ [A] fromFold :: (MonadIO m, Unbox a) => Fold m a b -> ParserK a m b
254+ [A] fromEffect :: Monad m => m b -> ParserK a m b
255+ [A] die :: String -> ParserK a m b
256+[A] Streamly.Data.Parser
257+ [A] Parser
258+ [A] wordWithQuotes :: (Monad m, Eq a) => Bool -> (a -> a -> Maybe a) -> a -> (a -> Maybe a) -> (a -> Bool) -> Fold m a b -> Parser a m b
259+ [A] wordBy :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
260+ [A] takeWhile1 :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
261+ [A] takeWhile :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
262+ [A] takeEQ :: Monad m => Int -> Fold m a b -> Parser a m b
263+ [A] streamEqBy :: Monad m => (a -> a -> Bool) -> Stream m a -> Parser a m ()
264+ [A] some :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
265+ [A] satisfy :: Monad m => (a -> Bool) -> Parser a m a
266+ [A] rmapM :: Monad m => (b -> m c) -> Parser a m b -> Parser a m c
267+ [A] peek :: Monad m => Parser a m a
268+ [A] oneOf :: (Monad m, Eq a, Foldable f) => f a -> Parser a m a
269+ [A] one :: Monad m => Parser a m a
270+ [A] noneOf :: (Monad m, Eq a, Foldable f) => f a -> Parser a m a
271+ [A] manyTill :: Monad m => Parser a m b -> Parser a m x -> Fold m b c -> Parser a m c
272+ [A] many :: Monad m => Parser a m b -> Fold m b c -> Parser a m c
273+ [A] lookAhead :: Monad m => Parser a m b -> Parser a m b
274+ [A] lmapM :: Monad m => (a -> m b) -> Parser b m r -> Parser a m r
275+ [A] lmap :: (a -> b) -> Parser b m r -> Parser a m r
276+ [A] listEqBy :: Monad m => (a -> a -> Bool) -> [a] -> Parser a m [a]
277+ [A] listEq :: (Monad m, Eq a) => [a] -> Parser a m [a]
278+ [A] groupBy :: Monad m => (a -> a -> Bool) -> Fold m a b -> Parser a m b
279+ [A] fromPure :: Monad m => b -> Parser a m b
280+ [A] fromFold :: Monad m => Fold m a b -> Parser a m b
281+ [A] fromEffect :: Monad m => m b -> Parser a m b
282+ [A] filter :: Monad m => (a -> Bool) -> Parser a m b -> Parser a m b
283+ [A] eof :: Monad m => Parser a m ()
284+ [A] dropWhile :: Monad m => (a -> Bool) -> Parser a m ()
285+ [A] die :: Monad m => String -> Parser a m b
286+ [A] deintercalate :: Monad m => Parser a m x -> Parser a m y -> Fold m (Either x y) z -> Parser a m z
287+[A] Streamly.Data.MutArray.Generic
288+ [A] MutArray
289+ [A] writeN :: MonadIO m => Int -> Fold m a (MutArray a)
290+ [A] toList :: MonadIO m => MutArray a -> m [a]
291+ [A] snoc :: MonadIO m => MutArray a -> a -> m (MutArray a)
292+ [A] reader :: MonadIO m => Unfold m (MutArray a) a
293+ [A] putIndex :: MonadIO m => Int -> MutArray a -> a -> m ()
294+ [A] new :: forall m a. MonadIO m => Int -> m (MutArray a)
295+ [A] modifyIndex :: MonadIO m => Int -> MutArray a -> (a -> (a, b)) -> m b
296+ [A] getIndex :: MonadIO m => Int -> MutArray a -> m a
297+[A] Streamly.Data.MutArray
298+ [A] class Unbox a
299+ [A] MutArray
300+ [A] writeN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
301+ [A] writeAppendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
302+ [A] writeAppend :: forall m a. (MonadIO m, Unbox a) => m (MutArray a) -> Fold m a (MutArray a)
303+ [A] write :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
304+ [A] toList :: forall m a. (MonadIO m, Unbox a) => MutArray a -> m [a]
305+ [A] snoc :: forall m a. (MonadIO m, Unbox a) => MutArray a -> a -> m (MutArray a)
306+ [A] sizeOf :: (Unbox a, SizeOfRep (Rep a)) => Proxy a -> Int
307+ [A] readerRev :: forall m a. (MonadIO m, Unbox a) => Unfold m (MutArray a) a
308+ [A] reader :: forall m a. (MonadIO m, Unbox a) => Unfold m (MutArray a) a
309+ [A] putIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> a -> m ()
310+ [A] pokeByteIndex :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutableByteArray -> a -> IO ()
311+ [A] peekByteIndex :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutableByteArray -> IO a
312+ [A] newPinned :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
313+ [A] new :: (MonadIO m, Unbox a) => Int -> m (MutArray a)
314+ [A] length :: forall a. Unbox a => MutArray a -> Int
315+ [A] getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m a
316+ [A] fromListN :: (MonadIO m, Unbox a) => Int -> [a] -> m (MutArray a)
317+ [A] fromList :: (MonadIO m, Unbox a) => [a] -> m (MutArray a)
318+ [A] cast :: forall a b. Unbox b => MutArray a -> Maybe (MutArray b)
319+ [A] asBytes :: MutArray a -> MutArray Word8
320+[C] Streamly.Data.Fold
321+ [A] Tee
322+ [A] [unTee] :: Tee m a b -> Fold m a b
323+ [A] Tee :: Fold m a b -> Tee m a b
324+ [D] variance :: (Monad m, Fractional a) => Fold m a a
325+ [A] uniqBy :: Monad m => (a -> a -> Bool) -> Fold m a (Maybe a)
326+ [A] topBy :: (MonadIO m, Unbox a) => (a -> a -> Ordering) -> Int -> Fold m a (MutArray a)
327+ [A] toSet :: (Monad m, Ord a) => Fold m a (Set a)
328+ [A] toMapIO :: (MonadIO m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (Map k b)
329+ [A] toMap :: (Monad m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (Map k b)
330+ [A] toIntSet :: Monad m => Fold m Int IntSet
331+ [A] the :: (Monad m, Eq a) => Fold m a (Maybe a)
332+ [D] stdDev :: (Monad m, Floating a) => Fold m a a
333+ [A] splitWith :: Monad m => (a -> b -> c) -> Fold m x a -> Fold m x b -> Fold m x c
334+ [D] serialWith :: Monad m => (a -> b -> c) -> Fold m x a -> Fold m x b -> Fold m x c
335+ [A] scanMaybe :: Monad m => Fold m a (Maybe b) -> Fold m b c -> Fold m a c
336+ [A] scan :: Monad m => Fold m a b -> Fold m b c -> Fold m a c
337+ [A] postscan :: Monad m => Fold m a b -> Fold m b c -> Fold m a c
338+ [A] one :: Monad m => Fold m a (Maybe a)
339+ [A] nubInt :: Monad m => Fold m Int (Maybe Int)
340+ [A] nub :: (Monad m, Ord a) => Fold m a (Maybe a)
341+ [A] morphInner :: (forall x. m x -> n x) -> Fold m a b -> Fold n a b
342+ [A] latest :: Monad m => Fold m a (Maybe a)
343+ [D] last :: Monad m => Fold m a (Maybe a)
344+ [D] head :: Monad m => Fold m a (Maybe a)
345+ [A] groupsOf :: Monad m => Int -> Fold m a b -> Fold m b c -> Fold m a c
346+ [A] frequency :: (Monad m, Ord a) => Fold m a (Map a Int)
347+ [A] foldr' :: Monad m => (a -> b -> b) -> b -> Fold m a b
348+ [D] foldr :: Monad m => (a -> b -> b) -> b -> Fold m a b
349+ [A] foldlM1' :: Monad m => (a -> a -> m a) -> Fold m a (Maybe a)
350+ [A] foldl1' :: Monad m => (a -> a -> a) -> Fold m a (Maybe a)
351+ [A] findM :: Monad m => (a -> m Bool) -> Fold m a (Maybe a)
352+ [A] findIndices :: Monad m => (a -> Bool) -> Fold m a (Maybe Int)
353+ [A] elemIndices :: (Monad m, Eq a) => a -> Fold m a (Maybe Int)
354+ [A] duplicate :: Monad m => Fold m a b -> Fold m a (Fold m a b)
355+ [A] drive :: Monad m => Stream m a -> Fold m a b -> m b
356+ [A] drainMapM :: Monad m => (a -> m b) -> Fold m a ()
357+ [D] drainBy :: Monad m => (a -> m b) -> Fold m a ()
358+ [A] demuxToMapIO :: (MonadIO m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (Map k b)
359+ [A] demuxToMap :: (Monad m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (Map k b)
360+ [A] demuxIO :: (MonadIO m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (m (Map k b), Maybe (k, b))
361+ [A] demux :: (Monad m, Ord k) => (a -> k) -> (a -> m (Fold m a b)) -> Fold m a (m (Map k b), Maybe (k, b))
362+ [A] deleteBy :: Monad m => (a -> a -> Bool) -> a -> Fold m a (Maybe a)
363+ [A] countDistinctInt :: Monad m => Fold m Int Int
364+ [A] countDistinct :: (Monad m, Ord a) => Fold m a Int
365+ [A] classifyIO :: (MonadIO m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (m (Map k b), Maybe (k, b))
366+ [A] classify :: (Monad m, Ord k) => (a -> k) -> Fold m a b -> Fold m a (m (Map k b), Maybe (k, b))
367+ [D] chunksOf :: Monad m => Int -> Fold m a b -> Fold m b c -> Fold m a c
368+ [A] catRights :: Monad m => Fold m b c -> Fold m (Either a b) c
369+ [A] catLefts :: Monad m => Fold m a c -> Fold m (Either a b) c
370+ [A] catEithers :: Fold m a b -> Fold m (Either a a) b
371+ [A] addStream :: Monad m => Stream m a -> Fold m a b -> m (Fold m a b)
372+ [A] addOne :: Monad m => a -> Fold m a b -> m (Fold m a b)
373+[A] Streamly.Data.Array.Generic
374+ [A] Array
375+ [A] writeN :: MonadIO m => Int -> Fold m a (Array a)
376+ [A] write :: MonadIO m => Fold m a (Array a)
377+ [A] reader :: Monad m => Unfold m (Array a) a
378+ [A] readRev :: Monad m => Array a -> Stream m a
379+ [A] read :: MonadIO m => Array a -> Stream m a
380+ [A] length :: Array a -> Int
381+ [A] fromListN :: Int -> [a] -> Array a
382+ [A] fromList :: [a] -> Array a
383+[A] Streamly.Data.Array
384+ [A] class Unbox a
385+ [A] Array
386+ [A] writeN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
387+ [A] writeLastN :: (Storable a, Unbox a, MonadIO m) => Int -> Fold m a (Array a)
388+ [A] write :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
389+ [A] toList :: Unbox a => Array a -> [a]
390+ [A] sizeOf :: (Unbox a, SizeOfRep (Rep a)) => Proxy a -> Int
391+ [A] readerRev :: forall m a. (Monad m, Unbox a) => Unfold m (Array a) a
392+ [A] reader :: forall m a. (Monad m, Unbox a) => Unfold m (Array a) a
393+ [A] pokeByteIndex :: (Unbox a, Generic a, PokeRep (Rep a)) => Int -> MutableByteArray -> a -> IO ()
394+ [A] peekByteIndex :: (Unbox a, Generic a, PeekRep (Rep a)) => Int -> MutableByteArray -> IO a
395+ [A] length :: Unbox a => Array a -> Int
396+ [A] getIndex :: forall a. Unbox a => Int -> Array a -> Maybe a
397+ [A] fromListN :: Unbox a => Int -> [a] -> Array a
398+ [A] fromList :: Unbox a => [a] -> Array a
399+ [A] cast :: forall a b. Unbox b => Array a -> Maybe (Array b)
400+ [A] asBytes :: Array a -> Array Word8
401+[C] Streamly.Console.Stdio
402+ [A] reader :: MonadIO m => Unfold m () Word8
403+ [D] readChunks :: MonadIO m => Unfold m () (Array Word8)
404+ [D] read :: MonadIO m => Unfold m () Word8
405+ [A] chunkReader :: MonadIO m => Unfold m () (Array Word8)
core/docs/ApiChangelogs/0.2.0-0.2.2.txtnew file+306

This diff is too big to show here.

core/docs/Changelog.mdnew file+97

This diff is too big to show here.

core/docs/Readme.mdnew file+1

This diff is too big to show here.

core/src/DocTestDataArray.hsnew file+22

This diff is too big to show here.

core/src/DocTestDataFold.hsnew file+27

This diff is too big to show here.

core/src/DocTestDataMutArray.hsnew file+10

This diff is too big to show here.

core/src/DocTestDataMutArrayGeneric.hsnew file+10

This diff is too big to show here.

core/src/DocTestDataParser.hsnew file+20

This diff is too big to show here.

core/src/DocTestDataParserK.hsnew file+15

This diff is too big to show here.

core/src/DocTestDataStream.hsnew file+39

This diff is too big to show here.

core/src/DocTestDataStreamK.hsnew file+21

This diff is too big to show here.

core/src/DocTestDataUnfold.hsnew file+12

This diff is too big to show here.

core/src/DocTestFileSystemHandle.hsnew file+15

This diff is too big to show here.

core/src/DocTestUnicodeParser.hsnew file+9

This diff is too big to show here.

core/src/DocTestUnicodeStream.hsnew file+12

This diff is too big to show here.

core/src/DocTestUnicodeString.hsnew file+5

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Data/Array.hsnew file+167

This diff is too big to show here.

core/src/Streamly/Data/Array/Generic.hsnew file+51

This diff is too big to show here.

core/src/Streamly/Data/Fold.hs+195−69

This diff is too big to show here.

core/src/Streamly/Data/Fold/Tee.hsdeleted−41

This diff is too big to show here.

core/src/Streamly/Data/MutArray.hsnew file+110

This diff is too big to show here.

core/src/Streamly/Data/MutArray/Generic.hsnew file+70

This diff is too big to show here.

core/src/Streamly/Data/MutByteArray.hsnew file+106

This diff is too big to show here.

core/src/Streamly/Data/Parser.hsnew file+247

This diff is too big to show here.

core/src/Streamly/Data/ParserK.hsnew file+139

This diff is too big to show here.

core/src/Streamly/Data/Stream.hsnew file+746

This diff is too big to show here.

core/src/Streamly/Data/StreamK.hsnew file+194

This diff is too big to show here.

core/src/Streamly/Data/Unfold.hsnew file+233

This diff is too big to show here.

core/src/Streamly/FileSystem/Dir.hsnew file+23

This diff is too big to show here.

core/src/Streamly/FileSystem/File.hsnew file+60

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Control/Exception.hs+1−13

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array.hs+945−261

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/ArrayMacros.h+24−8

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Foreign.hsdeleted−581

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Foreign/Mut.hsdeleted−103

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Foreign/Mut/Type.hsdeleted−2365

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Foreign/Type.hsdeleted−823

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Generic.hsnew file+342

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Mut/Type.hsdeleted−570

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Stream.hsnew file+725

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Stream/Mut/Foreign.hsdeleted−326

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Container.hsnew file+783

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Type.hs+850−298

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Window.hs+148−144

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/IORef/Prim.hs → core/src/Streamly/Internal/Data/IORef/Unboxed.hsrenamed+36−35

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/List.hs+115−66

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser.hs+3017−577

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/ParserD/Type.hs → core/src/Streamly/Internal/Data/Parser/Type.hsrenamed+544−493

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Ring/Foreign.hsdeleted−561

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream.hsnew file+42

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Common.hsdeleted−161

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Exception.hs → core/src/Streamly/Internal/Data/Stream/Exception.hsrenamed+197−120

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Instances.hsdeleted−171

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Serial.hsdeleted−343

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamK/Type.hsdeleted−1317

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Top.hsnew file+480

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/WSerial.hsdeleted−249

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Clock/Type.hsc+1−1

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold.hs+198−327

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold/Type.hs+284−64

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/FileSystem/File.hs → core/src/Streamly/Internal/FileSystem/File.hsrenamed+204−137

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Handle.hs → core/src/Streamly/Internal/FileSystem/Handle.hsrenamed+160−216

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Foreign/Malloc.hsdeleted−49

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Array.hsnew file+104

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Unicode/Stream.hs → core/src/Streamly/Internal/Unicode/Stream.hsrenamed+261−227

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/String.hsnew file+158

This diff is too big to show here.

core/src/Streamly/Unicode/Parser.hsnew file+69

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Unicode/String.hsnew file+30

This diff is too big to show here.

core/src/assert.hsnew file+6

This diff is too big to show here.

core/src/inline.hs+2−2

This diff is too big to show here.

core/streamly-core.cabal+310−122

This diff is too big to show here.

default.nix+16−7

This diff is too big to show here.

docs/Developer/Benchmarks.md+60−39

This diff is too big to show here.

docs/Developer/Contributing.md+1−2

This diff is too big to show here.

docs/Developer/Github.linknew file+1

This diff is too big to show here.

docs/Developer/MAINTAINING.md+42−18

This diff is too big to show here.

docs/Developer/Tests.md+2−2

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/Developer/paths.rst+25−2

This diff is too big to show here.

docs/Documentation.mdnew file+5

This diff is too big to show here.

docs/User/Explanation/Overview.md → docs/User/Explanatory/Overview.mdrenamed

The content is the same.

docs/User/Explanatory/design.mdnew file+42

This diff is too big to show here.

docs/User/Explanation/monad-transformers.md → docs/User/Explanatory/monad-transformers.mdrenamed

The content is the same.

docs/User/ProjectRelated/performance.md → docs/User/Explanatory/performance.mdrenamed

The content is the same.

docs/User/Explanation/streaming-pradigms.rst → docs/User/Explanatory/streaming-pradigms.rstrenamed

The content is the same.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/HowTo/Examples.linknew file+1

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Project/ApiChangelogs/0.8.3-0.9.0.txtnew file+175

This diff is too big to show here.

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

The content is the same.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/ProjectRelated/Changelog.md → docs/User/Project/Changelog.mdrenamed+126−9

This diff is too big to show here.

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

The content is the same.

docs/User/Project/Github.linknew file+1

This diff is too big to show here.

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

This diff is too big to show here.

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

The content is the same.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Tutorials/Examples.linknew file+1

This diff is too big to show here.

docs/User/Tutorials/Introduction.mddeleted−651

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/ProjectRelated/resources.md → docs/User/resources.mdrenamed

The content is the same.

docs/streamly-docs.cabal+14−7

This diff is too big to show here.

hie.yaml+62−32

This diff is too big to show here.

src/Streamly.hsdeleted−623

This diff is too big to show here.

src/Streamly/Data/Array.hsdeleted−43

This diff is too big to show here.

core/src/Streamly/Data/Array/Foreign.hs → src/Streamly/Data/Array/Foreign.hsrenamed+44−3

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Data/Fold/Tee.hsnew file+16

This diff is too big to show here.

src/Streamly/Data/Prim/Array.hsdeleted−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.hsnew file+115

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Data/Unfold.hsdeleted−165

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim.hsdeleted−110

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Mut/Type.hsdeleted−94

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/MutTypesInclude.hsdeleted−413

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Pinned.hsdeleted−108

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Pinned/Mut/Type.hsdeleted−176

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Pinned/Type.hsdeleted−127

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/Type.hsdeleted−98

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Prim/TypesInclude.hsdeleted−706

This diff is too big to show here.

src/Streamly/Internal/Data/Array/PrimInclude.hsdeleted−184

This diff is too big to show here.

src/Streamly/Internal/Data/Array/Stream/Foreign.hsdeleted−859

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Channel/Dispatcher.hsnew file+294

This diff is too big to show here.

src/Streamly/Internal/Data/Channel/Types.hsnew file+817

This diff is too big to show here.

src/Streamly/Internal/Data/Channel/Worker.hsnew file+375

This diff is too big to show here.

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

The content is the same.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent.hsnew file+57

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent/Channel.hsnew file+112

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent/Channel/Type.hsnew file+331

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/IOFinalizer/Lifted.hsnew file+74

This diff is too big to show here.

src/Streamly/Internal/Data/IsMap/HashMap.hsnew file+42

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/SmallArray.hs+26−25

This diff is too big to show here.

src/Streamly/Internal/Data/SmallArray/Type.hs−3

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Ahead.hs+37−12

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async.hs+50−16

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Common.hsnew file+105

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent.hsnew file+903

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel.hsnew file+109

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Append.hsnew file+1046

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Consumer.hsnew file+127

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Dispatcher.hsnew file+417

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Interleave.hsnew file+252

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Operations.hsnew file+294

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent/Channel/Type.hsnew file+172

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Common.hs+75−53

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs+71−82

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Generate.hs+32−55

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Reduce.hs+81−68

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Top.hs+88−37

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Type.hs+67−72

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Lifted.hsnew file+335

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Parallel.hs+60−32

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Serial.hsnew file+456

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Time.hsnew file+950

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Zip.hs → src/Streamly/Internal/Data/Stream/Zip.hsrenamed+55−5

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/ZipAsync.hs+14−11

This diff is too big to show here.

src/Streamly/Internal/Data/Unfold/Exception.hsnew file+214

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Darwin.hs+69−76

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Linux.hs+105−106

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Windows.hs+64−61

This diff is too big to show here.

src/Streamly/Internal/FileSystem/FD.hs+70−62

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Network/Socket.hs+143−247

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Unicode/Array/Char.hsdeleted−92

This diff is too big to show here.

src/Streamly/Internal/Unicode/Array/Prim/Pinned.hsdeleted−91

This diff is too big to show here.

src/Streamly/Internal/Unicode/Char.hs+21−12

This diff is too big to show here.

src/Streamly/Internal/Unicode/Char/Parser.hsdeleted−214

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Memory/Array.hsdeleted−74

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Prelude.hs+14−6

This diff is too big to show here.

src/assert.hsnew file+6

This diff is too big to show here.

src/inline.hs+2−2

This diff is too big to show here.

stack.yaml+2−2

This diff is too big to show here.

streamly.cabal+233−363

This diff is too big to show here.

targets/Targets.hsnew file+213

This diff is too big to show here.

benchmark/bench-report/cabal.project → targets/cabal.projectrenamed

The content is the same.

targets/default.nixnew file+163

This diff is too big to show here.

targets/streamly-targets.cabalnew file+12

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Array/Foreign.hsdeleted−213

This diff is too big to show here.

test/Streamly/Test/Data/Array/Prim/Pinned.hs → test/Streamly/Test/Data/Array/Generic.hsrenamed+22−12

This diff is too big to show here.

test/Streamly/Test/Data/Array/Prim.hsdeleted−55

This diff is too big to show here.

test/Streamly/Test/Data/Array/Stream.hsnew file+113

This diff is too big to show here.

test/Streamly/Test/Data/Array/Stream/Foreign.hsdeleted−72

This diff is too big to show here.

test/Streamly/Test/Data/Fold.hs+175−102

This diff is too big to show here.

test/Streamly/Test/Data/Fold/Window.hs+21−20

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/MutArray.hsnew file+152

This diff is too big to show here.

test/Streamly/Test/Data/Parser.hs+763−193

This diff is too big to show here.

test/Streamly/Test/Data/Parser/ParserD.hs → test/Streamly/Test/Data/ParserK.hsrenamed+155−91

This diff is too big to show here.

test/Streamly/Test/Data/Ring/Unboxed.hsnew file+53

This diff is too big to show here.

test/Streamly/Test/Data/Serialize.hsnew file+306

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Stream/Concurrent.hsnew file+363

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Unfold.hs+15−22

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Prelude.hs+2

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Prelude/Serial.hs+157−118

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/streamly-tests.cabal+190−41

This diff is too big to show here.

test/test-runner/Main.hsnew file+33

This diff is too big to show here.

test/test-runner/cabal.projectnew file+4

This diff is too big to show here.

test/test-runner/default.nixnew file+164

This diff is too big to show here.

test/test-runner/test-runner.cabalnew file+41

This diff is too big to show here.