git.iko.soy/streamly
on master help sign in
swap
30c5a56963 ahead, 0 behind
418 files changed+58690−37526
since splitsnapshots
unifiedsplit
.circleci/config.yml+74−277 .github/workflows/haskell.yml+116−94 .github/workflows/regression-check.yml+40−29 .hlint.ignore+10−3 .hlint.yaml+2−4 .packcheck.ignore+2−1 CHANGELOG.md+1−1 LICENSE−254 README.md+1−1 appveyor.yml+2 benchmark/NanoBenchmarks.hs+5−3 benchmark/Streamly/Benchmark/Data/Array.hs+33−4 benchmark/Streamly/Benchmark/Data/Array/Common.hs+7−7 benchmark/Streamly/Benchmark/Data/Array/CommonImports.hs+5−4 benchmark/Streamly/Benchmark/Data/Array/Unboxed.hs → benchmark/Streamly/Benchmark/Data/Array/Generic.hs+15−28 benchmark/Streamly/Benchmark/Data/Array/SmallArray.hs+2 benchmark/Streamly/Benchmark/Data/Array/Stream/Foreign.hs → benchmark/Streamly/Benchmark/Data/Array/Stream.hs+53−41 benchmark/Streamly/Benchmark/Data/Fold.hs+109−73 benchmark/Streamly/Benchmark/Data/Fold/Window.hs+76−58 benchmark/Streamly/Benchmark/Data/Array/Unboxed/Mut.hs → benchmark/Streamly/Benchmark/Data/MutArray.hs+23−17 benchmark/Streamly/Benchmark/Data/Parser.hs+497−150 benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs−445 benchmark/Streamly/Benchmark/Data/Parser/ParserK.hs−162 benchmark/Streamly/Benchmark/Data/ParserK.hs+437 benchmark/Streamly/Benchmark/Data/Ring/Unboxed.hs+3−4 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+57 benchmark/Streamly/Benchmark/Data/Stream/Async.hs−224 benchmark/Streamly/Benchmark/Data/Stream/Common.hs+133−66 benchmark/Streamly/Benchmark/Data/Stream/Concurrent.hs+20 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentCommon.hs+208 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentEager.hs+25 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentInterleaved.hs+25 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentOrdered.hs+25 benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hs+71−41 benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hs+63−38 benchmark/Streamly/Benchmark/Data/Stream/Expand.hs+161−114 benchmark/Streamly/Benchmark/Data/Stream/Generate.hs+56−25 benchmark/Streamly/Benchmark/Data/Stream/Lift.hs+38−33 benchmark/Streamly/Benchmark/Data/Stream/Reduce.hs+169−119 benchmark/Streamly/Benchmark/Data/Stream/Split.hs+9−6 benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+38−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/Data/Stream/Transform.hs+153−31 benchmark/Streamly/Benchmark/Data/Unfold.hs+25−15 benchmark/Streamly/Benchmark/FileSystem/Handle.hs+1−1 benchmark/Streamly/Benchmark/FileSystem/Handle/Read.hs+59−51 benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+23−22 benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+11−6 benchmark/Streamly/Benchmark/Prelude/Ahead.hs+3−1 benchmark/Streamly/Benchmark/Prelude/Async.hs+3−1 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/WAsync.hs+3−1 benchmark/Streamly/Benchmark/Prelude/WSerial.hs+4−2 benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+3−1 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+58−31 benchmark/Streamly/Benchmark/Unicode/Utf8.hs+3−3 benchmark/bench-runner/Main.hs+88−39 benchmark/bench-runner/cabal.project+3 benchmark/bench-runner/default.nix+1−1 benchmark/lib/Streamly/Benchmark/Common.hs+1−1 benchmark/lib/Streamly/Benchmark/Common/Handle.hs+3−1 benchmark/lib/Streamly/Benchmark/Prelude.hs+3−1 benchmark/streamly-benchmarks.cabal+297−152 bin/mk-hscope.sh+1−1 bin/run-ci.sh+1−1 bin/run-repl-quick.sh+1−1 cabal.project.902−23 cabal.project.doctest+1−1 cabal.project.packdiff+2−16 cabal.project.report+4−6 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/Array/Unboxed.hs−104 core/src/Streamly/Data/Array/Unboxed/Mut.hs−59 core/src/Streamly/Data/Fold.hs+189−63 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+158−16 core/src/Streamly/Data/ParserK.hs+139 core/src/Streamly/Data/Stream.hs+429−147 core/src/Streamly/Data/StreamK.hs+194 core/src/Streamly/Data/Unbox.hs−28 core/src/Streamly/Data/Unfold.hs+98−80 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+37−38 core/src/Streamly/Internal/Data/Array.hs+936−295 core/src/Streamly/Internal/Data/Array/ArrayMacros.h+13−9 core/src/Streamly/Internal/Data/Array/Generic.hs+342 core/src/Streamly/Internal/Data/Array/Mut/Type.hs−603 core/src/Streamly/Internal/Data/Array/Stream.hs+725 core/src/Streamly/Internal/Data/Array/Stream/Foreign.hs−1161 core/src/Streamly/Internal/Data/Array/Stream/Mut/Foreign.hs−325 core/src/Streamly/Internal/Data/Array/Type.hs+1148 core/src/Streamly/Internal/Data/Array/Unboxed.hs−559 core/src/Streamly/Internal/Data/Array/Unboxed/Mut.hs−103 core/src/Streamly/Internal/Data/Array/Unboxed/Mut/Type.hs−2386 core/src/Streamly/Internal/Data/Array/Unboxed/Type.hs−606 src/Streamly/Internal/Data/Binary/Decode.hs → core/src/Streamly/Internal/Data/Binary/Parser.hs+157−38 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−2839 core/src/Streamly/Internal/Data/Array/Stream/Fold/Foreign.hs → core/src/Streamly/Internal/Data/Fold/Chunked.hs+76−84 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+683−281 core/src/Streamly/Internal/Data/Fold/Window.hs+59−90 core/src/Streamly/Internal/Data/IOFinalizer.hs+20−21 core/src/Streamly/Internal/Data/IORef/Unboxed.hs+28−26 core/src/Streamly/Internal/Data/IsMap.hs+8 core/src/Streamly/Internal/Data/List.hs+104−39 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+2811−711 core/src/Streamly/Internal/Data/Parser/ParserD.hs−2249 core/src/Streamly/Internal/Data/Parser/ParserK/Type.hs−328 core/src/Streamly/Internal/Data/Parser/ParserD/Tee.hs → core/src/Streamly/Internal/Data/Parser/Tee.hs+6−6 core/src/Streamly/Internal/Data/Parser/ParserD/Type.hs → core/src/Streamly/Internal/Data/Parser/Type.hs+245−317 core/src/Streamly/Internal/Data/ParserK.hs+16 core/src/Streamly/Internal/Data/ParserK/Type.hs+752 core/src/Streamly/Internal/Data/Pipe.hs+11−1706 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+60−39 core/src/Streamly/Internal/Data/Producer/Type.hs+1−1 core/src/Streamly/Internal/Data/Refold/Type.hs+3−4 core/src/Streamly/Internal/Data/Ring.hs+603−31 core/src/Streamly/Internal/Data/Ring/Foreign.hs−620 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+22−10 core/src/Streamly/Internal/Data/Stream/Bottom.hs−534 core/src/Streamly/Internal/Data/Stream/Container.hs+310 core/src/Streamly/Internal/Data/Stream/Eliminate.hs+702−231 core/src/Streamly/Internal/Data/Stream/Enumerate.hs−580 core/src/Streamly/Internal/Data/Stream/Exception.hs+390−157 core/src/Streamly/Internal/Data/Stream/Expand.hs−663 core/src/Streamly/Internal/Data/Stream/Generate.hs+961−207 core/src/Streamly/Internal/Data/Stream/Lift.hs+101−111 core/src/Streamly/Internal/Data/Stream/StreamD/Nesting.hs → core/src/Streamly/Internal/Data/Stream/Nesting.hs+795−358 core/src/Streamly/Internal/Data/Stream/Reduce.hs−322 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−638 core/src/Streamly/Internal/Data/Stream/StreamD/Exception.hs−424 core/src/Streamly/Internal/Data/Stream/StreamD/Generate.hs−482 core/src/Streamly/Internal/Data/Stream/StreamD/Lift.hs−112 core/src/Streamly/Internal/Data/Stream/StreamD/Transform.hs−1190 core/src/Streamly/Internal/Data/Stream/StreamD/Type.hs−1058 core/src/Streamly/Internal/Data/Stream/StreamDK.hs−156 core/src/Streamly/Internal/Data/Stream/StreamK.hs−1092 core/src/Streamly/Internal/Data/Stream/Top.hs+291−440 core/src/Streamly/Internal/Data/Stream/Transform.hs+1393−337 core/src/Streamly/Internal/Data/Stream/Transformer.hs+183 core/src/Streamly/Internal/Data/Stream/Type.hs+1962−286 core/src/Streamly/Internal/Data/Stream/Zip.hs−114 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/Stream/StreamK/Type.hs → core/src/Streamly/Internal/Data/StreamK/Type.hs+1037−319 core/src/Streamly/Internal/Data/Time/Clock.hs+3−3 core/src/Streamly/Internal/Data/Time/TimeSpec.hsc−3 core/src/Streamly/Internal/Data/Time/Units.hs+1−4 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/Unboxed.hs−260 core/src/Streamly/Internal/Data/Unfold.hs+111−275 core/src/Streamly/Internal/Data/Unfold/Enumeration.hs+14−45 core/src/Streamly/Internal/Data/Unfold/Type.hs+154−65 src/Streamly/Internal/FileSystem/Dir.hs → core/src/Streamly/Internal/FileSystem/Dir.hs+180−73 src/Streamly/Internal/FileSystem/File.hs → core/src/Streamly/Internal/FileSystem/File.hs+173−107 src/Streamly/Internal/FileSystem/Handle.hs → core/src/Streamly/Internal/FileSystem/Handle.hs+127−183 core/src/Streamly/Internal/FileSystem/Path.hs+515 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+144−161 src/Streamly/Internal/Unicode/String.hs → core/src/Streamly/Internal/Unicode/String.hs+30−22 core/src/Streamly/Unicode/Parser.hs+69 src/Streamly/Unicode/Stream.hs → core/src/Streamly/Unicode/Stream.hs+19−16 core/src/Streamly/Unicode/String.hs+30 core/src/inline.hs+1−1 core/streamly-core.cabal+268−109 docs/Developer/Benchmarks.md+8 docs/Developer/Contributing.md+1−2 docs/Developer/MAINTAINING.md+13−14 docs/Developer/Tests.md+2−2 docs/Developer/ci-tests.md+16−6 docs/Developer/module-organization.md+3−3 docs/Developer/optimization-guidelines.md+13−1 docs/Developer/paths.rst+25−2 docs/Documentation.md+5 docs/User/Explanatory/design.md+42 docs/User/Explanatory/unified-abstractions.md+1−1 docs/User/HowTo/Compiling.md+54−46 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+120−20 docs/User/ProjectRelated/Credits.md → docs/User/Project/Credits.md docs/User/ProjectRelated/Github.link → docs/User/Project/Github.link 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/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/streamly-docs.cabal+8−6 hie.yaml+47−21 src/Streamly.hs−623 src/Streamly/Data/Array.hs−43 src/Streamly/Data/Array/Foreign.hs+25−11 src/Streamly/Data/Fold/Prelude.hs+65 src/Streamly/Data/Fold/Tee.hs+16 src/Streamly/Data/SmallArray.hs+2−2 src/Streamly/Data/Stream/MkType.hs+115 src/Streamly/Data/Stream/Prelude.hs+232 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−39 src/Streamly/Internal/Data/Channel.hs+19 src/Streamly/Internal/Data/Stream/Channel/Dispatcher.hs → src/Streamly/Internal/Data/Channel/Dispatcher.hs+9−12 src/Streamly/Internal/Data/Stream/Channel/Types.hs → src/Streamly/Internal/Data/Channel/Types.hs+132−25 src/Streamly/Internal/Data/Stream/Channel/Worker.hs → src/Streamly/Internal/Data/Channel/Worker.hs+5−3 core/src/Streamly/Internal/Data/Cont.hs → src/Streamly/Internal/Data/Cont.hs src/Streamly/Internal/Data/Fold/Async.hs+19−6 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+10 src/Streamly/Internal/Data/SVar.hs+2−2 src/Streamly/Internal/Data/SmallArray.hs+18−19 src/Streamly/Internal/Data/Stream/Ahead.hs+34−12 src/Streamly/Internal/Data/Stream/Async.hs+990−246 src/Streamly/Internal/Data/Stream/Async/Channel.hs−248 src/Streamly/Internal/Data/Stream/Async/Channel/Append.hs−292 core/src/Streamly/Internal/Data/Stream/Common.hs → src/Streamly/Internal/Data/Stream/Common.hs+12−13 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/Async/Channel/Consumer.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Consumer.hs+14−17 src/Streamly/Internal/Data/Stream/Async/Channel/Dispatcher.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Dispatcher.hs+179−123 src/Streamly/Internal/Data/Stream/Async/Channel/Interleave.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Interleave.hs+35−31 src/Streamly/Internal/Data/Stream/Async/Channel/Operations.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Operations.hs+36−32 src/Streamly/Internal/Data/Stream/Async/Channel/Type.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Type.hs+31−13 src/Streamly/Internal/Data/Stream/Instances.hs+7−10 src/Streamly/Internal/Data/Stream/IsStream.hs+24−4 src/Streamly/Internal/Data/Stream/IsStream/Async.hs−1032 src/Streamly/Internal/Data/Stream/IsStream/Combinators.hs+4−2 src/Streamly/Internal/Data/Stream/IsStream/Common.hs+50−23 src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs+133−38 src/Streamly/Internal/Data/Stream/IsStream/Enumeration.hs+5−2 src/Streamly/Internal/Data/Stream/IsStream/Exception.hs+24−22 src/Streamly/Internal/Data/Stream/IsStream/Expand.hs+33−26 src/Streamly/Internal/Data/Stream/IsStream/Generate.hs+15−39 src/Streamly/Internal/Data/Stream/IsStream/Lift.hs+7−5 src/Streamly/Internal/Data/Stream/IsStream/Reduce.hs+55−51 src/Streamly/Internal/Data/Stream/IsStream/Top.hs+29−23 src/Streamly/Internal/Data/Stream/IsStream/Transform.hs+46−42 src/Streamly/Internal/Data/Stream/IsStream/Type.hs+47−36 src/Streamly/Internal/Data/Stream/Lifted.hs+335 src/Streamly/Internal/Data/Stream/MkType.hs+641 src/Streamly/Internal/Data/Stream/Parallel.hs+51−121 src/Streamly/Internal/Data/Stream/Prelude.hs+19 src/Streamly/Internal/Data/Stream/SVar.hs+18 src/Streamly/Internal/Data/Stream/SVar/Eliminate.hs+9−8 src/Streamly/Internal/Data/Stream/SVar/Generate.hs+13−13 src/Streamly/Internal/Data/Stream/Serial.hs+386−17 src/Streamly/Internal/Data/Stream/Time.hs+950 src/Streamly/Internal/Data/Stream/WSerial.hs−208 src/Streamly/Internal/Data/Stream/Zip.hs+174 src/Streamly/Internal/Data/Stream/ZipAsync.hs+7−7 src/Streamly/Internal/Data/Unfold/Exception.hs+214 src/Streamly/Internal/Data/Unfold/Prelude.hs+17 src/Streamly/Internal/Data/Unfold/SVar.hs+3−2 src/Streamly/Internal/FileSystem/Event.hs+5−2 src/Streamly/Internal/FileSystem/Event/Darwin.hs+62−69 src/Streamly/Internal/FileSystem/Event/Linux.hs+93−97 src/Streamly/Internal/FileSystem/Event/Windows.hs+53−53 src/Streamly/Internal/FileSystem/FD.hs+22−21 src/Streamly/Internal/Network/Inet/TCP.hs+145−110 src/Streamly/Internal/Network/Socket.hs+130−233 src/Streamly/Internal/System/IOVec.hs+7−7 src/Streamly/Internal/Unicode/Array/Char.hs−93 src/Streamly/Internal/Unicode/Char.hs+20−9 src/Streamly/Internal/Unicode/Char/Parser.hs−262 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+13−5 src/inline.hs+1−1 stack.yaml+1−2 streamly.cabal+190−246 targets/Targets.hs+119−51 test/Streamly/Test/Data/Array.hs+225−10 test/Streamly/Test/Data/Array/Common.hs+10−18 test/Streamly/Test/Data/Array/CommonImports.hs+2−3 test/Streamly/Test/Data/Array/Generic.hs+65 test/Streamly/Test/Data/Array/Stream/Foreign.hs → test/Streamly/Test/Data/Array/Stream.hs+20−11 test/Streamly/Test/Data/Array/Unboxed.hs−282 test/Streamly/Test/Data/Array/Unboxed/Mut.hs−42 test/Streamly/Test/Data/Fold.hs+15−14 test/Streamly/Test/Data/Fold/Window.hs+8−9 test/Streamly/Test/Data/List.hs+3−3 test/Streamly/Test/Data/MutArray.hs+152 test/Streamly/Test/Data/Parser.hs+363−204 test/Streamly/Test/Data/Parser/ParserD.hs → test/Streamly/Test/Data/ParserK.hs+124−102 test/Streamly/Test/Data/Ring/Unboxed.hs+2−2 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/Async.hs−322 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+7−7 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+15−22 test/Streamly/Test/Network/Inet/TCP.hs+22−15 test/Streamly/Test/Network/Socket.hs+25−16 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+139−103 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+10−6 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+11−2 test/streamly-tests.cabal+113−28 test/test-runner/Main.hs+1 test/test-runner/cabal.project+3
.circleci/config.yml+74−277
@@ -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
390201 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+116−94
@@ -13,9 +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 }}
1722 CABALVER: ${{ matrix.cabal_version }}
1823 DISABLE_DOCS: ${{ matrix.disable_docs }}
24+ ENABLE_DOCSPEC: ${{ matrix.enable_docspec }}
1925 DISABLE_TEST: ${{ matrix.disable_test }}
2026 DISABLE_BENCH: ${{ matrix.disable_bench }}
2127 DISABLE_DIST_CHECKS: ${{ matrix.disable_dist_checks }}
@@ -39,14 +45,21 @@ jobs:
3945 STACK_BUILD_OPTIONS: ${{ matrix.stack_build_options }}
4046
4147 # packcheck location and revision
42− PACKCHECK_LOCAL_PATH: "./packcheck.sh"
48+ PACKCHECK: "./packcheck.sh"
4349 PACKCHECK_GITHUB_URL: "https://raw.githubusercontent.com/composewell/packcheck"
44− PACKCHECK_GITHUB_COMMIT: "075e13ab716c67d2110db4905ae42b0280af046d"
50+ PACKCHECK_GITHUB_COMMIT: "v0.7.0"
4551
4652 # Pull token from "secrets" setting of the github repo
4753 COVERALLS_TOKEN: ${{ secrets.COVERALLS_TOKEN }}
4854 COVERAGE: ${{ matrix.coverage }}
49− DOCTEST: ${{ matrix.doctest }}
55+
56+ # hlint
57+ HLINT_VERSION: 3.6.1
58+ HLINT_OPTIONS: "lint"
59+ HLINT_TARGETS: "core/src src test benchmark"
60+
61+ # Subdir
62+ SUBDIR: ${{ matrix.subdir }}
5063
5164 runs-on: ${{ matrix.runner }}
5265 continue-on-error: ${{ matrix.ignore_error }}
@@ -55,8 +68,8 @@ jobs:
5568 matrix:
5669 # The order is important to optimize fail-fast.
5770 name:
58− - 8.10.7-sdist-fusion-inspection-Werror
59− - 9.2.4-docspec
71+ - 9.8.1-Werror
72+ # - 9.8.1-docspec
6073 # - 8.10.7-coverage
6174
6275 # Note: if cabal.project is not specified benchmarks and tests won't
@@ -65,158 +78,160 @@ jobs:
6578 include:
6679 - name: head
6780 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"
6891 runner: ubuntu-latest
6992 build: cabal
70− cabal_version: 3.8.1.0
93+ cabal_version: 3.10.2.0
7194 cabal_project: cabal.project.ghc-head
7295 disable_sdist_build: "y"
7396 ignore_error: true
74− - name: 9.4.2
75− ghc_version: 9.4.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
76120 runner: ubuntu-latest
77121 build: cabal
122+ cabal_version: 3.10.1.0
123+ disable_sdist_build: "y"
124+ cabal_project: cabal.project
125+ cabal_build_options: "--flag fusion-plugin --flag inspection"
126+ ignore_error: false
127+ - name: 9.6.3-macos
128+ ghc_version: 9.6.3
129+ runner: macos-latest
130+ build: cabal
131+ cabal_version: 3.10.1.0
132+ disable_sdist_build: "y"
78133 cabal_project: cabal.project
134+ ignore_error: false
135+ - name: 9.4.7
136+ ghc_version: 9.4.7
137+ runner: ubuntu-latest
138+ build: cabal
79139 cabal_version: 3.8.1.0
80140 disable_sdist_build: "y"
141+ cabal_project: cabal.project
81142 ignore_error: false
82− - name: 9.2.4
83− ghc_version: 9.2.4
143+ - name: 9.2.8
144+ ghc_version: 9.2.8
84145 runner: ubuntu-latest
85146 build: cabal
86147 cabal_project: cabal.project
87148 cabal_version: 3.6.2.0
88149 disable_sdist_build: "y"
89150 ignore_error: false
90− - name: 9.2.4-docspec
91− ghc_version: 9.2.4
151+ - name: 9.0.2-streamly-sdist
152+ ghc_version: 9.0.2
92153 runner: ubuntu-latest
93− doctest: "y"
154+ build: cabal
94155 cabal_version: 3.6.2.0
95− cabal_project: cabal.project
96− ignore_error: false
97− - name: 9.0.2
156+ cabal_project: cabal.project.streamly
157+ ignore_error: true
158+ - name: 9.0.2-streamly-core-sdist
98159 ghc_version: 9.0.2
99160 runner: ubuntu-latest
100161 build: cabal
101162 cabal_version: 3.6.2.0
102− cabal_project: cabal.project.902
103− disable_sdist_build: "y"
104− ignore_error: true
105− - name: 8.10.7-sdist-stack
163+ subdir: core
164+ ignore_error: false
165+ - name: 8.10.7-streamly-sdist-stack
106166 runner: ubuntu-latest
107167 build: stack
108− resolver: lts-18.23
168+ resolver: lts-20.13
109169 stack_yaml: stack.yaml
110170 sdist_options: "--ignore-check"
111171 stack_build_options: "--flag streamly-benchmarks:-opt"
112172 cabal_version: 3.6.2.0
113173 ignore_error: false
114− - name: 8.10.7-macos
115− ghc_version: 8.10.7
116− runner: macos-latest
117− build: cabal
118− cabal_version: 3.6.2.0
119− cabal_project: cabal.project
120− disable_sdist_build: "y"
121− ignore_error: false
122174 # - name: 8.10.7-coverage
123175 # ghc_version: 8.10.7
124176 # runner: ubuntu-latest
125177 # coverage: "y"
126178 # cabal_version: 3.6.2.0
127179 # ignore_error: false
128− - name: 8.10.7-sdist-fusion-inspection-Werror
129− ghc_version: 8.10.7
130− runner: ubuntu-latest
131− build: cabal
132− cabal_version: 3.6.2.0
133− cabal_project: cabal.project.Werror
134− cabal_build_options: "--flag fusion-plugin --flag inspection"
135− ignore_error: false
136− - name: 8.8.4-sdist-fusion
180+ - name: 8.8.4
137181 ghc_version: 8.8.4
138182 runner: ubuntu-latest
139183 build: cabal
140184 cabal_version: 3.6.2.0
141185 cabal_project: cabal.project
142− cabal_build_options: "--flag fusion-plugin"
143− ignore_error: false
144− - name: 8.6.5-sdist-no-fusion-unoptimized
145− ghc_version: 8.6.5
146− runner: ubuntu-latest
147− build: cabal
148− cabal_version: 3.6.2.0
149− cabal_project: cabal.project
150− cabal_build_options: "--flag no-fusion --flag -opt"
186+ disable_sdist_build: "y"
151187 ignore_error: false
152− - name: 8.6.5-sdist-debug-unoptimized
188+ - name: 8.6.5-debug-unoptimized
153189 ghc_version: 8.6.5
154190 runner: ubuntu-latest
155191 build: cabal
156192 cabal_version: 3.6.2.0
157193 cabal_project: cabal.project
158194 cabal_build_options: "--flag debug --flag -opt"
195+ disable_sdist_build: "y"
159196 ignore_error: false
197+ - name: hlint
198+ build: hlint
199+ runner: ubuntu-latest
200+ ignore_error: true
160201
161202 steps:
162203 - uses: actions/checkout@v2
163204
164205 - uses: actions/cache@v1
165− name: Cache ~/.cabal
206+ name: Cache common directories
166207 with:
167− path: ~/.cabal
208+ path: |
209+ ~/.local
210+ ~/.cabal
211+ ~/.stack
212+ ~/.ghcup
168213 # Bump the key version to clear the cache
169214 key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v2
170215
171216 - name: Download packcheck
172217 run: |
173− # Get packcheck if needed
174− CURL=$(which curl)
175− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
176− if test ! -e "$PACKCHECK_LOCAL_PATH"; then $CURL -sL -o "$PACKCHECK_LOCAL_PATH" $PACKCHECK_URL; fi;
177− chmod +x $PACKCHECK_LOCAL_PATH
178−
179− os=$(uname -s -m)
180− case "$os" in
181− "Linux x86_64") GHCUP_ARCH="x86_64-linux" ;;
182− "Darwin x86_64") GHCUP_ARCH="x86_64-apple-darwin" ;;
183− *) echo "Unknown OS/Arch: $os"; exit 1;;
184− esac
185−
186− # Check available versions here: https://downloads.haskell.org/~ghcup/
187− GHCUP_VER=0.1.18.0
188− $CURL -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/${GHCUP_ARCH}-ghcup-$GHCUP_VER
189− chmod +x ./ghcup
190− if test "$GHCVER" = "head"
218+ if test ! -e "$PACKCHECK"
191219 then
192− # The URL may change, to find a working URL go to https://gitlab.haskell.org/ghc/ghc/-/jobs/
193− # Find a debian10 job, click on a passed/failed job, at the
194− # end of the output you will find the tar.xz name, put that after
195− # "raw/", and put the job name after "job=".
196− # Also see https://github.com/mpickering/ghc-artefact-nix/blob/master/gitlab-artifact.nix
197− ./ghcup install ghc -u https://gitlab.haskell.org/ghc/ghc/-/jobs/artifacts/master/raw/ghc-x86_64-linux-deb10-int_native-validate.tar.xz?job=x86_64-linux-deb10-int_native-validate head
198− else
199− ./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
200230 fi
201− ./ghcup install cabal $CABALVER
202− ./ghcup set ghc $GHCVER
203− ./ghcup set cabal $CABALVER
204231
205232 - name: Run tests
206233 run: |
207− if test -n "$DOCTEST"
208− then
209− mkdir -p $HOME/.cabal/bin
210− 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
211− echo '0829bd034fba901cbcfe491d98ed8b28fd54f9cb5c91fa8e1ac62dc4413c9562 cabal-docspec.xz' | sha256sum -c -
212− xz -d < cabal-docspec.xz > $HOME/.cabal/bin/cabal-docspec
213− rm -f cabal-docspec.xz
214− chmod a+x $HOME/.cabal/bin/cabal-docspec
215− cabal update
216− cabal build --project-file cabal.project.doctest all
217− $HOME/.cabal/bin/cabal-docspec --version
218− $HOME/.cabal/bin/cabal-docspec --timeout 60 --check-properties --property-variables xs
219− elif test -n "$COVERAGE"
234+ if test -n "$COVERAGE"
220235 then
221236 # Run tests with coverage
222237 cabal update
@@ -229,8 +244,15 @@ jobs:
229244 # XXX Uncomment this and fix it properly later
230245 # hpc-coveralls --repo-token="$COVERALLS_TOKEN" --coverage-mode=StrictlyFullLines
231246 else
232− export TOOLS_DIR=/opt
233247 # /usr/local/opt/curl/bin for macOS
234248 export PATH=$HOME/.local/bin:$HOME/.ghcup/bin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/local/opt/curl/bin
235− bash -c "$PACKCHECK_LOCAL_PATH $BUILD"
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"
236258 fi
.github/workflows/regression-check.yml+40−29
@@ -19,24 +19,22 @@ jobs:
1919 env:
2020 CI_BENCHMARKS_WITH_CUTOFF: >-
2121 Data.Array
22− Data.Array.Unboxed
22+ Data.MutArray
23+ Data.Array.Generic
24+ Data.Ring.Unboxed
2325 Data.Fold
26+ Data.Fold.Window
2427 Data.Parser
25− Data.Parser.ParserD
26− Data.Parser.ParserK
27− Data.Stream.StreamD
28− Data.Stream.StreamK:6
28+ Data.ParserK
29+ Data.StreamD
30+ Data.StreamK:6
2931 Data.Unfold
3032 Data.Stream
31− Data.Stream.Async
33+ Data.Stream.Concurrent
34+ Data.Stream.ConcurrentEager
35+ Data.Stream.ConcurrentInterleaved
36+ Data.Stream.ConcurrentOrdered
3237 FileSystem.Handle
33− Prelude.Ahead
34− Prelude.Async:12
35− Prelude.Parallel
36− Prelude.WAsync:6
37− Prelude.WSerial
38− Prelude.ZipAsync
39− Prelude.ZipSerial
4038 Unicode.Char
4139 Unicode.Stream
4240 Unicode.Utf8
@@ -62,7 +60,7 @@ jobs:
6260 GHCUP_VER=0.1.18.0
6361 curl -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/x86_64-linux-ghcup-$GHCUP_VER
6462 chmod +x ./ghcup
65− GHCVER=8.10.7
63+ GHCVER=9.2.7
6664 ./ghcup install ghc $GHCVER
6765 ./ghcup set ghc $GHCVER
6866 cabal update
@@ -75,31 +73,42 @@ jobs:
7573 # Bump the key version to clear the cache
7674 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− cabal run bench-runner --project-file=cabal.project.report -- --targets "$CI_BENCHMARKS" --raw
109+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw
100110
101111 - name: Move charts to charts-master
102− if: steps.cache-charts-master.outputs.cache-hit != 'true'
103112 run: mv charts charts-master
104113
105114 # -----------------------------------------------------------------
@@ -116,7 +125,7 @@ jobs:
116125
117126 - name: Run benchmarks and append
118127 run: |
119− cabal run bench-runner --project-file=cabal.project.report -- --targets "$CI_BENCHMARKS" --raw --append
128+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw --append
120129
121130 # -----------------------------------------------------------------
122131 # -- Compare
@@ -124,7 +133,7 @@ jobs:
124133
125134 - name: List all benchmarks
126135 run: |
127− cabal run bench-runner --project-file=cabal.project.report -- --targets "$CI_BENCHMARKS" --no-measure
136+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --no-measure
128137
129138 - name: Compare benchmarks
130139 run: |
@@ -142,11 +151,13 @@ jobs:
142151
143152 echo
144153 echo "Checking $bname for regressions greater than $cutoff percent"
145− ! cabal run bench-runner --project-file=cabal.project.report -- \
146− --targets "$bname" \
147− --fields "$CI_FIELDS" \
148− --no-measure --silent \
149− --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 \
150161 | grep -v "^$"
151162 test $? -eq 1 && EXIT_STATUS=1
152163 done
.hlint.ignore+10−3
@@ -1,30 +1,37 @@
11core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs
22core/src/Streamly/Internal/Data/Pipe/Type.hs
3+core/src/Streamly/Internal/Unicode/Stream.hs
34src/Streamly/Internal/Data/SmallArray/Type.hs
4−src/Streamly/Internal/Unicode/Stream.hs
5+src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs
6+src/Streamly/Internal/Data/Stream/Serial.hs
7+src/Streamly/Internal/Data/Stream/Zip.hs
58test/Streamly/Test/Data/Array.hs
69test/Streamly/Test/Data/Parser.hs
7−test/Streamly/Test/Data/Parser/ParserD.hs
10+test/Streamly/Test/Data/ParserK.hs
811test/Streamly/Test/Data/SmallArray.hs
912test/Streamly/Test/Data/Unfold.hs
1013test/Streamly/Test/FileSystem/Event.hs
1114test/Streamly/Test/Prelude/Concurrent.hs
15+test/Streamly/Test/Data/Stream/Concurrent.hs
16+test/lib/Streamly/Test/Prelude/Common.hs
1217test/Streamly/Test/Prelude/Fold.hs
1318test/Streamly/Test/Prelude/Rate.hs
1419test/Streamly/Test/Prelude/Serial.hs
1520test/Streamly/Test/Unicode/Stream.hs
21+test/Streamly/Test/Data/Unbox.hs
1622benchmark/lib/Streamly/Benchmark/Common.hs
1723benchmark/lib/Streamly/Benchmark/Common/Handle.hs
1824benchmark/lib/Streamly/Benchmark/Prelude.hs
1925benchmark/NanoBenchmarks.hs
2026benchmark/Streamly/Benchmark/Data/Array.hs
2127benchmark/Streamly/Benchmark/Data/Parser.hs
22−benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs
28+benchmark/Streamly/Benchmark/Data/ParserK.hs
2329benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs
2430benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs
2531benchmark/Streamly/Benchmark/Data/Unfold.hs
2632benchmark/Streamly/Benchmark/FileSystem/Handle.hs
2733benchmark/Streamly/Benchmark/Prelude/Async.hs
34+benchmark/Streamly/Benchmark/Prelude/Concurrent.hs
2835benchmark/Streamly/Benchmark/Prelude/Merge.hs
2936benchmark/Streamly/Benchmark/Prelude/Parallel.hs
3037benchmark/Streamly/Benchmark/Prelude/Rate.hs
.hlint.yaml+2−4
@@ -24,16 +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: Stream.Transform}
3030- ignore: {name: "Use mapM", within: Stream.Transform}
3131- ignore: {name: "Use traverse", within: Stream.Transform}
3232- ignore: {name: "Redundant <*", within: Stream.Expand}
33−- ignore: {name: "Use ++", within: Stream.Reduce}
34−- ignore: {name: "Use ++", within: Stream.Split}
3533- ignore: {name: "Redundant bracket", within: Stream.Split}
36−- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Char.Parser}
34+- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Parser}
3735
3836# Specify additional command line arguments
3937#
.packcheck.ignore+2−1
@@ -22,9 +22,10 @@ cabal.project.hpc-coveralls
2222cabal.project.O0
2323cabal.project.report
2424cabal.project.packdiff
25+cabal.project.streamly
2526cabal.project.Werror
2627cabal.project.Werror-nocode
27−cabal.project.902
28+core/
2829default.nix
2930examples/README.md
3031hie.yaml
CHANGELOG.md+1−1
@@ -1 +1 @@
1−docs/User/ProjectRelated/Changelog.md
1+docs/User/Project/Changelog.md
LICENSE−254
@@ -26,172 +26,6 @@ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
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/User/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+5−3
@@ -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.
@@ -10,13 +12,13 @@ import Data.Char (ord)
1012import Streamly.Internal.Data.Stream (Stream)
1113import System.IO (hSeek, SeekMode(..), openFile, IOMode(..))
1214
13−import qualified Streamly.Data.Array.Unboxed as A
15+import qualified Streamly.Data.Array as A
1416import qualified Streamly.Internal.FileSystem.Handle as IFH
1517import qualified Streamly.Data.Fold as FL
1618import qualified Streamly.Internal.Data.Stream as S
1719import qualified Streamly.Internal.Data.Stream.IsStream as Internal
1820
19−import Gauge
21+import Test.Tasty.Bench
2022import System.Random
2123
2224maxValue :: Int
@@ -115,7 +117,7 @@ main = do
115117 $ map (fromIntegral . ord) "abcdefghijklmnopqrstuvwxyz"
116118 )
117119 FL.drain
118− $ IFH.getBytes inText
120+ $ IFH.read inText
119121 )
120122 >>= print
121123 ]
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-------------------------------------------------------------------------------
@@ -47,10 +63,17 @@ foldableSum = P.sum
4763-}
4864#endif
4965
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+
5074{-# INLINE sourceIntFromToFromStream #-}
5175sourceIntFromToFromStream :: MonadIO m => Int -> Int -> m (Stream Int)
52−sourceIntFromToFromStream value n =
53− S.fold A.write $ S.enumerateFromTo n (n + value)
76+sourceIntFromToFromStream value n = S.fold A.write $ S.enumerateFromTo n (n + value)
5477
5578-------------------------------------------------------------------------------
5679-- Bench groups
@@ -63,13 +86,19 @@ o_1_space_generation value =
6386 [ benchIOSrc "write . intFromTo" (sourceIntFromToFromStream value)
6487 , 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+7−7
@@ -69,11 +69,11 @@ onArray
6969 :: MonadIO m => Int -> (Stream.Stream m Int -> Stream.Stream m Int)
7070 -> Stream Int
7171 -> m (Stream Int)
72−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
7373
74−scanl' value n = composeN n $ onArray value $ S.scanl' (+) 0
75−scanl1' value n = composeN n $ onArray value $ S.scanl1' (+)
76−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)
7777-- map n = composeN n $ A.map (+1)
7878
7979{-# INLINE eqInstance #-}
@@ -98,7 +98,7 @@ showInstance = P.show
9898
9999{-# INLINE pureFoldl' #-}
100100pureFoldl' :: MonadIO m => Stream Int -> m Int
101−pureFoldl' = S.foldl' (+) 0 . S.unfold A.read
101+pureFoldl' = S.fold (Fold.foldl' (+) 0) . S.unfold A.reader
102102
103103-------------------------------------------------------------------------------
104104-- Elimination
@@ -106,11 +106,11 @@ pureFoldl' = S.foldl' (+) 0 . S.unfold A.read
106106
107107{-# INLINE unfoldReadDrain #-}
108108unfoldReadDrain :: MonadIO m => Stream Int -> m ()
109−unfoldReadDrain = S.drain . S.unfold A.read
109+unfoldReadDrain = S.fold Fold.drain . S.unfold A.reader
110110
111111{-# INLINE toStreamRevDrain #-}
112112toStreamRevDrain :: MonadIO m => Stream Int -> m ()
113−toStreamRevDrain = S.drain . A.toStreamRev
113+toStreamRevDrain = S.fold Fold.drain . A.readRev
114114
115115-------------------------------------------------------------------------------
116116-- Bench groups
benchmark/Streamly/Benchmark/Data/Array/CommonImports.hs+5−4
@@ -5,11 +5,12 @@ import Control.Monad.IO.Class (MonadIO)
55import Data.Functor ((<&>))
66import System.Random (randomRIO)
77
8−import qualified Streamly.Prelude as S
9−import qualified Streamly.Internal.Data.Stream as Stream
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
1011
11−import Gauge
12+import Test.Tasty.Bench
1213import Streamly.Benchmark.Common hiding (benchPureSrc)
13−import qualified Streamly.Benchmark.Prelude as P
14+import qualified Stream.Common as P
1415
1516import Prelude as P hiding (map)
benchmark/Streamly/Benchmark/Data/Array/Unboxed.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.Unboxed 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.Unboxed as A
11−import qualified Streamly.Internal.Data.Array.Unboxed 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.Unboxed"
104+moduleName = "Data.Array.Generic"
118105
119106defStreamSize :: Int
120107defStreamSize = defaultStreamSize
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+53−41
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Streamly.Benchmark.Data.ParserD
35-- Copyright : (c) 2020 Composewell Technologies
@@ -25,32 +27,34 @@ module Main
2527
2628import Control.DeepSeq (NFData(..))
2729import Control.Monad (void, when)
28−import Control.Monad.Catch (MonadCatch, try, SomeException)
30+import Control.Monad.Catch (MonadCatch)
2931import Data.Functor.Identity (runIdentity)
3032import Data.Maybe (isJust)
3133import Data.Word (Word8)
3234import Streamly.Internal.Data.Stream (Stream)
35+import Streamly.Internal.Data.StreamK (StreamK)
3336import System.IO (Handle)
3437import System.Random (randomRIO)
3538import Prelude hiding ()
3639
37−import qualified Streamly.Internal.Data.Array.Unboxed as Array
38−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
3943import qualified Streamly.Internal.Data.Fold as Fold
4044import qualified Streamly.Internal.Data.Parser as Parser
41−import qualified Streamly.Internal.Data.Stream as S
42−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
45+import qualified Streamly.Internal.Data.Stream as Stream
46+import qualified Streamly.Internal.Data.StreamK as StreamK
4347import qualified Streamly.Internal.FileSystem.Handle as Handle
4448import qualified Streamly.Internal.Unicode.Stream as Unicode
4549
46−import Gauge hiding (env)
50+import Test.Tasty.Bench hiding (env)
4751import Streamly.Benchmark.Common
4852import Streamly.Benchmark.Common.Handle
4953import Control.Monad.IO.Class (MonadIO)
5054
5155#ifdef INSPECTION
52−import Streamly.Internal.Data.Unboxed (Unboxed)
53−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
56+import Streamly.Internal.Data.MutByteArray (Unbox)
57+import Streamly.Internal.Data.Stream (Step(..))
5458import Test.Inspection
5559#endif
5660
@@ -61,8 +65,8 @@ import Test.Inspection
6165-- XXX these can be moved to the common module
6266
6367{-# INLINE sourceUnfoldrM #-}
64−sourceUnfoldrM :: MonadIO m => Int -> Int -> Stream m Int
65−sourceUnfoldrM value n = S.unfoldrM step n
68+sourceUnfoldrM :: MonadIO m => Int -> Int -> Stream.Stream m Int
69+sourceUnfoldrM value n = Stream.unfoldrM step n
6670 where
6771 step cnt =
6872 if cnt > n + value
@@ -83,7 +87,7 @@ benchIO name src sink =
8387-- | Get the last byte from a file bytestream.
8488toChunksLast :: Handle -> IO (Maybe Word8)
8589toChunksLast inh = do
86− let s = Handle.getChunks inh
90+ let s = Handle.readChunks inh
8791 larr <- Stream.last s
8892 return $ case larr of
8993 Nothing -> Nothing
@@ -97,8 +101,8 @@ inspect $ 'toChunksLast `hasNoType` ''Step
97101-- | Count the number of bytes in a file.
98102toChunksSumLengths :: Handle -> IO Int
99103toChunksSumLengths inh =
100− let s = Handle.getChunks inh
101− 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)
102106
103107#ifdef INSPECTION
104108inspect $ hasNoTypeClasses 'toChunksSumLengths
@@ -108,8 +112,8 @@ inspect $ 'toChunksSumLengths `hasNoType` ''Step
108112-- | Sum the bytes in a file.
109113toChunksCountBytes :: Handle -> IO Word8
110114toChunksCountBytes inh = do
111− let foldlArr' f z = runIdentity . Stream.foldl' f z . Array.toStream
112− let s = Handle.getChunks inh
115+ let foldlArr' f z = runIdentity . Stream.foldl' f z . Array.read
116+ let s = Handle.readChunks inh
113117 Stream.foldl' (\acc arr -> acc + foldlArr' (+) 0 arr) 0 s
114118
115119#ifdef INSPECTION
@@ -119,7 +123,7 @@ inspect $ 'toChunksCountBytes `hasNoType` ''Step
119123
120124toChunksDecodeUtf8Arrays :: Handle -> IO ()
121125toChunksDecodeUtf8Arrays =
122− Stream.drain . Unicode.decodeUtf8Arrays . Handle.getChunks
126+ Stream.drain . Unicode.decodeUtf8Chunks . Handle.readChunks
123127
124128#ifdef INSPECTION
125129inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
@@ -133,7 +137,9 @@ inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
133137-- | Count the number of lines in a file.
134138toChunksSplitOnSuffix :: Handle -> IO Int
135139toChunksSplitOnSuffix =
136− Stream.length . ArrayStream.splitOnSuffix 10 . Handle.getChunks
140+ Stream.fold Fold.length
141+ . ArrayStream.splitOnSuffix 10
142+ . Handle.readChunks
137143
138144#ifdef INSPECTION
139145inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
@@ -143,7 +149,10 @@ inspect $ 'toChunksSplitOnSuffix `hasNoType` ''Step
143149-- XXX use a word splitting combinator instead of splitOn and test it.
144150-- | Count the number of words in a file.
145151toChunksSplitOn :: Handle -> IO Int
146−toChunksSplitOn = Stream.length . ArrayStream.splitOn 32 . Handle.getChunks
152+toChunksSplitOn =
153+ Stream.fold Fold.length
154+ . ArrayStream.splitOn 32
155+ . Handle.readChunks
147156
148157#ifdef INSPECTION
149158inspect $ hasNoTypeClasses 'toChunksSplitOn
@@ -181,12 +190,11 @@ o_1_space_read_chunked env =
181190copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
182191copyChunksSplitInterposeSuffix inh outh =
183192 Stream.fold (Handle.write outh)
184− $ ArrayStream.interposeSuffix 10
185− $ ArrayStream.splitOnSuffix 10
186− $ Handle.getChunks inh
193+ $ ArrayStream.interposeSuffix 10 . ArrayStream.splitOnSuffix 10
194+ $ Handle.readChunks inh
187195
188196#ifdef INSPECTION
189−inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterposeSuffix [''Unboxed]
197+inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterposeSuffix [''Unbox]
190198inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
191199#endif
192200
@@ -195,13 +203,12 @@ inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
195203copyChunksSplitInterpose :: Handle -> Handle -> IO ()
196204copyChunksSplitInterpose inh outh =
197205 Stream.fold (Handle.write outh)
198− $ ArrayStream.interpose 32
199206 -- XXX this is not correct word splitting combinator
200− $ ArrayStream.splitOn 32
201− $ Handle.getChunks inh
207+ $ ArrayStream.interpose 32 . ArrayStream.splitOn 32
208+ $ Handle.readChunks inh
202209
203210#ifdef INSPECTION
204−inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterpose [''Unboxed]
211+inspect $ hasNoTypeClassesExcept 'copyChunksSplitInterpose [''Unbox]
205212inspect $ 'copyChunksSplitInterpose `hasNoType` ''Step
206213#endif
207214
@@ -220,7 +227,7 @@ o_1_space_copy_toChunks_group_ungroup env =
220227-------------------------------------------------------------------------------
221228
222229{-# INLINE drainWhile #-}
223−drainWhile :: MonadCatch m => (a -> Bool) -> Parser.Parser m a ()
230+drainWhile :: MonadCatch m => (a -> Bool) -> Parser.Parser a m ()
224231drainWhile p = Parser.takeWhile p Fold.drain
225232
226233-------------------------------------------------------------------------------
@@ -229,25 +236,26 @@ drainWhile p = Parser.takeWhile p Fold.drain
229236
230237{-# INLINE fold #-}
231238fold :: Stream IO (Array.Array Int) -> IO ()
232−fold s = void $ ArrayStream.foldBreak Fold.drain s
239+fold s = void $ ArrayStream.foldBreak Fold.drain $ StreamK.fromStream s
233240
234241{-# INLINE parse #-}
235242parse :: Int -> Stream IO (Array.Array Int) -> IO ()
236−parse value s = void $ ArrayStream.parseBreak (drainWhile (< value)) s
243+parse value s =
244+ void $ ArrayStream.parseBreak (drainWhile (< value)) $ StreamK.fromStream s
237245
238246{-# INLINE foldBreak #-}
239−foldBreak :: Stream IO (Array.Array Int) -> IO ()
247+foldBreak :: StreamK IO (Array.Array Int) -> IO ()
240248foldBreak s = do
241249 (r, s1) <- ArrayStream.foldBreak Fold.one s
242250 when (isJust r) $ foldBreak s1
243251
244252{-# INLINE parseBreak #-}
245−parseBreak :: Stream IO (Array.Array Int) -> IO ()
253+parseBreak :: StreamK IO (Array.Array Int) -> IO ()
246254parseBreak s = do
247− r <- try $ ArrayStream.parseBreak Parser.one s
255+ r <- ArrayStream.parseBreak Parser.one s
248256 case r of
249− Left (_ :: SomeException) -> return ()
250− Right (_, s1) -> parseBreak s1
257+ (Left _, _) -> return ()
258+ (Right _, s1) -> parseBreak s1
251259
252260o_1_space_serial_array ::
253261 Int -> [Array.Array Int] -> [Array.Array Int] -> [Benchmark]
@@ -257,7 +265,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
257265 , benchIO
258266 "foldBreak (recursive, small arrays)"
259267 (\_ -> Stream.fromList arraysSmall)
260− foldBreak
268+ (foldBreak . StreamK.fromStream)
261269 , benchIO "parse (of 100)" (\_ -> Stream.fromList arraysSmall)
262270 $ parse bound
263271 , benchIO "parse (single)" (\_ -> Stream.fromList arraysBig)
@@ -265,7 +273,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
265273 , benchIO
266274 "parseBreak (recursive, small arrays)"
267275 (\_ -> Stream.fromList arraysSmall)
268− parseBreak
276+ (parseBreak . StreamK.fromStream)
269277 ]
270278
271279-------------------------------------------------------------------------------
@@ -273,7 +281,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
273281-------------------------------------------------------------------------------
274282
275283moduleName :: String
276−moduleName = "Data.Array.Stream.Foreign"
284+moduleName = "Data.Array.Stream"
277285
278286main :: IO ()
279287main = do
@@ -282,10 +290,14 @@ main = do
282290
283291 where
284292
285− alloc value = do
286− small <- Stream.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
287− big <- Stream.toList $ Stream.arraysOf value $ sourceUnfoldrM value 0
288− 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)
289301
290302 allBenchmarks env arrays value =
291303 let (arraysSmall, arraysBig) = arrays
benchmark/Streamly/Benchmark/Data/Fold.hs+109−73
@@ -6,16 +6,23 @@
66-- Maintainer : streamly@composewell.com
77
88{-# LANGUAGE FlexibleContexts #-}
9+{-# LANGUAGE FlexibleInstances #-}
910{-# LANGUAGE RankNTypes #-}
1011{-# LANGUAGE ScopedTypeVariables #-}
1112{-# 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
1219
1320module Main (main) where
1421
1522import Control.DeepSeq (NFData(..))
1623import Control.Monad (when)
1724import Control.Monad.IO.Class (MonadIO(..))
18−import Data.Functor.Identity (Identity)
25+import Data.Functor.Identity (Identity(..))
1926import Data.Map.Strict (Map)
2027import Data.Hashable (Hashable)
2128import Data.HashMap.Strict (HashMap)
@@ -26,13 +33,15 @@ import System.Random (randomRIO)
2633import Streamly.Internal.Data.Stream (Stream)
2734import Streamly.Internal.Data.Fold (Fold(..))
2835import Streamly.Internal.Data.IsMap.HashMap ()
36+import Streamly.Internal.Data.MutArray (MutArray)
2937
3038import qualified Streamly.Internal.Data.Fold as FL
39+import qualified Streamly.Data.Fold.Prelude as Fold
3140import qualified Streamly.Internal.Data.Unfold as Unfold
3241import qualified Streamly.Internal.Data.Pipe as Pipe
3342import qualified Streamly.Internal.Data.Stream as Stream
3443
35−import Gauge
44+import Test.Tasty.Bench
3645import Streamly.Benchmark.Common
3746import Prelude hiding (all, any, take, unzip, sequence_, filter)
3847
@@ -120,16 +129,16 @@ many = Stream.fold (FL.many (FL.take 1 FL.drain) FL.drain)
120129splitAllAny :: Monad m => Int -> Stream m Int -> m (Bool, Bool)
121130splitAllAny value =
122131 Stream.fold
123− (FL.serialWith (,)
132+ (FL.splitWith (,)
124133 (FL.all (<= (value `div` 2)))
125134 (FL.any (> value))
126135 )
127136
128−{-# INLINE serial_ #-}
129−serial_ :: Monad m => Int -> Stream m Int -> m Bool
130−serial_ value =
137+{-# INLINE split_ #-}
138+split_ :: Monad m => Int -> Stream m Int -> m Bool
139+split_ value =
131140 Stream.fold
132− (FL.serial_
141+ (FL.split_
133142 (FL.all (<= (value `div` 2)))
134143 (FL.any (> value))
135144 )
@@ -199,55 +208,55 @@ partitionByMinM :: Monad m => Stream m Int -> m (Int, Int)
199208partitionByMinM =
200209 Stream.fold (FL.partitionByMinM (return . oddEven) FL.sum FL.length)
201210
202−{-# INLINE demuxWith #-}
203−demuxWith :: (Monad m, Ord k) =>
211+{-# INLINE demuxToMap #-}
212+demuxToMap :: (Monad m, Ord k) =>
204213 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
205−demuxWith f g = Stream.fold (FL.demuxWith f g)
214+demuxToMap f g = Stream.fold (FL.demuxToContainer f g)
206215
207−{-# INLINE demuxWithInt #-}
208−demuxWithInt :: Monad m =>
216+{-# INLINE demuxToIntMap #-}
217+demuxToIntMap :: Monad m =>
209218 (a -> Int) -> (a -> m (Fold m a b)) -> Stream m a -> m (IntMap b)
210−demuxWithInt f g = Stream.fold (FL.demuxWith f g)
219+demuxToIntMap f g = Stream.fold (FL.demuxToContainer f g)
211220
212−{-# INLINE demuxWithHash #-}
213−demuxWithHash :: (Monad m, Ord k, Hashable k) =>
221+{-# INLINE demuxToHashMap #-}
222+demuxToHashMap :: (Monad m, Hashable k) =>
214223 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
215−demuxWithHash f g = Stream.fold (FL.demuxWith f g)
224+demuxToHashMap f g = Stream.fold (FL.demuxToContainer f g)
216225
217−{-# INLINE demuxMutWith #-}
218−demuxMutWith :: (MonadIO m, Ord k) =>
226+{-# INLINE demuxToMapIO #-}
227+demuxToMapIO :: (MonadIO m, Ord k) =>
219228 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (Map k b)
220−demuxMutWith f g = Stream.fold (FL.demuxMutWith f g)
229+demuxToMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
221230
222−{-# INLINE demuxMutWithHash #-}
223−demuxMutWithHash :: (MonadIO m, Ord k, Hashable k) =>
231+{-# INLINE demuxToHashMapIO #-}
232+demuxToHashMapIO :: (MonadIO m, Hashable k) =>
224233 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
225−demuxMutWithHash f g = Stream.fold (FL.demuxMutWith f g)
234+demuxToHashMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
226235
227−{-# INLINE classifyWith #-}
228−classifyWith ::
236+{-# INLINE toMap #-}
237+toMap ::
229238 (Monad m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
230−classifyWith f = Stream.fold (FL.classifyWith f FL.sum)
239+toMap f = Stream.fold (FL.toContainer f FL.sum)
231240
232−{-# INLINE classifyWithInt #-}
233−classifyWithInt ::
241+{-# INLINE toIntMap #-}
242+toIntMap ::
234243 (Monad m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
235−classifyWithInt f = Stream.fold (FL.classifyWith f FL.sum)
244+toIntMap f = Stream.fold (FL.toContainer f FL.sum)
236245
237−{-# INLINE classifyMutWith #-}
238−classifyMutWith ::
246+{-# INLINE toMapIO #-}
247+toMapIO ::
239248 (MonadIO m, Ord k, Num a) => (a -> k) -> Stream m a -> m (Map k a)
240−classifyMutWith f = Stream.fold (FL.classifyMutWith f FL.sum)
249+toMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
241250
242−{-# INLINE classifyMutWithInt #-}
243−classifyMutWithInt ::
251+{-# INLINE toIntMapIO #-}
252+toIntMapIO ::
244253 (MonadIO m, Num a) => (a -> Int) -> Stream m a -> m (IntMap a)
245−classifyMutWithInt f = Stream.fold (FL.classifyMutWith f FL.sum)
254+toIntMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
246255
247−{-# INLINE classifyMutWithHash #-}
248−classifyMutWithHash :: (MonadIO m, Ord k, Num a, Hashable k) =>
256+{-# INLINE toHashMapIO #-}
257+toHashMapIO :: (MonadIO m, Ord k, Num a, Hashable k) =>
249258 (a -> k) -> Stream m a -> m (HashMap k a)
250−classifyMutWithHash f = Stream.fold (FL.classifyMutWith f FL.sum)
259+toHashMapIO f = Stream.fold (Fold.toHashMapIO f FL.sum)
251260
252261-------------------------------------------------------------------------------
253262-- unzip
@@ -260,13 +269,13 @@ unzip = Stream.fold $ FL.lmap (\a -> (a, a)) (FL.unzip FL.sum FL.length)
260269{-# INLINE unzipWithFstM #-}
261270unzipWithFstM :: Monad m => Stream m Int -> m (Int, Int)
262271unzipWithFstM = do
263− let f = \a -> return (a + 1, a)
272+ let f a = return (a + 1, a)
264273 Stream.fold (FL.unzipWithFstM f FL.sum FL.length)
265274
266275{-# INLINE unzipWithMinM #-}
267276unzipWithMinM :: Monad m => Stream m Int -> m (Int, Int)
268277unzipWithMinM = do
269− let f = \a -> return (a + 1, a)
278+ let f a = return (a + 1, a)
270279 Stream.fold (FL.unzipWithMinM f FL.sum FL.length)
271280
272281-------------------------------------------------------------------------------
@@ -277,8 +286,8 @@ unzipWithMinM = do
277286unfoldMany :: Int -> Benchmarkable
278287unfoldMany val =
279288 nfIO
280− $ Stream.fold (FL.unfoldMany (Unfold.replicateM val) FL.drain)
281− $ Stream.fromPure (randomRIO (1, 1 :: Int))
289+ $ Stream.fold (FL.unfoldMany Unfold.replicateM FL.drain)
290+ $ Stream.fromPure (val, randomRIO (1, 1 :: Int))
282291
283292-------------------------------------------------------------------------------
284293-- Benchmarks
@@ -287,6 +296,14 @@ unfoldMany val =
287296moduleName :: String
288297moduleName = "Data.Fold"
289298
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+
290307o_1_space_serial_elimination :: Int -> [Benchmark]
291308o_1_space_serial_elimination value =
292309 [ bgroup "elimination"
@@ -294,7 +311,6 @@ o_1_space_serial_elimination value =
294311 , benchIOSink value "drainBy" (Stream.fold (FL.drainBy return))
295312 , benchIOSink value "drainN" (Stream.fold (FL.drainN value))
296313 , benchIOSink value "last" (Stream.fold FL.last)
297− , benchIOSink value "nub" (Stream.fold FL.nub)
298314 , benchIOSink value "length" (Stream.fold FL.length)
299315 , benchIOSink value "top" (Stream.fold $ FL.top 10)
300316 , benchIOSink value "bottom" (Stream.fold $ FL.bottom 10)
@@ -398,8 +414,8 @@ o_1_space_serial_composition value =
398414 , benchIOSink value "scanMaybe even" $ scanMaybe value
399415 , benchIOSink value "scanMaybe even, odd" $ scanMaybe2 value
400416 , benchIOSink value "foldBreak (recursive)" foldBreak
401− , benchIOSink value "serialWith (all, any)" $ splitAllAny value
402− , benchIOSink value "serial_ (all, any)" $ serial_ value
417+ , benchIOSink value "splitWith (all, any)" $ splitAllAny value
418+ , benchIOSink value "split_ (all, any)" $ split_ value
403419 , benchIOSink value "tee (all, any)" $ teeAllAny value
404420 , benchIOSink value "many drain (take 1)" many
405421 , bench "unfoldMany" $ unfoldMany value
@@ -437,41 +453,42 @@ o_n_heap_serial value =
437453 , benchIOSink value "toStreamRev"
438454 (Stream.fold FL.toStreamRev
439455 :: Stream IO a -> IO (Stream Identity a))
456+ , benchIOSink value "nub" (Stream.fold FL.nub)
440457 ]
441458 , bgroup "key-value"
442459 [
443− benchIOSink value "demuxWith (64 buckets) [sum, length]"
444− $ demuxWith (getKey 64) (getFold . getKey 64)
445− , benchIOSink value "demuxWithInt (64 buckets) [sum, length]"
446− $ demuxWithInt (getKey 64) (getFold . getKey 64)
447− , benchIOSink value "demuxWithHash (64 buckets) [sum, length]"
448− $ demuxWithHash (getKey 64) (getFold . getKey 64)
449− , benchIOSink value "demuxMutWith (64 buckets) [sum, length]"
450− $ demuxMutWith (getKey 64) (getFold . getKey 64)
451− , benchIOSink value "demuxMutWithHash (64 buckets) [sum, length]"
452− $ demuxMutWithHash (getKey 64) (getFold . getKey 64)
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)
453470
454471 -- classify: immutable
455− , benchIOSink value "classifyWith (64 buckets) sum"
456− $ classifyWith (getKey 64)
457− , benchIOSink value "classifyWithInt (64 buckets) sum"
458− $ 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)
459476
460477 -- classify: mutable cells
461− , benchIOSink value "classifyMutWith (single bucket) sum"
462− $ classifyMutWith (getKey 1)
463− , benchIOSink value "classifyMutWith (64 buckets) sum"
464− $ classifyMutWith (getKey 64)
465− , benchIOSink value "classifyMutWith (max buckets) sum"
466− $ classifyMutWith (getKey value)
467− , benchIOSink value "classifyMutWithInt (64 buckets) sum"
468− $ classifyMutWithInt (getKey 64)
469− , benchIOSink value "classifyMutWithHash (single bucket) sum"
470− $ classifyMutWithHash (getKey 1)
471− , benchIOSink value "classifyMutWithHash (64 buckets) sum"
472− $ classifyMutWithHash (getKey 64)
473− , benchIOSink value "classifyMutWithHash (max buckets) sum"
474− $ 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)
475492 ]
476493 ]
477494
@@ -490,7 +507,9 @@ o_n_heap_serial value =
490507-------------------------------------------------------------------------------
491508
492509main :: IO ()
493−main = runWithCLIOpts defaultStreamSize allBenchmarks
510+main = do
511+#ifndef FUSION_CHECK
512+ runWithCLIOpts defaultStreamSize allBenchmarks
494513
495514 where
496515
@@ -503,3 +522,20 @@ main = runWithCLIOpts defaultStreamSize allBenchmarks
503522 , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
504523 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
505524 ]
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+76−58
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13module Main (main) where
24
35import Control.DeepSeq (NFData)
@@ -6,21 +8,22 @@ 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,7 +31,7 @@ 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 #-}
@@ -54,120 +57,135 @@ benchScanWith src len name f =
5457 bench name
5558 $ nfIO
5659 $ randomRIO (1, 1 :: Int)
57− >>= Stream.drain . Stream.postscan f . src len . fromIntegral
60+ >>= Stream.fold Fold.drain
61+ . Stream.postscan f
62+ . src len
63+ . fromIntegral
5864
5965{-# INLINE benchWithPostscan #-}
6066benchWithPostscan :: Int -> String -> Fold IO Double a -> Benchmark
6167benchWithPostscan = benchScanWith source
6268
63−{-# INLINE numElements #-}
64−numElements :: Int
65−numElements = 100000
66−
67−main :: IO ()
68−main =
69− defaultMain
70− [ bgroup
71− "fold"
69+o_1_space_folds :: Int -> [Benchmark]
70+o_1_space_folds numElements =
71+ [ bgroup "fold"
7272 [ benchWithFold numElements "minimum (window size 100)"
73− (Window.minimum 100)
73+ (Window.windowMinimum 100)
7474 , benchWithFold numElements "minimum (window size 1000)"
75− (Window.minimum 1000)
75+ (Window.windowMinimum 1000)
7676 , benchWith sourceDescendingInt numElements
7777 "minimum descending (window size 1000)"
78− (Window.minimum 1000)
78+ (Window.windowMinimum 1000)
7979
8080 , benchWithFold numElements "maximum (window size 100)"
81− (Window.maximum 100)
81+ (Window.windowMaximum 100)
8282 , benchWithFold numElements "maximum (window size 1000)"
83− (Window.maximum 1000)
83+ (Window.windowMaximum 1000)
8484 , benchWith sourceDescendingInt numElements
8585 "maximum descending (window size 1000)"
86− (Window.maximum 1000)
86+ (Window.windowMaximum 1000)
8787
8888 , benchWithFold numElements "range (window size 100)"
89− (Window.range 100)
89+ (Window.windowRange 100)
9090 , benchWithFold numElements "range (window size 1000)"
91− (Window.range 1000)
91+ (Window.windowRange 1000)
9292 , benchWith sourceDescendingInt numElements
9393 "range descending (window size 1000)"
94− (Window.range 1000)
94+ (Window.windowRange 1000)
9595
9696 , benchWithFoldInt numElements "sumInt (window size 100)"
97− (Ring.slidingWindow 100 Window.sumInt)
97+ (Ring.slidingWindow 100 Window.windowSumInt)
9898 , benchWithFoldInt numElements "sum for Int (window size 100)"
99− (Ring.slidingWindow 100 Window.sum)
99+ (Ring.slidingWindow 100 Window.windowSum)
100100 , benchWithFold numElements "sum (window size 100)"
101− (Ring.slidingWindow 100 Window.sum)
101+ (Ring.slidingWindow 100 Window.windowSum)
102102 , benchWithFold numElements "sum (window size 1000)"
103− (Ring.slidingWindow 1000 Window.sum)
103+ (Ring.slidingWindow 1000 Window.windowSum)
104104 , benchWithFold numElements "sum (entire stream)"
105− (Window.cumulative Window.sum)
105+ (Window.cumulative Window.windowSum)
106106 , benchWithFold numElements "sum (Data.Fold)"
107107 Fold.sum
108108
109109 , benchWithFold numElements "mean (window size 100)"
110− (Ring.slidingWindow 100 Window.mean)
110+ (Ring.slidingWindow 100 Window.windowMean)
111111 , benchWithFold numElements "mean (window size 1000)"
112− (Ring.slidingWindow 1000 Window.mean)
112+ (Ring.slidingWindow 1000 Window.windowMean)
113113 , benchWithFold numElements "mean (entire stream)"
114− (Window.cumulative Window.mean)
114+ (Window.cumulative Window.windowMean)
115115 , benchWithFold numElements "mean (Data.Fold)"
116116 Fold.mean
117117
118118 , benchWithFold numElements "powerSum 2 (window size 100)"
119− (Ring.slidingWindow 100 (Window.powerSum 2))
119+ (Ring.slidingWindow 100 (Window.windowPowerSum 2))
120120 , benchWithFold numElements "powerSum 2 (entire stream)"
121− (Window.cumulative (Window.powerSum 2))
121+ (Window.cumulative (Window.windowPowerSum 2))
122122
123123 ]
124− , bgroup
125− "scan"
124+ ]
125+
126+o_1_space_scans :: Int -> [Benchmark]
127+o_1_space_scans numElements =
128+ [ bgroup "scan"
126129 [ benchWithPostscan numElements "minimum (window size 10)"
127− (Window.minimum 10)
130+ (Window.windowMinimum 10)
128131 -- Below window size 30 the linear search based impl performs better
129132 -- than the dequeue based implementation.
130133 , benchWithPostscan numElements "minimum (window size 30)"
131− (Window.minimum 30)
134+ (Window.windowMinimum 30)
132135 , benchWithPostscan numElements "minimum (window size 1000)"
133− (Window.minimum 1000)
136+ (Window.windowMinimum 1000)
134137 , benchScanWith sourceDescendingInt numElements
135138 "minimum descending (window size 1000)"
136− (Window.minimum 1000)
139+ (Window.windowMinimum 1000)
137140
138141 , benchWithPostscan numElements "maximum (window size 10)"
139− (Window.maximum 10)
142+ (Window.windowMaximum 10)
140143 , benchWithPostscan numElements "maximum (window size 30)"
141− (Window.maximum 30)
144+ (Window.windowMaximum 30)
142145 , benchWithPostscan numElements "maximum (window size 1000)"
143− (Window.maximum 1000)
146+ (Window.windowMaximum 1000)
144147 , benchScanWith sourceDescendingInt numElements
145148 "maximum descending (window size 1000)"
146− (Window.maximum 1000)
149+ (Window.windowMaximum 1000)
147150
148151 , benchWithPostscan numElements "range (window size 10)"
149− (Window.range 10)
152+ (Window.windowRange 10)
150153 , benchWithPostscan numElements "range (window size 30)"
151− (Window.range 30)
154+ (Window.windowRange 30)
152155 , benchWithPostscan numElements "range (window size 1000)"
153− (Window.range 1000)
156+ (Window.windowRange 1000)
154157 , benchScanWith sourceDescendingInt numElements
155158 "range descending (window size 1000)"
156− (Window.range 1000)
159+ (Window.windowRange 1000)
157160
158161 , benchWithPostscan numElements "sum (window size 100)"
159− (Ring.slidingWindow 100 Window.sum)
162+ (Ring.slidingWindow 100 Window.windowSum)
160163 , benchWithPostscan numElements "sum (window size 1000)"
161− (Ring.slidingWindow 1000 Window.sum)
164+ (Ring.slidingWindow 1000 Window.windowSum)
162165
163166 , benchWithPostscan numElements "mean (window size 100)"
164− (Ring.slidingWindow 100 Window.mean)
167+ (Ring.slidingWindow 100 Window.windowMean)
165168 , benchWithPostscan numElements "mean (window size 1000)"
166− (Ring.slidingWindow 1000 Window.mean)
169+ (Ring.slidingWindow 1000 Window.windowMean)
167170
168171 , benchWithPostscan numElements "powerSum 2 (window size 100)"
169− (Ring.slidingWindow 100 (Window.powerSum 2))
172+ (Ring.slidingWindow 100 (Window.windowPowerSum 2))
170173 , benchWithPostscan numElements "powerSum 2 (window size 1000)"
171− (Ring.slidingWindow 1000 (Window.powerSum 2))
174+ (Ring.slidingWindow 1000 (Window.windowPowerSum 2))
172175 ]
173176 ]
177+
178+moduleName :: String
179+moduleName = "Data.Fold.Window"
180+
181+main :: IO ()
182+main = runWithCLIOpts defaultStreamSize allBenchmarks
183+
184+ where
185+
186+ allBenchmarks value =
187+ [ bgroup (o_1_space_prefix moduleName) $ concat
188+ [ o_1_space_folds value
189+ , o_1_space_scans value
190+ ]
191+ ]
benchmark/Streamly/Benchmark/Data/Array/Unboxed/Mut.hs → benchmark/Streamly/Benchmark/Data/MutArray.hsrenamed+23−17
@@ -1,3 +1,6 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+{-# OPTIONS_GHC -Wno-orphans #-}
3+
14-- |
25-- Module : Streamly.Benchmark.Data.Array.Unboxed.Mut
36-- Copyright : (c) 2021 Composewell Technologies
@@ -39,17 +42,21 @@ import Prelude
3942 , id
4043 , undefined
4144 )
45+import Streamly.Internal.Data.MutArray (MutArray)
4246
43−import qualified Streamly.Internal.Data.Array.Unboxed as Array
44−import qualified Streamly.Internal.Data.Array.Unboxed.Mut as MArray
47+import qualified Streamly.Internal.Data.Array as Array
48+import qualified Streamly.Internal.Data.MutArray as MArray
4549import qualified Streamly.Internal.Data.Fold as Fold
4650import qualified Streamly.Internal.Data.Stream as Stream
47−import qualified Streamly.Prelude as IsStream (scanl1')
4851
49−import Gauge
52+import Test.Tasty.Bench
5053import Streamly.Benchmark.Common hiding (benchPureSrc)
5154
52−type Stream = MArray.Array
55+type Stream = MutArray
56+
57+instance NFData (MutArray a) where
58+ {-# INLINE rnf #-}
59+ rnf _ = ()
5360
5461-------------------------------------------------------------------------------
5562-- Benchmark helpers
@@ -146,7 +153,7 @@ scanl' value n = composeN n $ onArray value $ Stream.scan (Fold.foldl' (+) 0)
146153
147154{-# INLINE scanl1' #-}
148155scanl1' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
149−scanl1' value n = composeN n $ onArray value $ IsStream.scanl1' (+)
156+scanl1' value n = composeN n $ onArray value $ Stream.scanl1' (+)
150157
151158{-# INLINE map #-}
152159map :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
@@ -158,7 +165,7 @@ onArray
158165 -> Stream Int
159166 -> m (Stream Int)
160167onArray value f arr =
161− Stream.fold (MArray.writeN value) $ f $ Stream.unfold MArray.read arr
168+ Stream.fold (MArray.writeN value) $ f $ Stream.unfold MArray.reader arr
162169
163170-------------------------------------------------------------------------------
164171-- Elimination
@@ -166,24 +173,23 @@ onArray value f arr =
166173
167174{-# INLINE unfoldReadDrain #-}
168175unfoldReadDrain :: MonadIO m => Stream Int -> m ()
169−unfoldReadDrain = drain . Stream.unfold MArray.read
176+unfoldReadDrain = drain . Stream.unfold MArray.reader
170177
171178{-# INLINE unfoldReadRevDrain #-}
172179unfoldReadRevDrain :: MonadIO m => Stream Int -> m ()
173−unfoldReadRevDrain = drain . Stream.unfold MArray.readRev
180+unfoldReadRevDrain = drain . Stream.unfold MArray.readerRev
174181
175182{-# INLINE toStreamDRevDrain #-}
176183toStreamDRevDrain :: MonadIO m => Stream Int -> m ()
177−toStreamDRevDrain =
178− drain . Stream.fromStreamD . MArray.toStreamDRev
184+toStreamDRevDrain = drain . MArray.readRev
179185
180186{-# INLINE toStreamDDrain #-}
181187toStreamDDrain :: MonadIO m => Stream Int -> m ()
182−toStreamDDrain = drain . Stream.fromStreamD . MArray.toStreamD
188+toStreamDDrain = drain . MArray.read
183189
184190{-# INLINE unfoldFold #-}
185191unfoldFold :: MonadIO m => Stream Int -> m Int
186−unfoldFold = Stream.fold (Fold.foldl' (+) 0) . Stream.unfold MArray.read
192+unfoldFold = Stream.fold (Fold.foldl' (+) 0) . Stream.unfold MArray.reader
187193
188194-------------------------------------------------------------------------------
189195-- Bench groups
@@ -244,7 +250,7 @@ o_1_space_transformationX4 value =
244250 ]
245251
246252o_1_space_serial_marray ::
247− Int -> (MArray.Array Int, Array.Array Int) -> [Benchmark]
253+ Int -> (MutArray Int, Array.Array Int) -> [Benchmark]
248254o_1_space_serial_marray value ~(array, indices) =
249255 [ benchIO' "partitionBy (< 0)" (const (return array))
250256 $ MArray.partitionBy (< 0)
@@ -259,8 +265,8 @@ o_1_space_serial_marray value ~(array, indices) =
259265 , benchIO' "strip (> 0)" (const (return array))
260266 $ MArray.strip (> 0)
261267 , benchIO' "modifyIndices (+ 1)" (const (return indices))
262− $ Stream.fold (MArray.modifyIndices (\_idx val -> val + 1) array)
263− . Stream.unfold Array.read
268+ $ Stream.fold (MArray.modifyIndices array (\_idx val -> val + 1))
269+ . Stream.unfold Array.reader
264270 ]
265271
266272-------------------------------------------------------------------------------
@@ -268,7 +274,7 @@ o_1_space_serial_marray value ~(array, indices) =
268274-------------------------------------------------------------------------------
269275
270276moduleName :: String
271−moduleName = "Data.Array.Unboxed.Mut"
277+moduleName = "Data.MutArray"
272278
273279main :: IO ()
274280main = do
benchmark/Streamly/Benchmark/Data/Parser.hs+497−150
@@ -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
@@ -8,39 +15,41 @@
815{-# LANGUAGE CPP #-}
916{-# LANGUAGE FlexibleContexts #-}
1017{-# LANGUAGE ScopedTypeVariables #-}
18+{-# OPTIONS_GHC -Wno-orphans #-}
1119
1220module Main
1321 (
1422 main
1523 ) where
1624
25+import Control.Applicative ((<|>))
1726import Control.DeepSeq (NFData(..))
18−import Control.Monad.Catch (MonadCatch, MonadThrow, try, SomeException)
19−import Data.Foldable (asum)
27+import Data.Function ((&))
2028import Data.Functor (($>))
21−import Data.Maybe (fromMaybe)
2229import Data.Monoid (Sum(..))
2330import GHC.Magic (inline)
2431import GHC.Magic (noinline)
2532import System.IO (Handle)
2633import System.Random (randomRIO)
34+import Streamly.Internal.Data.Fold (Fold(..))
35+import Streamly.Internal.Data.Parser
36+ (ParseError(..), Parser(..), Initial(..), Step(..))
37+import Streamly.Internal.Data.Stream (Stream)
2738import Prelude hiding
28− (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile)
39+ (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile, span)
2940
30−import qualified Data.Traversable as TR
31−import qualified Data.Foldable as F
3241import qualified Control.Applicative as AP
42+import qualified Data.Foldable as F
43+import qualified Data.Traversable as TR
3344import qualified Streamly.FileSystem.Handle as Handle
34−import qualified Streamly.Internal.Data.Array.Unboxed as Array
45+import qualified Streamly.Internal.Data.Array as Array
3546import qualified Streamly.Internal.Data.Fold as Fold
3647import qualified Streamly.Internal.Data.Parser as PR
37−import qualified Streamly.Internal.Data.Stream as Stream
38−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream (tail)
48+import qualified Streamly.Data.Stream as Stream
3949import qualified Streamly.Internal.Data.Producer as Producer
40−import qualified Streamly.Internal.Data.Producer.Source as Source
50+import qualified Streamly.Internal.Data.Stream as Stream
4151
42−import Gauge hiding (env)
43−import Streamly.Internal.Data.Stream (Stream)
52+import Test.Tasty.Bench hiding (env)
4453import Streamly.Benchmark.Common
4554import Streamly.Benchmark.Common.Handle
4655
@@ -111,38 +120,29 @@ benchIOSink value name f =
111120-- Parsers
112121-------------------------------------------------------------------------------
113122
114−{-# INLINE one #-}
115−one :: MonadThrow m => Int -> Stream m Int -> m (Maybe Int)
116−one value = Stream.parse p
117−
118− where
119−
120− p = do
121− m <- PR.fromFold Fold.one
122− case m of
123− Just i -> if i >= value then pure m else p
124− Nothing -> pure Nothing
125−
126123{-# INLINE takeBetween #-}
127−takeBetween :: MonadThrow m => Int -> Stream m a -> m ()
128−takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
124+takeBetween :: Monad m => Int -> Stream m a -> m (Either ParseError ())
125+takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
129126
130127{-# INLINE takeEQ #-}
131−takeEQ :: MonadThrow m => Int -> Stream m a -> m ()
128+takeEQ :: Monad m => Int -> Stream m a -> m (Either ParseError ())
132129takeEQ value = Stream.parse (PR.takeEQ value Fold.drain)
133130
131+{-# INLINE takeGE #-}
132+takeGE :: Monad m => Int -> Stream m a -> m (Either ParseError ())
133+takeGE value = Stream.parse (PR.takeGE value Fold.drain)
134+
134135{-# INLINE dropWhile #-}
135−dropWhile :: MonadThrow m => Int -> Stream m Int -> m ()
136+dropWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
136137dropWhile value = Stream.parse (PR.dropWhile (<= value))
137138
138139{-# INLINE takeStartBy #-}
139−takeStartBy :: MonadThrow m => Int -> Stream m Int -> m ()
140+takeStartBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
140141takeStartBy value stream = do
141− stream1 <- return . fromMaybe (Stream.fromPure (value + 1)) =<< IsStream.tail stream
142− let stream2 = value `Stream.cons` stream1
142+ let stream2 = value `Stream.cons` stream
143143 Stream.parse (PR.takeStartBy (== value) Fold.drain) stream2
144144
145−takeFramedByEsc_ :: MonadThrow m => Int -> Stream m Char -> m ()
145+takeFramedByEsc_ :: Monad m => Int -> Stream m Char -> m (Either ParseError ())
146146takeFramedByEsc_ _ = Stream.parse parser
147147
148148 where
@@ -153,88 +153,162 @@ takeFramedByEsc_ _ = Stream.parse parser
153153
154154 parser = PR.takeFramedByEsc_ isEsc isBegin isEnd Fold.drain
155155
156+{-# INLINE listEqBy #-}
157+listEqBy :: Int -> Stream IO Int -> IO (Either ParseError [Int])
158+listEqBy len = Stream.parse (PR.listEqBy (==) [1 .. len])
159+
160+{-# INLINE streamEqBy #-}
161+streamEqBy :: Int -> Stream IO Int -> IO (Either ParseError ())
162+streamEqBy len = Stream.parse (PR.streamEqBy (==) (Stream.enumerateFromTo 1 len))
163+
156164{-# INLINE takeWhile #-}
157−takeWhile :: MonadThrow m => Int -> Stream m Int -> m ()
165+takeWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
158166takeWhile value = Stream.parse (PR.takeWhile (<= value) Fold.drain)
159167
160−takeWhileP :: MonadThrow m => Int -> Stream m Int -> m ()
168+takeWhileP :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
161169takeWhileP value =
162170 Stream.parse (PR.takeWhileP (<= value) (PR.takeWhile (<= value - 1) Fold.drain))
163171
164172{-# INLINE takeP #-}
165−takeP :: MonadThrow m => Int -> Stream m a -> m ()
173+takeP :: Monad m => Int -> Stream m a -> m (Either ParseError ())
166174takeP value = Stream.parse (PR.takeP value (PR.fromFold Fold.drain))
167175
168176{-# INLINE groupBy #-}
169−groupBy :: MonadThrow m => Stream m Int -> m ()
177+groupBy :: Monad m => Stream m Int -> m (Either ParseError ())
170178groupBy = Stream.parse (PR.groupBy (<=) Fold.drain)
171179
172180{-# INLINE groupByRolling #-}
173−groupByRolling :: MonadThrow m => Stream m Int -> m ()
181+groupByRolling :: Monad m => Stream m Int -> m (Either ParseError ())
174182groupByRolling = Stream.parse (PR.groupByRolling (<=) Fold.drain)
175183
176184{-# INLINE wordBy #-}
177−wordBy :: MonadThrow m => Int -> Stream m Int -> m ()
185+wordBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
178186wordBy value = Stream.parse (PR.wordBy (>= value) Fold.drain)
179187
180188{-# INLINE sepByWords #-}
181−sepByWords :: MonadThrow m => Int -> Stream m Int -> m ()
182−sepByWords _ = Stream.parse (wrds even Fold.drain)
189+sepByWords :: Monad m => Stream m Int -> m (Either ParseError ())
190+sepByWords = Stream.parse (wrds even Fold.drain)
183191 where
184− wrds p f = PR.sepBy f (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
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)
185211
186212{-# INLINE deintercalate #-}
187−deintercalate :: MonadThrow m => Int -> Stream m Int -> m ()
213+deintercalate :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
188214deintercalate _ = Stream.parse (partition even)
189215
190216 where
191217
192218 partition p =
193219 PR.deintercalate
194− Fold.drain (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum)
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
195241
196242{-# INLINE manyWordByEven #-}
197−manyWordByEven :: MonadThrow m => Stream m Int -> m ()
243+manyWordByEven :: Monad m => Stream m Int -> m (Either ParseError ())
198244manyWordByEven = Stream.parse (PR.many (PR.wordBy even Fold.drain) Fold.drain)
199245
200246{-# INLINE many #-}
201−many :: MonadThrow m => Stream m Int -> m Int
247+many :: Monad m => Stream m Int -> m (Either ParseError Int)
202248many = Stream.parse (PR.many (PR.satisfy (> 0)) Fold.length)
203249
204250{-# INLINE manyAlt #-}
205−manyAlt :: MonadThrow m => Stream m Int -> m Int
251+manyAlt :: Monad m => Stream m Int -> m Int
206252manyAlt xs = do
207253 x <- Stream.parse (AP.many (PR.satisfy (> 0))) xs
208254 return $ Prelude.length x
209255
210256{-# INLINE some #-}
211−some :: MonadThrow m => Stream m Int -> m Int
257+some :: Monad m => Stream m Int -> m (Either ParseError Int)
212258some = Stream.parse (PR.some (PR.satisfy (> 0)) Fold.length)
213259
214260{-# INLINE someAlt #-}
215−someAlt :: MonadThrow m => Stream m Int -> m Int
261+someAlt :: Monad m => Stream m Int -> m Int
216262someAlt xs = do
217263 x <- Stream.parse (AP.some (PR.satisfy (> 0))) xs
218264 return $ Prelude.length x
219265
220266{-# INLINE manyTill #-}
221−manyTill :: MonadThrow m => Int -> Stream m Int -> m Int
267+manyTill :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
222268manyTill value =
223269 Stream.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) Fold.length)
224270
225−{-# INLINE splitAp #-}
226−splitAp :: MonadThrow m
227− => Int -> Stream m Int -> m ((), ())
228−splitAp value =
271+{-# INLINE splitAp2 #-}
272+splitAp2 :: Monad m
273+ => Int -> Stream m Int -> m (Either ParseError ((), ()))
274+splitAp2 value =
229275 Stream.parse
230276 ((,)
231277 <$> PR.dropWhile (<= (value `div` 2))
232278 <*> PR.dropWhile (<= value)
233279 )
234280
281+{-# INLINE splitAp4 #-}
282+splitAp4 :: Monad m
283+ => Int -> Stream m Int -> m (Either ParseError ())
284+splitAp4 value =
285+ Stream.parse
286+ ( (\() () () () -> ())
287+ <$> PR.dropWhile (<= (value * 1 `div` 4))
288+ <*> PR.dropWhile (<= (value * 2 `div` 4))
289+ <*> PR.dropWhile (<= (value * 3 `div` 4))
290+ <*> PR.dropWhile (<= value)
291+ )
292+
293+{-# INLINE splitAp8 #-}
294+splitAp8 :: Monad m
295+ => Int -> Stream m Int -> m (Either ParseError ())
296+splitAp8 value =
297+ Stream.parse
298+ ( (\() () () () () () () () -> ())
299+ <$> PR.dropWhile (<= (value * 1 `div` 8))
300+ <*> PR.dropWhile (<= (value * 2 `div` 8))
301+ <*> PR.dropWhile (<= (value * 3 `div` 8))
302+ <*> PR.dropWhile (<= (value * 4 `div` 8))
303+ <*> PR.dropWhile (<= (value * 5 `div` 8))
304+ <*> PR.dropWhile (<= (value * 6 `div` 8))
305+ <*> PR.dropWhile (<= (value * 7 `div` 8))
306+ <*> PR.dropWhile (<= value)
307+ )
308+
235309{-# INLINE splitApBefore #-}
236−splitApBefore :: MonadThrow m
237− => Int -> Stream m Int -> m ()
310+splitApBefore :: Monad m
311+ => Int -> Stream m Int -> m (Either ParseError ())
238312splitApBefore value =
239313 Stream.parse
240314 ( PR.dropWhile (<= (value `div` 2))
@@ -242,27 +316,27 @@ splitApBefore value =
242316 )
243317
244318{-# INLINE splitApAfter #-}
245−splitApAfter :: MonadThrow m
246− => Int -> Stream m Int -> m ()
319+splitApAfter :: Monad m
320+ => Int -> Stream m Int -> m (Either ParseError ())
247321splitApAfter value =
248322 Stream.parse
249323 ( PR.dropWhile (<= (value `div` 2))
250324 <* PR.dropWhile (<= value)
251325 )
252326
253−{-# INLINE serialWith #-}
254−serialWith :: MonadThrow m
255− => Int -> Stream m Int -> m ((), ())
256−serialWith value =
327+{-# INLINE splitWith2 #-}
328+splitWith2 :: Monad m
329+ => Int -> Stream m Int -> m (Either ParseError ((), ()))
330+splitWith2 value =
257331 Stream.parse
258− (PR.serialWith (,)
332+ (PR.splitWith (,)
259333 (PR.dropWhile (<= (value `div` 2)))
260334 (PR.dropWhile (<= value))
261335 )
262336
263337{-# INLINE split_ #-}
264−split_ :: MonadThrow m
265− => Int -> Stream m Int -> m ()
338+split_ :: Monad m
339+ => Int -> Stream m Int -> m (Either ParseError ())
266340split_ value =
267341 Stream.parse
268342 (PR.split_
@@ -270,14 +344,165 @@ split_ value =
270344 (PR.dropWhile (<= value))
271345 )
272346
347+-- XXX dropWhile with applicative does not fuse
348+-- PR.dropWhile (<= (value * 1 `div` 4)) *> PR.die "alt"
349+{-# INLINE takeWhileFail #-}
350+takeWhileFail :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
351+takeWhileFail predicate (Fold fstep finitial _ ffinal) =
352+ Parser step initial extract
353+
354+ where
355+
356+ initial = do
357+ res <- finitial
358+ return $ case res of
359+ Fold.Partial s -> IPartial s
360+ Fold.Done b -> IDone b
361+
362+ step s a =
363+ if predicate a
364+ then do
365+ fres <- fstep s a
366+ return
367+ $ case fres of
368+ Fold.Partial s1 -> Partial 0 s1
369+ Fold.Done b -> Done 0 b
370+ else return $ Error "fail"
371+
372+ extract s = fmap (Done 0) (ffinal s)
373+
374+{-# INLINE alt2 #-}
375+alt2 :: Monad m
376+ => Int -> Stream m Int -> m (Either ParseError ())
377+alt2 value =
378+ Stream.parse
379+ (PR.alt
380+ (takeWhileFail (<= (value `div` 2)) Fold.drain)
381+ (PR.dropWhile (<= value))
382+ )
383+
384+{-# INLINE alt4 #-}
385+alt4 :: Monad m
386+ => Int -> Stream m Int -> m (Either ParseError ())
387+alt4 value =
388+ Stream.parse
389+ ( takeWhileFail (<= (value * 1 `div` 4)) Fold.drain
390+ <|> takeWhileFail (<= (value * 2 `div` 4)) Fold.drain
391+ <|> takeWhileFail (<= (value * 3 `div` 4)) Fold.drain
392+ <|> PR.dropWhile (<= value)
393+ )
394+
395+{-# INLINE alt8 #-}
396+alt8 :: Monad m
397+ => Int -> Stream m Int -> m (Either ParseError ())
398+alt8 value =
399+ Stream.parse
400+ ( takeWhileFail (<= (value * 1 `div` 8)) Fold.drain
401+ <|> takeWhileFail (<= (value * 2 `div` 8)) Fold.drain
402+ <|> takeWhileFail (<= (value * 3 `div` 8)) Fold.drain
403+ <|> takeWhileFail (<= (value * 4 `div` 8)) Fold.drain
404+ <|> takeWhileFail (<= (value * 5 `div` 8)) Fold.drain
405+ <|> takeWhileFail (<= (value * 6 `div` 8)) Fold.drain
406+ <|> takeWhileFail (<= (value * 7 `div` 8)) Fold.drain
407+ <|> PR.dropWhile (<= value)
408+ )
409+
410+{-# INLINE alt16 #-}
411+alt16 :: Monad m
412+ => Int -> Stream m Int -> m (Either ParseError ())
413+alt16 value =
414+ Stream.parse
415+ ( takeWhileFail (<= (value * 1 `div` 16)) Fold.drain
416+ <|> takeWhileFail (<= (value * 2 `div` 16)) Fold.drain
417+ <|> takeWhileFail (<= (value * 3 `div` 16)) Fold.drain
418+ <|> takeWhileFail (<= (value * 4 `div` 16)) Fold.drain
419+ <|> takeWhileFail (<= (value * 5 `div` 16)) Fold.drain
420+ <|> takeWhileFail (<= (value * 6 `div` 16)) Fold.drain
421+ <|> takeWhileFail (<= (value * 8 `div` 16)) Fold.drain
422+ <|> takeWhileFail (<= (value * 9 `div` 16)) Fold.drain
423+ <|> takeWhileFail (<= (value * 10 `div` 16)) Fold.drain
424+ <|> takeWhileFail (<= (value * 11 `div` 16)) Fold.drain
425+ <|> takeWhileFail (<= (value * 12 `div` 16)) Fold.drain
426+ <|> takeWhileFail (<= (value * 13 `div` 16)) Fold.drain
427+ <|> takeWhileFail (<= (value * 14 `div` 16)) Fold.drain
428+ <|> takeWhileFail (<= (value * 15 `div` 16)) Fold.drain
429+ <|> PR.dropWhile (<= value)
430+ )
431+
432+{-# INLINE altSmall #-}
433+altSmall :: Monad m
434+ => Int -> Stream m Int -> m ()
435+altSmall value =
436+ Stream.fold Fold.drain .
437+ Stream.parseMany
438+ (PR.alt
439+ (PR.satisfy (>= value) *> PR.die "alt")
440+ (PR.satisfy (<= value))
441+ )
442+
443+{-# INLINE monad #-}
444+monad :: Monad m
445+ => Int -> Stream m Int -> m (Either ParseError ())
446+monad value =
447+ Stream.parse
448+ $ do
449+ PR.dropWhile (<= (value `div` 2))
450+ PR.dropWhile (<= value)
451+
452+{-# INLINE monad4 #-}
453+monad4 :: Monad m
454+ => Int -> Stream m Int -> m (Either ParseError ())
455+monad4 value =
456+ Stream.parse $ do
457+ PR.dropWhile (<= (value `div` 4))
458+ PR.dropWhile (<= (value `div` 2))
459+ PR.dropWhile (<= (value * 3 `div` 4))
460+ PR.dropWhile (<= value)
461+
462+{-# INLINE monad8 #-}
463+monad8 :: Monad m
464+ => Int -> Stream m Int -> m (Either ParseError ())
465+monad8 value =
466+ Stream.parse $ do
467+ PR.dropWhile (<= (value * 1 `div` 8))
468+ PR.dropWhile (<= (value * 2 `div` 8))
469+ PR.dropWhile (<= (value * 3 `div` 8))
470+ PR.dropWhile (<= (value * 4 `div` 8))
471+ PR.dropWhile (<= (value * 5 `div` 8))
472+ PR.dropWhile (<= (value * 6 `div` 8))
473+ PR.dropWhile (<= (value * 7 `div` 8))
474+ PR.dropWhile (<= value)
475+
476+{-# INLINE monad16 #-}
477+monad16 :: Monad m
478+ => Int -> Stream m Int -> m (Either ParseError ())
479+monad16 value =
480+ Stream.parse $ do
481+ PR.dropWhile (<= (value * 1 `div` 16))
482+ PR.dropWhile (<= (value * 2 `div` 16))
483+ PR.dropWhile (<= (value * 3 `div` 16))
484+ PR.dropWhile (<= (value * 4 `div` 16))
485+ PR.dropWhile (<= (value * 5 `div` 16))
486+ PR.dropWhile (<= (value * 6 `div` 16))
487+ PR.dropWhile (<= (value * 7 `div` 16))
488+ PR.dropWhile (<= (value * 8 `div` 16))
489+ PR.dropWhile (<= (value * 9 `div` 16))
490+ PR.dropWhile (<= (value * 10 `div` 16))
491+ PR.dropWhile (<= (value * 11 `div` 16))
492+ PR.dropWhile (<= (value * 12 `div` 16))
493+ PR.dropWhile (<= (value * 13 `div` 16))
494+ PR.dropWhile (<= (value * 14 `div` 16))
495+ PR.dropWhile (<= (value * 15 `div` 16))
496+ PR.dropWhile (<= value)
497+
273498{-# INLINE takeEndBy_ #-}
274−takeEndBy_ :: MonadThrow m
275− => Int -> Stream m Int -> m()
499+takeEndBy_ :: Monad m
500+ => Int -> Stream m Int -> m (Either ParseError ())
276501takeEndBy_ value = Stream.parse (PR.takeEndBy_ (>= value) (PR.fromFold Fold.drain))
277502
278503{-
279504{-# INLINE teeAllAny #-}
280−teeAllAny :: MonadThrow m
505+teeAllAny :: Monad m
281506 => Int -> Stream m Int -> m ((), ())
282507teeAllAny value =
283508 Stream.parse
@@ -287,7 +512,7 @@ teeAllAny value =
287512 )
288513
289514{-# INLINE teeFstAllAny #-}
290−teeFstAllAny :: MonadThrow m
515+teeFstAllAny :: Monad m
291516 => Int -> Stream m Int -> m ((), ())
292517teeFstAllAny value =
293518 Stream.parse
@@ -297,8 +522,8 @@ teeFstAllAny value =
297522 )
298523
299524{-# INLINE shortestAllAny #-}
300−shortestAllAny :: MonadThrow m
301− => Int -> Stream m Int -> m ()
525+shortestAllAny :: Monad m
526+ => Int -> Stream m Int -> m (Either ParseError ())
302527shortestAllAny value =
303528 Stream.parse
304529 (PR.shortest
@@ -307,8 +532,8 @@ shortestAllAny value =
307532 )
308533
309534{-# INLINE longestAllAny #-}
310−longestAllAny :: MonadThrow m
311− => Int -> Stream m Int -> m ()
535+longestAllAny :: Monad m
536+ => Int -> Stream m Int -> m (Either ParseError ())
312537longestAllAny value =
313538 Stream.parse
314539 (PR.longest
@@ -317,28 +542,30 @@ longestAllAny value =
317542 )
318543-}
319544
545+-------------------------------------------------------------------------------
546+-- Spanning
547+-------------------------------------------------------------------------------
548+
549+{-# INLINE span #-}
550+span :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
551+span value = Stream.parse (PR.span (<= (value `div` 2)) Fold.drain Fold.drain)
552+
553+{-# INLINE spanBy #-}
554+spanBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
555+spanBy value =
556+ Stream.parse (PR.spanBy (\_ i -> i <= (value `div` 2)) Fold.drain Fold.drain)
557+
558+{-# INLINE spanByRolling #-}
559+spanByRolling :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
560+spanByRolling value =
561+ Stream.parse (PR.spanByRolling (\_ i -> i <= value `div` 2) Fold.drain Fold.drain)
562+
320563parseManyChunksOfSum :: Int -> Handle -> IO Int
321564parseManyChunksOfSum n inh =
322565 Stream.fold Fold.length
323566 $ Stream.parseMany
324567 (PR.fromFold $ Fold.take n Fold.sum)
325− (Stream.unfold Handle.read inh)
326−
327−-------------------------------------------------------------------------------
328−-- Parsing with unfolds
329−-------------------------------------------------------------------------------
330−
331−{-# INLINE parseManyUnfoldArrays #-}
332−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
333−parseManyUnfoldArrays count arrays = do
334− let src = Source.source (Just (Producer.OuterLoop arrays))
335− let parser = PR.fromFold (Fold.take count Fold.drain)
336− let readSrc =
337− Source.producer
338− $ Producer.concat Producer.fromList Array.producer
339− let streamParser =
340− Producer.simplify (Source.parseMany parser readSrc)
341− Stream.fold Fold.drain $ Stream.unfold streamParser src
568+ (Stream.unfold Handle.reader inh)
342569
343570-------------------------------------------------------------------------------
344571-- Parsers in which -fspec-constr-recursive=16 is problematic
@@ -349,82 +576,129 @@ parseManyUnfoldArrays count arrays = do
349576-- not have to rely on it.
350577--
351578{-# INLINE lookAhead #-}
352−lookAhead :: MonadThrow m => Int -> Stream m Int -> m ()
579+lookAhead :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
353580lookAhead value =
354581 Stream.parse (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
355582
583+-- XXX The timing of this increased 3x after the stepify extract changes.
584+{-# INLINE sequenceA_ #-}
585+sequenceA_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
586+sequenceA_ value =
587+ Stream.parse (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
588+
589+-- quadratic complexity
356590{-# INLINE sequenceA #-}
357−sequenceA :: MonadThrow m => Int -> Stream m Int -> m Int
591+sequenceA :: Monad m => Int -> Stream m Int -> m Int
358592sequenceA value xs = do
359593 x <- Stream.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
360594 return $ length x
361595
362−{-# INLINE sequenceA_ #-}
363−sequenceA_ :: MonadThrow m => Int -> Stream m Int -> m ()
364−sequenceA_ value =
365− Stream.parse (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
366−
596+-- quadratic complexity
367597{-# INLINE sequence #-}
368−sequence :: MonadThrow m => Int -> Stream m Int -> m Int
598+sequence :: Monad m => Int -> Stream m Int -> m Int
369599sequence value xs = do
370600 x <- Stream.parse (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
371601 return $ length x
372602
373603{-# INLINE sequence_ #-}
374−sequence_ :: MonadThrow m => Int -> Stream m Int -> m ()
375−sequence_ value =
376− Stream.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
377607
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+--
378616{-# INLINE choiceAsum #-}
379−choiceAsum :: MonadThrow m => Int -> Stream m Int -> m Int
617+choiceAsum :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
380618choiceAsum value =
381− Stream.parse (asum (replicate value (PR.satisfy (< 0)))
619+ Stream.parse (F.asum (replicate value (PR.satisfy (< 0)))
382620 AP.<|> PR.satisfy (> 0))
383621
384622{-
385623{-# INLINE choice #-}
386−choice :: MonadThrow m => Int -> Stream m Int -> m Int
624+choice :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
387625choice value =
388626 Stream.parse
389627 (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
390628-}
391629
630+-------------------------------------------------------------------------------
631+-- Parsing with unfolds
632+-------------------------------------------------------------------------------
633+
634+{-# INLINE parseManyUnfoldArrays #-}
635+parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
636+parseManyUnfoldArrays count arrays = do
637+ let src = Producer.source (Just (Producer.OuterLoop arrays))
638+ let parser = PR.fromFold (Fold.take count Fold.drain)
639+ let readSrc =
640+ Producer.producer
641+ $ Producer.concat Producer.fromList Array.producer
642+ let streamParser =
643+ Producer.simplify (Producer.parseMany parser readSrc)
644+ Stream.fold Fold.drain $ Stream.unfold streamParser src
645+
392646-------------------------------------------------------------------------------
393647-- Stream transformation
394648-------------------------------------------------------------------------------
395649
396650{-# INLINE parseMany #-}
397−parseMany :: MonadThrow m => Int -> Stream m Int -> m ()
651+parseMany :: Monad m => Int -> Stream m Int -> m ()
398652parseMany n =
399653 Stream.fold Fold.drain
400654 . fmap getSum
401− . Stream.parseMany (PR.fromFold $ Fold.take n Fold.mconcat)
655+ . Stream.catRights . Stream.parseMany (PR.fromFold $ Fold.take n Fold.mconcat)
402656 . fmap Sum
403657
658+{-# INLINE parseManyGroupBy #-}
659+parseManyGroupBy :: Monad m => (Int -> Int -> Bool) -> Stream m Int -> m ()
660+parseManyGroupBy cmp =
661+ Stream.fold Fold.drain . Stream.parseMany (PR.groupBy cmp Fold.drain)
662+
663+{-# INLINE parseManyGroupsRolling #-}
664+parseManyGroupsRolling :: Monad m => Bool -> Stream m Int -> m ()
665+parseManyGroupsRolling b =
666+ Stream.fold Fold.drain
667+ . Stream.parseMany (PR.groupByRolling (\_ _ -> b) Fold.drain)
668+
669+{-# INLINE parseManyGroupsRollingEither #-}
670+parseManyGroupsRollingEither :: Monad m =>
671+ (Int -> Int -> Bool) -> Int -> m ()
672+parseManyGroupsRollingEither cmp value = do
673+ sourceUnfoldrM value 1
674+ & Stream.parseMany (PR.groupByRollingEither cmp Fold.drain Fold.drain)
675+ & Stream.fold Fold.drain
676+
677+{-# INLINE parseManyGroupsRollingEitherAlt #-}
678+parseManyGroupsRollingEitherAlt :: Monad m =>
679+ (Int -> Int -> Bool) -> Int -> m ()
680+parseManyGroupsRollingEitherAlt cmp value = do
681+ sourceUnfoldrM value 1
682+ -- Make the input unsorted.
683+ & fmap (\x -> if even x then x + 2 else x)
684+ & Stream.parseMany (PR.groupByRollingEither cmp Fold.drain Fold.drain)
685+ & Stream.fold Fold.drain
686+
404687{-# INLINE parseIterate #-}
405−parseIterate :: MonadThrow m => Int -> Stream m Int -> m ()
688+parseIterate :: Monad m => Int -> Stream m Int -> m ()
406689parseIterate n =
407690 Stream.fold Fold.drain
408691 . fmap getSum
409− . Stream.parseIterate (PR.fromFold . Fold.take n . Fold.sconcat) (Sum 0)
692+ . Stream.catRights
693+ . Stream.parseIterate
694+ (PR.fromFold . Fold.take n . Fold.sconcat)
695+ (Sum 0)
410696 . fmap Sum
411697
412−{-# INLINE parseBreak #-}
413−parseBreak :: MonadCatch m => Stream m Int -> m ()
414−parseBreak s = do
415− r <- try $ Stream.parseBreak PR.one s
416− case r of
417− Left (_ :: SomeException) -> return ()
418− Right (_, s1) -> parseBreak s1
419−
420698{-# INLINE concatSequence #-}
421−concatSequence :: MonadThrow m => Stream m Int -> m ()
422−concatSequence = Stream.parse $ PR.concatSequence Fold.drain $ Stream.repeat PR.one
423−
424−{-# INLINE parseManyGroupBy #-}
425−parseManyGroupBy :: MonadThrow m => (Int -> Int -> Bool) -> Stream m Int -> m ()
426−parseManyGroupBy cmp =
427− Stream.fold Fold.drain . Stream.parseMany (PR.groupBy cmp Fold.drain)
699+concatSequence :: Monad m => Stream m Int -> m (Either ParseError ())
700+concatSequence =
701+ Stream.parse $ PR.sequence (Stream.repeat PR.one) Fold.drain
428702
429703-------------------------------------------------------------------------------
430704-- Benchmarks
@@ -433,48 +707,90 @@ parseManyGroupBy cmp =
433707moduleName :: String
434708moduleName = "Data.Parser"
435709
710+instance NFData ParseError where
711+ {-# INLINE rnf #-}
712+ rnf (ParseError x) = rnf x
713+
436714o_1_space_serial :: Int -> [Benchmark]
437715o_1_space_serial value =
438− [ benchIOSink value "one (fold)" $ one value
439− , benchIOSink value "takeBetween" $ takeBetween value
440− , benchIOSink value "takeEQ" $ takeEQ value
716+ [ benchIOSink value "takeBetween" $ takeBetween value
441717 , benchIOSink value "takeWhile" $ takeWhile value
442718 , benchIOSink value "takeWhileP" $ takeWhileP value
443719 , benchIOSink value "takeP" $ takeP value
444720 , benchIOSink value "dropWhile" $ dropWhile value
445721 , benchIOSink value "takeStartBy" $ takeStartBy value
446− , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
447− $ takeFramedByEsc_ value
722+ , benchIOSink value "takeEndBy_" $ takeEndBy_ value
448723 , benchIOSink value "groupBy" $ groupBy
449724 , benchIOSink value "groupByRolling" $ groupByRolling
450725 , benchIOSink value "wordBy" $ wordBy value
451− , benchIOSink value "sepBy (words)" $ sepByWords value
726+ , benchIOSink value "sepBy (words)" sepByWords
727+ , benchIOSink value "sepByAll (words)" sepByAllWords
728+ , benchIOSink value "sepBy1 (words)" sepByWords1
452729 , benchIOSink value "deintercalate" $ deintercalate value
453− , benchIOSink value "splitAp" $ splitAp value
730+ , benchIOSink value "deintercalate1" $ deintercalate1 value
731+ , benchIOSink value "deintercalateAll" $ deintercalateAll value
732+ -- Applicative and Monad
733+ , benchIOSink value "splitAp2" $ splitAp2 value
734+ , benchIOSink value "splitAp4" $ splitAp4 value
735+ , benchIOSink value "splitAp8" $ splitAp8 value
454736 , benchIOSink value "splitApBefore" $ splitApBefore value
455737 , benchIOSink value "splitApAfter" $ splitApAfter value
456− , benchIOSink value "serialWith" $ serialWith value
457− , benchIOSink value "takeEndBy_" $ takeEndBy_ 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
458751 , benchIOSink value "many" many
459752 , benchIOSink value "many (wordBy even)" $ manyWordByEven
460753 , benchIOSink value "some" some
461754 , benchIOSink value "manyTill" $ manyTill value
755+ , benchIOSink value "parseMany" $ parseMany value
756+ , benchIOSink value "parseMany (take 1)" (parseMany 1)
757+ , benchIOSink value "parseMany (take all)" (parseMany value)
758+ , benchIOSink value "parseMany (groupBy (<))" (parseManyGroupBy (<))
759+ , benchIOSink value "parseMany (groupBy (==))" (parseManyGroupBy (==))
760+ , benchIOSink value "parseMany groupRollingBy (bound groups)"
761+ $ parseManyGroupsRolling False
762+ , benchIOSink value "parseMany groupRollingBy (1 group)"
763+ $ parseManyGroupsRolling True
764+ , bench "parseMany groupRollingByEither (Left)"
765+ $ nfIO $ parseManyGroupsRollingEitherLeft
766+ , bench "parseMany groupRollingByEither (Right)"
767+ $ nfIO $ parseManyGroupsRollingEitherRight
768+ , bench "parseMany groupRollingByEither (Alternating)"
769+ $ nfIO $ parseManyGroupsRollingEitherAlt1
770+ , benchIOSink value "parseIterate (take 1)" (parseIterate 1)
771+ , benchIOSink value "parseIterate (take all)" (parseIterate value)
772+ , benchIOSink value "concatSequence" concatSequence
462773 {-
463774 , benchIOSink value "tee" $ teeAllAny value
464775 , benchIOSink value "teeFst" $ teeFstAllAny value
465776 , benchIOSink value "shortest" $ shortestAllAny value
466777 , benchIOSink value "longest" $ longestAllAny value
467778 -}
468− , benchIOSink value "parseBreak (recursive)" parseBreak
469− , benchIOSink value "parseMany (take 1)" (parseMany 1)
470− , benchIOSink value "parseMany (take all)" (parseMany value)
471− , benchIOSink value "parseIterate (take 1)" (parseIterate 1)
472− , benchIOSink value "parseIterate (take all)" (parseIterate value)
473− , benchIOSink value "concatSequence" concatSequence
474− , benchIOSink value "parseMany (groupBy (<))" (parseManyGroupBy (<))
475− , benchIOSink value "parseMany (groupBy (==))" (parseManyGroupBy (==))
779+ , benchIOSink value "streamEqBy" (streamEqBy value)
476780 ]
477781
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+
478794o_1_space_filesystem :: BenchEnv -> [Benchmark]
479795o_1_space_filesystem env =
480796 [ mkBench ("S.parseMany (Fold.take " ++ show (bigSize env) ++ " Fold.sum)") env
@@ -494,26 +810,38 @@ o_1_space_serial_unfold bound arrays =
494810o_n_heap_serial :: Int -> [Benchmark]
495811o_n_heap_serial value =
496812 [
813+ benchIOSink value "takeEQ" $ takeEQ value
814+ , benchIOSink value "takeGE" $ takeGE value
815+
497816 -- lookahead benchmark holds the entire input till end
498− benchIOSink value "lookAhead" $ lookAhead value
817+ , benchIOSink value "lookAhead" $ lookAhead value
499818
500− -- accumulates the results in a list
501− , benchIOSink value "sequence" $ sequence value
502− , benchIOSink value "sequenceA" $ sequenceA value
819+ -- o-n-heap because of backtracking
820+ , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
821+ $ takeFramedByEsc_ value
503822
504− -- XXX why should this take O(n) heap, it discards the results?
505− , benchIOSink value "sequence_" $ sequence_ value
506− , benchIOSink value "sequenceA_" $ sequenceA_ value
507823 -- non-linear time complexity (parserD)
508824 , benchIOSink value "split_" $ split_ value
509− -- XXX why O(n) heap?
510− , benchIOSink value "choice (asum)" $ choiceAsum value
511− -- , benchIOSink value "choice" $ choice value
825+ -- XXX Takes lot of space when run on a long stream, why?
826+ , benchIOSink value "monad16" $ monad16 value
512827
513828 -- These show non-linear time complexity.
514829 -- They accumulate the results in a list.
830+ , benchIOSink value "sepBy1" sepBy1
515831 , benchIOSink value "manyAlt" manyAlt
516832 , 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)
517845 ]
518846
519847-------------------------------------------------------------------------------
@@ -522,12 +850,13 @@ o_n_heap_serial value =
522850
523851main :: IO ()
524852main = do
853+#ifndef FUSION_CHECK
525854 env <- mkHandleBenchEnv
526855 runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
527856
528857 where
529858
530− alloc value = Stream.fold Fold.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
859+ alloc value = Stream.fold Fold.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
531860
532861 allBenchmarks env arrays value =
533862 [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
@@ -537,4 +866,22 @@ main = do
537866 , bgroup (o_1_space_prefix moduleName)
538867 (o_1_space_serial_unfold value arrays)
539868 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
869+ , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
540870 ]
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−445
@@ -1,445 +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 (MonadThrow)
19−import Data.Foldable (asum)
20−import Data.Function ((&))
21−import Data.Functor (($>))
22−import Data.Maybe (fromMaybe)
23−import Streamly.Internal.Data.Stream (Stream)
24−import System.Random (randomRIO)
25−import Prelude hiding (any, all, take, sequence, sequenceA, sequence_, takeWhile, span)
26−
27−import qualified Data.Traversable as TR
28−import qualified Data.Foldable as F
29−import qualified Control.Applicative as AP
30−import qualified Streamly.Internal.Data.Array.Unboxed as Array
31−import qualified Streamly.Internal.Data.Fold as Fold
32−import qualified Streamly.Internal.Data.Parser.ParserD as PR
33−import qualified Streamly.Internal.Data.Producer as Producer
34−import qualified Streamly.Internal.Data.Producer.Source as Source
35−import qualified Streamly.Internal.Data.Stream as Stream
36−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream (tail)
37−import qualified Streamly.Internal.Data.Stream.StreamD as D
38−
39−import Gauge
40−import Streamly.Benchmark.Common
41−
42−-------------------------------------------------------------------------------
43−-- Utilities
44−-------------------------------------------------------------------------------
45−
46−-- XXX these can be moved to the common module
47−
48−{-# INLINE sourceUnfoldrM #-}
49−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
50−sourceUnfoldrM value n = Stream.unfoldrM step n
51− where
52− step cnt =
53− if cnt > n + value
54− then return Nothing
55− else return (Just (cnt, cnt + 1))
56−
57−-- | Takes a fold method, and uses it with a default source.
58−{-# INLINE benchIOSink #-}
59−benchIOSink
60− :: (NFData b)
61− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
62−benchIOSink value name f =
63− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
64−
65−-------------------------------------------------------------------------------
66−-- Parsers
67−-------------------------------------------------------------------------------
68−
69−{-# INLINE drainWhile #-}
70−drainWhile :: MonadThrow m => (a -> Bool) -> PR.Parser m a ()
71−drainWhile p = PR.takeWhile p Fold.drain
72−
73−{-# INLINE takeStartBy #-}
74−takeStartBy :: MonadThrow m => Int -> Stream m Int -> m ()
75−takeStartBy value stream = do
76− stream1 <- return . fromMaybe (Stream.fromPure (value + 1)) =<< IsStream.tail stream
77− let stream2 = value `Stream.cons` stream1
78− Stream.parseD (PR.takeStartBy (== value) Fold.drain) stream2
79−
80−{-# INLINE takeWhile #-}
81−takeWhile :: MonadThrow m => Int -> Stream m Int -> m ()
82−takeWhile value = Stream.parseD (drainWhile (<= value))
83−
84−{-# INLINE takeP #-}
85−takeP :: MonadThrow m => Int -> Stream m a -> m ()
86−takeP value = Stream.parseD (PR.takeP value (PR.fromFold Fold.drain))
87−
88−{-# INLINE takeBetween #-}
89−takeBetween :: MonadThrow m => Int -> Stream m a -> m ()
90−takeBetween value = Stream.parseD (PR.takeBetween 0 value Fold.drain)
91−
92−{-# INLINE groupBy #-}
93−groupBy :: MonadThrow m => Stream m Int -> m ()
94−groupBy = Stream.parseD (PR.groupBy (<=) Fold.drain)
95−
96−{-# INLINE groupByRolling #-}
97−groupByRolling :: MonadThrow m => Stream m Int -> m ()
98−groupByRolling = Stream.parseD (PR.groupByRolling (<=) Fold.drain)
99−
100−{-# INLINE wordBy #-}
101−wordBy :: MonadThrow m => Int -> Stream m Int -> m ()
102−wordBy value = Stream.parseD (PR.wordBy (>= value) Fold.drain)
103−
104−{-# INLINE manyWordByEven #-}
105−manyWordByEven :: MonadThrow m => Stream m Int -> m ()
106−manyWordByEven =
107− Stream.parseD (PR.many (PR.wordBy (Prelude.even) Fold.drain) Fold.drain)
108−
109−{-# INLINE many #-}
110−many :: MonadThrow m => Stream m Int -> m Int
111−many = Stream.parseD (PR.many (PR.satisfy (> 0)) Fold.length)
112−
113−{-# INLINE manyAlt #-}
114−manyAlt :: MonadThrow m => Stream m Int -> m Int
115−manyAlt xs = do
116− x <- Stream.parseD (AP.many (PR.satisfy (> 0))) xs
117− return $ Prelude.length x
118−
119−{-# INLINE some #-}
120−some :: MonadThrow m => Stream m Int -> m Int
121−some = Stream.parseD (PR.some (PR.satisfy (> 0)) Fold.length)
122−
123−{-# INLINE someAlt #-}
124−someAlt :: MonadThrow m => Stream m Int -> m Int
125−someAlt xs = do
126− x <- Stream.parseD (AP.some (PR.satisfy (> 0))) xs
127− return $ Prelude.length x
128−
129−{-#INLINE takeEndBy_ #-}
130−takeEndBy_ :: MonadThrow m => Int -> Stream m Int -> m ()
131−takeEndBy_ value = Stream.parseD (PR.takeEndBy_ (>= value) (PR.fromFold Fold.drain))
132−
133−{-# INLINE manyTill #-}
134−manyTill :: MonadThrow m => Int -> Stream m Int -> m Int
135−manyTill value =
136− let p = PR.satisfy (> 0)
137− pcond = PR.satisfy (== value)
138− in Stream.parseD (PR.manyTill Fold.length p pcond)
139−
140−{-# INLINE serialWith #-}
141−serialWith :: MonadThrow m
142− => Int -> Stream m Int -> m ((), ())
143−serialWith value =
144− Stream.parseD
145− ((,)
146− <$> drainWhile (<= (value `div` 2))
147− <*> drainWhile (<= value)
148− )
149−
150−{-
151−{-# INLINE teeAllAny #-}
152−teeAllAny :: MonadThrow m
153− => Int -> Stream m Int -> m ((), ())
154−teeAllAny value =
155− Stream.parseD
156− (PR.teeWith (,)
157− (drainWhile (<= value))
158− (drainWhile (<= value))
159− )
160−
161−{-# INLINE teeFstAllAny #-}
162−teeFstAllAny :: MonadThrow m
163− => Int -> Stream m Int -> m ((), ())
164−teeFstAllAny value =
165− Stream.parseD
166− (PR.teeWithFst (,)
167− (drainWhile (<= value))
168− (drainWhile (<= value))
169− )
170−
171−{-# INLINE shortestAllAny #-}
172−shortestAllAny :: MonadThrow m
173− => Int -> Stream m Int -> m ()
174−shortestAllAny value =
175− Stream.parseD
176− (PR.shortest
177− (drainWhile (<= value))
178− (drainWhile (<= value))
179− )
180−
181−{-# INLINE longestAllAny #-}
182−longestAllAny :: MonadThrow m
183− => Int -> Stream m Int -> m ()
184−longestAllAny value =
185− Stream.parseD
186− (PR.longest
187− (drainWhile (<= value))
188− (drainWhile (<= value))
189− )
190−-}
191−
192−{-# INLINE sequenceParser #-}
193−sequenceParser :: MonadThrow m => Stream m Int -> m ()
194−sequenceParser = Stream.parseD (PR.sequence Fold.drain (D.repeat (PR.satisfy $ const True)))
195−
196−-------------------------------------------------------------------------------
197−-- Spanning
198−-------------------------------------------------------------------------------
199−
200−{-# INLINE span #-}
201−span :: MonadThrow m => Int -> Stream m Int -> m ((), ())
202−span value = Stream.parseD (PR.span (<= (value `div` 2)) Fold.drain Fold.drain)
203−
204−{-# INLINE spanBy #-}
205−spanBy :: MonadThrow m => Int -> Stream m Int -> m ((), ())
206−spanBy value =
207− Stream.parseD (PR.spanBy (\_ i -> i <= (value `div` 2)) Fold.drain Fold.drain)
208−
209−{-# INLINE spanByRolling #-}
210−spanByRolling :: MonadThrow m => Int -> Stream m Int -> m ((), ())
211−spanByRolling value =
212− Stream.parseD (PR.spanByRolling (\_ i -> i <= value `div` 2) Fold.drain Fold.drain)
213−
214−-------------------------------------------------------------------------------
215−-- Nested
216−-------------------------------------------------------------------------------
217−
218−{-# INLINE parseMany #-}
219−parseMany :: MonadThrow m => Int -> Stream m Int -> m ()
220−parseMany value = Stream.fold Fold.drain . Stream.parseManyD (drainWhile (<= value + 1))
221−
222−{-# INLINE parseManyGroups #-}
223−parseManyGroups :: MonadThrow m => Bool -> Stream m Int -> m ()
224−parseManyGroups b = Stream.fold Fold.drain . Stream.parseManyD (PR.groupBy (\_ _ -> b) Fold.drain)
225−
226−{-# INLINE parseManyGroupsRolling #-}
227−parseManyGroupsRolling :: MonadThrow m => Bool -> Stream m Int -> m ()
228−parseManyGroupsRolling b =
229− Stream.fold Fold.drain . Stream.parseManyD (PR.groupByRolling (\_ _ -> b) Fold.drain)
230−
231−{-# INLINE parseManyGroupsRollingEither #-}
232−parseManyGroupsRollingEither :: MonadThrow m =>
233− (Int -> Int -> Bool) -> Int -> m ()
234−parseManyGroupsRollingEither cmp value = do
235− sourceUnfoldrM value 1
236− & Stream.parseManyD (PR.groupByRollingEither cmp Fold.drain Fold.drain)
237− & Stream.fold Fold.drain
238−
239−{-# INLINE parseManyGroupsRollingEitherAlt #-}
240−parseManyGroupsRollingEitherAlt :: MonadThrow m =>
241− (Int -> Int -> Bool) -> Int -> m ()
242−parseManyGroupsRollingEitherAlt cmp value = do
243− sourceUnfoldrM value 1
244− -- Make the input unsorted.
245− & fmap (\x -> if even x then x + 2 else x)
246− & Stream.parseManyD (PR.groupByRollingEither cmp Fold.drain Fold.drain)
247− & Stream.fold Fold.drain
248−
249−-------------------------------------------------------------------------------
250−-- Parsing with unfolds
251−-------------------------------------------------------------------------------
252−
253−{-# INLINE parseManyUnfoldArrays #-}
254−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
255−parseManyUnfoldArrays count arrays = do
256− let src = Source.source (Just (Producer.OuterLoop arrays))
257− let parser = PR.fromFold (Fold.take count Fold.drain)
258− let readSrc =
259− Source.producer
260− $ Producer.concat Producer.fromList Array.producer
261− let streamParser =
262− Producer.simplify (Source.parseManyD parser readSrc)
263− Stream.fold Fold.drain $ Stream.unfold streamParser src
264−
265−-------------------------------------------------------------------------------
266−-- Parsers in which -fspec-constr-recursive=16 is problematic
267−-------------------------------------------------------------------------------
268−
269−-- XXX -fspec-constr-recursive=16 makes GHC go beserk when compiling these.
270−-- We need to fix GHC so that we can have better control over that option or do
271−-- not have to rely on it.
272−--
273−{-# INLINE lookAhead #-}
274−lookAhead :: MonadThrow m => Int -> Stream m Int -> m ()
275−lookAhead value =
276− Stream.parseD (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
277−
278−-- XXX The timing of this increased 3x after the stepify extract changes.
279−{-# INLINE sequenceA_ #-}
280−sequenceA_ :: MonadThrow m => Int -> Stream m Int -> m ()
281−sequenceA_ value =
282− Stream.parseD (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
283−
284−-- quadratic complexity
285−{-# INLINE sequenceA #-}
286−sequenceA :: MonadThrow m => Int -> Stream m Int -> m Int
287−sequenceA value xs = do
288− x <- Stream.parseD (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
289− return $ length x
290−
291−-- quadratic complexity
292−{-# INLINE sequence #-}
293−sequence :: MonadThrow m => Int -> Stream m Int -> m Int
294−sequence value xs = do
295− x <- Stream.parseD (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
296− return $ length x
297−
298−{-# INLINE sequence_ #-}
299−sequence_ :: MonadThrow m => Int -> Stream m Int -> m ()
300−sequence_ value xs =
301− Stream.parseD (foldr f (return ()) (replicate value (PR.takeBetween 0 1 Fold.drain))) xs
302−
303− where
304−
305− {-# INLINE f #-}
306− f m k = m >>= (\_ -> k)
307−
308−-- choice using the "Alternative" instance with direct style parser type has
309−-- quadratic performance complexity.
310−--
311−{-# INLINE choiceAsum #-}
312−choiceAsum :: MonadThrow m => Int -> Stream m Int -> m Int
313−choiceAsum value =
314− Stream.parseD (asum (replicate value (PR.satisfy (< 0)))
315− AP.<|> PR.satisfy (> 0))
316−
317−{-
318−{-# INLINE choice #-}
319−choice :: MonadThrow m => Int -> Stream m Int -> m Int
320−choice value =
321− Stream.parseD
322− (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
323−-}
324−
325−-------------------------------------------------------------------------------
326−-- Benchmarks
327−-------------------------------------------------------------------------------
328−
329−moduleName :: String
330−moduleName = "Data.Parser.ParserD"
331−
332−o_1_space_serial :: Int -> [Benchmark]
333−o_1_space_serial value =
334− [ benchIOSink value "takeWhile" $ takeWhile value
335− , benchIOSink value "takeP" $ takeP value
336− , benchIOSink value "takeBetween" $ takeBetween value
337− , benchIOSink value "takeStartBy" $ takeStartBy value
338− , benchIOSink value "groupBy" $ groupBy
339− , benchIOSink value "groupByRolling" $ groupByRolling
340− , benchIOSink value "wordBy" $ wordBy value
341− , benchIOSink value "serialWith" $ serialWith value
342− , benchIOSink value "many" many
343− , benchIOSink value "many (wordBy even)" $ manyWordByEven
344− , benchIOSink value "some" some
345− , benchIOSink value "takeEndBy_" $ takeEndBy_ value
346− , benchIOSink value "manyTill" $ manyTill value
347− {-
348− , benchIOSink value "tee (all,any)" $ teeAllAny value
349− , benchIOSink value "teeFst (all,any)" $ teeFstAllAny value
350− , benchIOSink value "shortest (all,any)" $ shortestAllAny value
351− , benchIOSink value "longest (all,any)" $ longestAllAny value
352− -}
353− , benchIOSink value "sequenceParser" sequenceParser
354− ]
355−
356−o_1_space_serial_spanning :: Int -> [Benchmark]
357−o_1_space_serial_spanning value =
358− [ benchIOSink value "span" $ span value
359− , benchIOSink value "spanBy" $ spanBy value
360− , benchIOSink value "spanByRolling" $ spanByRolling value
361− ]
362−
363−o_1_space_serial_nested :: Int -> [Benchmark]
364−o_1_space_serial_nested value =
365− [ benchIOSink value "parseMany" $ parseMany value
366− , benchIOSink value "parseMany groupBy (bound groups)"
367− $ parseManyGroups False
368− , benchIOSink value "parseMany groupRollingBy (bound groups)"
369− $ parseManyGroupsRolling False
370− , benchIOSink value "parseMany groupBy (1 group)" $ parseManyGroups True
371− , benchIOSink value "parseMany groupRollingBy (1 group)"
372− $ parseManyGroupsRolling True
373− , bench "parseMany groupRollingByEither (Left)"
374− $ nfIO $ parseManyGroupsRollingEitherLeft
375− , bench "parseMany groupRollingByEither (Right)"
376− $ nfIO $ parseManyGroupsRollingEitherRight
377− , bench "parseMany groupRollingByEither (Alternating)"
378− $ nfIO $ parseManyGroupsRollingEitherAlt1
379− ]
380−
381− where
382−
383− {-# NOINLINE parseManyGroupsRollingEitherLeft #-}
384− parseManyGroupsRollingEitherLeft = parseManyGroupsRollingEither (<) value
385−
386− {-# NOINLINE parseManyGroupsRollingEitherRight #-}
387− parseManyGroupsRollingEitherRight = parseManyGroupsRollingEither (>) value
388−
389− {-# NOINLINE parseManyGroupsRollingEitherAlt1 #-}
390− parseManyGroupsRollingEitherAlt1 =
391− parseManyGroupsRollingEitherAlt (>) value
392−
393−o_1_space_serial_unfold :: Int -> [Array.Array Int] -> [Benchmark]
394−o_1_space_serial_unfold bound arrays =
395− [ bench "parseMany/Unfold/1000 arrays/1 parse"
396− $ nfIO $ parseManyUnfoldArrays bound arrays
397− , bench "parseMany/Unfold/1000 arrays/100000 parses"
398− $ nfIO $ parseManyUnfoldArrays 1 arrays
399− ]
400−
401−o_n_heap_serial :: Int -> [Benchmark]
402−o_n_heap_serial value =
403− [
404− -- lookahead benchmark holds the entire input till end
405− benchIOSink value "lookAhead" $ lookAhead value
406−
407− -- These show non-linear time complexity
408− -- They accumulate the results in a list.
409− , benchIOSink value "manyAlt" manyAlt
410− , benchIOSink value "someAlt" someAlt
411− ]
412−
413−-- accumulate results in a list in IO
414−o_n_space_serial :: Int -> [Benchmark]
415−o_n_space_serial value =
416− [ benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100)
417− , benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100)
418− , benchIOSink value "sequence/100" $ sequence (value `div` 100)
419− , benchIOSink value "sequence_/100" $ sequence_ (value `div` 100)
420− , benchIOSink value "choice (asum)/100" $ choiceAsum (value `div` 100)
421− -- , benchIOSink value "choice/100" $ choice (value `div` 100)
422− ]
423−
424−-------------------------------------------------------------------------------
425−-- Driver
426−-------------------------------------------------------------------------------
427−
428−main :: IO ()
429−main = do
430− x <- randomRIO (1,1)
431− runWithCLIOptsEnv (defaultStreamSize + x) alloc allBenchmarks
432−
433− where
434−
435− alloc value = Stream.fold Fold.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
436−
437− allBenchmarks arraysSmall value =
438− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
439− , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_spanning value)
440− , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_nested value)
441− , bgroup (o_1_space_prefix moduleName)
442− (o_1_space_serial_unfold value arraysSmall)
443− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
444− , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
445− ]
benchmark/Streamly/Benchmark/Data/Parser/ParserK.hsdeleted−162
@@ -1,162 +0,0 @@
1−-- |
2−-- Module : Streamly.Benchmark.Data.ParserK
3−-- Copyright : (c) 2020 Composewell Technologies
4−--
5−-- License : BSD-3-Clause
6−-- Maintainer : streamly@composewell.com
7−
8−{-# LANGUAGE CPP #-}
9−{-# LANGUAGE FlexibleContexts #-}
10−
11−module Main
12− (
13− main
14− ) where
15−
16−import Control.DeepSeq (NFData(..))
17−import Control.Monad.Catch (MonadThrow)
18−import Data.Foldable (asum)
19−import Streamly.Internal.Data.Stream (Stream)
20−import System.Random (randomRIO)
21−import Prelude hiding (any, all, take, sequence, sequenceA, takeWhile)
22−
23−import qualified Control.Applicative as AP
24−import qualified Data.Foldable as F
25−import qualified Data.Traversable as TR
26−import qualified Streamly.Internal.Data.Fold as FL
27−import qualified Streamly.Internal.Data.Parser.ParserK.Type as PR
28−import qualified Streamly.Internal.Data.Parser.ParserD as PRD
29−import qualified Streamly.Internal.Data.Stream as Stream
30−
31−import Gauge
32−import Streamly.Benchmark.Common
33−
34−-------------------------------------------------------------------------------
35−-- Utilities
36−-------------------------------------------------------------------------------
37−
38−-- XXX these can be moved to the common module
39−
40−{-# INLINE sourceUnfoldrM #-}
41−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
42−sourceUnfoldrM value n = Stream.unfoldrM step n
43− where
44− step cnt =
45− if cnt > n + value
46− then return Nothing
47− else return (Just (cnt, cnt + 1))
48−
49−-- | Takes a fold method, and uses it with a default source.
50−{-# INLINE benchIOSink #-}
51−benchIOSink
52− :: NFData b
53− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
54−benchIOSink value name f =
55− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
56−
57−-------------------------------------------------------------------------------
58−-- Parsers
59−-------------------------------------------------------------------------------
60−
61−#ifdef FROM_PARSERK
62−#define PARSE_OP (Stream.parseD . PRD.fromParserK)
63−#else
64−#define PARSE_OP Stream.parseK
65−#endif
66−
67−{-# INLINE satisfy #-}
68−satisfy :: Monad m => (a -> Bool) -> PR.Parser m a a
69−satisfy = PRD.toParserK . PRD.satisfy
70−
71−{-# INLINE takeWhile #-}
72−takeWhile :: Monad m => (a -> Bool) -> PR.Parser m a ()
73−takeWhile p = PRD.toParserK $ PRD.takeWhile p FL.drain
74−
75−{-# INLINE takeWhileK #-}
76−takeWhileK :: MonadThrow m => Int -> Stream m Int -> m ()
77−takeWhileK value = PARSE_OP (takeWhile (<= value))
78−
79−{-# INLINE splitApp #-}
80−splitApp :: MonadThrow m
81− => Int -> Stream m Int -> m ((), ())
82−splitApp value =
83− PARSE_OP ((,) <$> takeWhile (<= (value `div` 2)) <*> takeWhile (<= value))
84−
85−{-# INLINE sequenceA #-}
86−sequenceA :: MonadThrow m => Int -> Stream m Int -> m Int
87−sequenceA value xs = do
88− let parser = satisfy (> 0)
89− list = Prelude.replicate value parser
90− x <- PARSE_OP (TR.sequenceA list) xs
91− return $ Prelude.length x
92−
93−{-# INLINE sequenceA_ #-}
94−sequenceA_ :: MonadThrow m => Int -> Stream m Int -> m ()
95−sequenceA_ value xs = do
96− let parser = satisfy (> 0)
97− list = Prelude.replicate value parser
98− PARSE_OP (F.sequenceA_ list) xs
99−
100−{-# INLINE sequence #-}
101−sequence :: MonadThrow m => Int -> Stream m Int -> m Int
102−sequence value xs = do
103− let parser = satisfy (> 0)
104− list = Prelude.replicate value parser
105− x <- PARSE_OP (TR.sequence list) xs
106− return $ Prelude.length x
107−
108−{-# INLINE manyAlt #-}
109−manyAlt :: MonadThrow m => Stream m Int -> m Int
110−manyAlt xs = do
111− x <- PARSE_OP (AP.many (satisfy (> 0))) xs
112− return $ Prelude.length x
113−
114−{-# INLINE someAlt #-}
115−someAlt :: MonadThrow m => Stream m Int -> m Int
116−someAlt xs = do
117− x <- PARSE_OP (AP.some (satisfy (> 0))) xs
118− return $ Prelude.length x
119−
120−{-# INLINE choice #-}
121−choice :: MonadThrow m => Int -> Stream m Int -> m Int
122−choice value =
123− PARSE_OP (asum (replicate value (satisfy (< 0)))
124− AP.<|> satisfy (> 0))
125−
126−-------------------------------------------------------------------------------
127−-- Benchmarks
128−-------------------------------------------------------------------------------
129−
130−moduleName :: String
131−moduleName = "Data.Parser.ParserK"
132−
133−o_1_space_serial :: Int -> [Benchmark]
134−o_1_space_serial value =
135− [ benchIOSink value "takeWhile" $ takeWhileK value
136− , benchIOSink value "splitApp" $ splitApp value
137− ]
138−
139−-- O(n) heap beacuse of accumulation of the list in strict IO monad?
140−o_n_heap_serial :: Int -> [Benchmark]
141−o_n_heap_serial value =
142− [ benchIOSink value "sequenceA" $ sequenceA value
143− , benchIOSink value "sequenceA_" $ sequenceA_ value
144− , benchIOSink value "sequence" $ sequence value
145− , benchIOSink value "manyAlt" manyAlt
146− , benchIOSink value "someAlt" someAlt
147− , benchIOSink value "choice" $ choice value
148− ]
149−
150−-------------------------------------------------------------------------------
151−-- Driver
152−-------------------------------------------------------------------------------
153−
154−main :: IO ()
155−main = runWithCLIOpts defaultStreamSize allBenchmarks
156−
157− where
158−
159− allBenchmarks value =
160− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
161− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
162− ]
benchmark/Streamly/Benchmark/Data/ParserK.hsnew file+437
@@ -0,0 +1,437 @@
1+-- |
2+-- Module : Streamly.Benchmark.Data.ParserK
3+-- Copyright : (c) 2020 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+
8+-- BENCH_CHUNKED -> adaptC
9+-- BENCH_CHUNKED_GENERIC -> adaptCG
10+-- BENCH_SINGULAR -> adapt
11+
12+{-# LANGUAGE CPP #-}
13+{-# LANGUAGE FlexibleContexts #-}
14+{-# OPTIONS_GHC -Wno-orphans #-}
15+
16+module Main
17+ (
18+ main
19+ ) where
20+
21+import Control.Applicative ((<|>))
22+import Control.DeepSeq (NFData(..))
23+import Control.Monad.IO.Class (MonadIO)
24+import Data.Foldable (asum)
25+#ifdef BENCH_CHUNKED
26+import Streamly.Data.Array (Array, Unbox)
27+#endif
28+#ifdef BENCH_CHUNKED_GENERIC
29+import Streamly.Data.Array.Generic (Array)
30+import qualified Streamly.Internal.Data.Array.Generic as GenArr (chunksOf)
31+#endif
32+import Streamly.Internal.Data.Fold (Fold(..))
33+import Streamly.Data.StreamK (StreamK)
34+import Streamly.Internal.Data.Parser
35+ (ParseError(..), Parser(..), Initial(..), Step(..))
36+import Streamly.Internal.Data.Stream (Stream)
37+import System.Random (randomRIO)
38+import Prelude hiding
39+ (any, all, take, sequence, sequence_, sequenceA, takeWhile)
40+
41+import qualified Control.Applicative as AP
42+import qualified Data.Foldable as F
43+import qualified Data.Traversable as TR
44+import qualified Streamly.Data.Stream as Stream
45+import qualified Streamly.Data.Fold as FL
46+import qualified Streamly.Internal.Data.Fold as Fold
47+import qualified Streamly.Data.Parser as PRD
48+import qualified Streamly.Internal.Data.ParserK as PR
49+import qualified Streamly.Internal.Data.StreamK as StreamK
50+
51+import Test.Tasty.Bench
52+import Streamly.Benchmark.Common
53+
54+-------------------------------------------------------------------------------
55+-- CPP Helpers
56+-------------------------------------------------------------------------------
57+
58+#ifdef BENCH_CHUNKED
59+
60+#define PARSE_OP StreamK.parseChunks
61+#define FROM_PARSER adaptC
62+#define INPUT (Array a)
63+#define PARSE_ELEM (Array Int)
64+#define CONSTRAINT_IO (MonadIO m, Unbox a)
65+#define CONSTRAINT (Monad m, Unbox a)
66+#define MODULE_NAME "Data.ParserK.Chunked"
67+
68+#endif
69+
70+#ifdef BENCH_CHUNKED_GENERIC
71+
72+#define PARSE_OP StreamK.parseChunksGeneric
73+#define FROM_PARSER adaptCG
74+#define INPUT (Array a)
75+#define PARSE_ELEM (Array Int)
76+#define CONSTRAINT_IO (MonadIO m)
77+#define CONSTRAINT (Monad m)
78+#define MODULE_NAME "Data.ParserK.Chunked.Generic"
79+
80+#endif
81+
82+#ifdef BENCH_SINGULAR
83+
84+#define PARSE_OP StreamK.parse
85+#define FROM_PARSER adapt
86+#define INPUT a
87+#define PARSE_ELEM Int
88+#define CONSTRAINT_IO (MonadIO m)
89+#define CONSTRAINT (Monad m)
90+#define MODULE_NAME "Data.ParserK"
91+
92+#endif
93+
94+-------------------------------------------------------------------------------
95+-- Utilities
96+-------------------------------------------------------------------------------
97+
98+-- XXX these can be moved to the common module
99+
100+{-# INLINE sourceUnfoldrM #-}
101+sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
102+sourceUnfoldrM value n = Stream.unfoldrM step n
103+ where
104+ step cnt =
105+ if cnt > n + value
106+ then return Nothing
107+ else return (Just (cnt, cnt + 1))
108+
109+-- | Takes a fold method, and uses it with a default source.
110+{-# INLINE benchIOSink #-}
111+benchIOSink
112+ :: NFData b
113+ => Int -> String -> (StreamK IO PARSE_ELEM -> IO b) -> Benchmark
114+benchIOSink value name f =
115+ bench name $ nfIO $ randomRIO (1,1)
116+ >>= f
117+ . StreamK.fromStream
118+#ifdef BENCH_CHUNKED
119+ . Stream.chunksOf 4000
120+#endif
121+#ifdef BENCH_CHUNKED_GENERIC
122+ . GenArr.chunksOf 4000
123+#endif
124+ . sourceUnfoldrM value
125+
126+-------------------------------------------------------------------------------
127+-- Parsers
128+-------------------------------------------------------------------------------
129+
130+{-# INLINE one #-}
131+one :: MonadIO m =>
132+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError (Maybe Int))
133+one value = PARSE_OP p
134+
135+ where
136+
137+ p = do
138+ m <- PR.FROM_PARSER (PRD.fromFold FL.one)
139+ case m of
140+ Just i -> if i >= value then pure m else p
141+ Nothing -> pure Nothing
142+
143+{-# INLINE satisfy #-}
144+satisfy :: CONSTRAINT_IO => (a -> Bool) -> PR.ParserK INPUT m a
145+satisfy = PR.FROM_PARSER . PRD.satisfy
146+
147+{-# INLINE takeWhile #-}
148+takeWhile :: CONSTRAINT_IO => (a -> Bool) -> PR.ParserK INPUT m ()
149+takeWhile p = PR.FROM_PARSER $ PRD.takeWhile p FL.drain
150+
151+{-# INLINE takeWhileK #-}
152+takeWhileK :: MonadIO m =>
153+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
154+takeWhileK value = PARSE_OP (takeWhile (<= value))
155+
156+{-# INLINE splitAp2 #-}
157+splitAp2 :: MonadIO m
158+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ((), ()))
159+splitAp2 value =
160+ PARSE_OP
161+ ((,)
162+ <$> takeWhile (<= (value `div` 2))
163+ <*> takeWhile (<= value)
164+ )
165+
166+{-# INLINE splitAp8 #-}
167+splitAp8 :: MonadIO m
168+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
169+splitAp8 value =
170+ PARSE_OP
171+ ( (\() () () () () () () () -> ())
172+ <$> takeWhile (<= ( value `div` 8))
173+ <*> takeWhile (<= ((value * 2) `div` 8))
174+ <*> takeWhile (<= ((value * 3) `div` 8))
175+ <*> takeWhile (<= ((value * 4) `div` 8))
176+ <*> takeWhile (<= ((value * 5) `div` 8))
177+ <*> takeWhile (<= ((value * 6) `div` 8))
178+ <*> takeWhile (<= ((value * 7) `div` 8))
179+ <*> takeWhile (<= value)
180+ )
181+
182+{-# INLINE sequenceA #-}
183+sequenceA :: MonadIO m => Int -> StreamK m PARSE_ELEM -> m Int
184+sequenceA value xs = do
185+ let parser = satisfy (> 0)
186+ list = Prelude.replicate value parser
187+ x <- PARSE_OP (TR.sequenceA list) xs
188+ return $ Prelude.length x
189+
190+{-# INLINE sequenceA_ #-}
191+sequenceA_ :: MonadIO m =>
192+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
193+sequenceA_ value xs = do
194+ let parser = satisfy (> 0)
195+ list = Prelude.replicate value parser
196+ PARSE_OP (F.sequenceA_ list) xs
197+
198+{-# INLINE sequence #-}
199+sequence :: MonadIO m => Int -> StreamK m PARSE_ELEM -> m Int
200+sequence value xs = do
201+ let parser = satisfy (> 0)
202+ list = Prelude.replicate value parser
203+ x <- PARSE_OP (TR.sequence list) xs
204+ return $ Prelude.length x
205+
206+{-# INLINE sequence_ #-}
207+sequence_ :: MonadIO m =>
208+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
209+sequence_ value =
210+ let parser = satisfy (> 0)
211+ list = Prelude.replicate value parser
212+ in PARSE_OP (F.sequence_ list)
213+
214+{-# INLINE takeWhileFailD #-}
215+takeWhileFailD :: Monad m => (a -> Bool) -> Fold m a b -> Parser a m b
216+takeWhileFailD predicate (Fold fstep finitial _ ffinal) =
217+ Parser step initial extract
218+
219+ where
220+
221+ initial = do
222+ res <- finitial
223+ return $ case res of
224+ Fold.Partial s -> IPartial s
225+ Fold.Done b -> IDone b
226+
227+ step s a =
228+ if predicate a
229+ then do
230+ fres <- fstep s a
231+ return
232+ $ case fres of
233+ Fold.Partial s1 -> Partial 0 s1
234+ Fold.Done b -> Done 0 b
235+ else return $ Error "fail"
236+
237+ extract s = fmap (Done 0) (ffinal s)
238+
239+{-# INLINE takeWhileFail #-}
240+takeWhileFail :: CONSTRAINT =>
241+ (a -> Bool) -> Fold m a b -> PR.ParserK INPUT m b
242+takeWhileFail p f = PR.FROM_PARSER (takeWhileFailD p f)
243+
244+{-# INLINE alt2 #-}
245+alt2 :: MonadIO m
246+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
247+alt2 value =
248+ PARSE_OP
249+ ( takeWhileFail (<= (value `div` 2)) Fold.drain
250+ <|> takeWhile (<= value)
251+ )
252+
253+{-# INLINE alt8 #-}
254+alt8 :: MonadIO m
255+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
256+alt8 value =
257+ PARSE_OP
258+ ( takeWhileFail (<= ( value `div` 8)) Fold.drain
259+ <|> takeWhileFail (<= ((value * 2) `div` 8)) Fold.drain
260+ <|> takeWhileFail (<= ((value * 3) `div` 8)) Fold.drain
261+ <|> takeWhileFail (<= ((value * 4) `div` 8)) Fold.drain
262+ <|> takeWhileFail (<= ((value * 5) `div` 8)) Fold.drain
263+ <|> takeWhileFail (<= ((value * 6) `div` 8)) Fold.drain
264+ <|> takeWhileFail (<= ((value * 7) `div` 8)) Fold.drain
265+ <|> takeWhile (<= value)
266+ )
267+
268+{-# INLINE alt16 #-}
269+alt16 :: MonadIO m
270+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
271+alt16 value =
272+ PARSE_OP
273+ ( takeWhileFail (<= ( value `div` 16)) Fold.drain
274+ <|> takeWhileFail (<= ((value * 2) `div` 16)) Fold.drain
275+ <|> takeWhileFail (<= ((value * 3) `div` 16)) Fold.drain
276+ <|> takeWhileFail (<= ((value * 4) `div` 16)) Fold.drain
277+ <|> takeWhileFail (<= ((value * 5) `div` 16)) Fold.drain
278+ <|> takeWhileFail (<= ((value * 6) `div` 16)) Fold.drain
279+ <|> takeWhileFail (<= ((value * 7) `div` 16)) Fold.drain
280+ <|> takeWhileFail (<= ((value * 8) `div` 16)) Fold.drain
281+ <|> takeWhileFail (<= ((value * 9) `div` 16)) Fold.drain
282+ <|> takeWhileFail (<= ((value * 10) `div` 16)) Fold.drain
283+ <|> takeWhileFail (<= ((value * 11) `div` 16)) Fold.drain
284+ <|> takeWhileFail (<= ((value * 12) `div` 16)) Fold.drain
285+ <|> takeWhileFail (<= ((value * 13) `div` 16)) Fold.drain
286+ <|> takeWhileFail (<= ((value * 14) `div` 16)) Fold.drain
287+ <|> takeWhileFail (<= ((value * 15) `div` 16)) Fold.drain
288+ <|> takeWhile (<= value)
289+ )
290+
291+{-# INLINE manyAlt #-}
292+manyAlt :: MonadIO m => StreamK m PARSE_ELEM -> m Int
293+manyAlt xs = do
294+ x <- PARSE_OP (AP.many (satisfy (> 0))) xs
295+ return $ Prelude.length x
296+
297+{-# INLINE someAlt #-}
298+someAlt :: MonadIO m => StreamK m PARSE_ELEM -> m Int
299+someAlt xs = do
300+ x <- PARSE_OP (AP.some (satisfy (> 0))) xs
301+ return $ Prelude.length x
302+
303+{-# INLINE choice #-}
304+choice :: MonadIO m =>
305+ Int -> StreamK m PARSE_ELEM -> m (Either ParseError Int)
306+choice value =
307+ PARSE_OP (asum (replicate value (satisfy (< 0)))
308+ AP.<|> satisfy (> 0))
309+
310+{-# INLINE monad2 #-}
311+monad2 :: MonadIO m
312+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
313+monad2 value =
314+ PARSE_OP $ do
315+ takeWhile (<= (value `div` 2))
316+ takeWhile (<= value)
317+
318+{-# INLINE monad4 #-}
319+monad4 :: MonadIO m
320+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
321+monad4 value =
322+ PARSE_OP $ do
323+ takeWhile (<= ( value `div` 4))
324+ takeWhile (<= ((value * 2) `div` 4))
325+ takeWhile (<= ((value * 3) `div` 4))
326+ takeWhile (<= value)
327+
328+{-# INLINE monad8 #-}
329+monad8 :: MonadIO m
330+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
331+monad8 value =
332+ PARSE_OP $ do
333+ takeWhile (<= ( value `div` 8))
334+ takeWhile (<= ((value * 2) `div` 8))
335+ takeWhile (<= ((value * 3) `div` 8))
336+ takeWhile (<= ((value * 4) `div` 8))
337+ takeWhile (<= ((value * 5) `div` 8))
338+ takeWhile (<= ((value * 6) `div` 8))
339+ takeWhile (<= ((value * 7) `div` 8))
340+ takeWhile (<= value)
341+
342+{-# INLINE monad16 #-}
343+monad16 :: MonadIO m
344+ => Int -> StreamK m PARSE_ELEM -> m (Either ParseError ())
345+monad16 value =
346+ PARSE_OP $ do
347+ takeWhile (<= ( value `div` 16))
348+ takeWhile (<= ((value * 2) `div` 16))
349+ takeWhile (<= ((value * 3) `div` 16))
350+ takeWhile (<= ((value * 4) `div` 16))
351+ takeWhile (<= ((value * 5) `div` 16))
352+ takeWhile (<= ((value * 6) `div` 16))
353+ takeWhile (<= ((value * 7) `div` 16))
354+ takeWhile (<= ((value * 8) `div` 16))
355+ takeWhile (<= ((value * 9) `div` 16))
356+ takeWhile (<= ((value * 10) `div` 16))
357+ takeWhile (<= ((value * 11) `div` 16))
358+ takeWhile (<= ((value * 12) `div` 16))
359+ takeWhile (<= ((value * 13) `div` 16))
360+ takeWhile (<= ((value * 14) `div` 16))
361+ takeWhile (<= ((value * 15) `div` 16))
362+ takeWhile (<= value)
363+
364+-------------------------------------------------------------------------------
365+-- Benchmarks
366+-------------------------------------------------------------------------------
367+
368+moduleName :: String
369+moduleName = MODULE_NAME
370+
371+instance NFData ParseError where
372+ {-# INLINE rnf #-}
373+ rnf (ParseError x) = rnf x
374+
375+o_1_space_serial :: Int -> [Benchmark]
376+o_1_space_serial value =
377+ [ benchIOSink value "drain" (Stream.fold Fold.drain . StreamK.toStream)
378+ , benchIOSink value "takeWhile" $ takeWhileK value
379+ , benchIOSink value "splitAp2" $ splitAp2 value
380+ , benchIOSink value "splitAp8" $ splitAp8 value
381+ , benchIOSink value "alt2" $ alt2 value
382+ , benchIOSink value "alt8" $ alt8 value
383+ , benchIOSink value "alt16" $ alt16 value
384+ , benchIOSink value "monad2" $ monad2 value
385+ , benchIOSink value "monad4" $ monad4 value
386+ , benchIOSink value "monad8" $ monad8 value
387+ , benchIOSink value "monad16" $ monad16 value
388+ ]
389+
390+{-# INLINE sepBy1 #-}
391+sepBy1 :: MonadIO m => StreamK m PARSE_ELEM -> m Int
392+sepBy1 xs = do
393+ x <- PARSE_OP (parser (satisfy odd) (satisfy even)) xs
394+ return $ Prelude.length x
395+
396+ where
397+
398+ parser p sep = do
399+ x <- p
400+ fmap (x :) $ AP.many (sep >> p)
401+
402+-- O(n) heap beacuse of accumulation of the list in strict IO monad?
403+o_n_heap_serial :: Int -> [Benchmark]
404+o_n_heap_serial value =
405+ [
406+ -- accumulates the results in a list
407+ -- XXX why should this take O(n) heap, it discards the results?
408+ benchIOSink value "sequence_" $ sequence_ value
409+ , benchIOSink value "sequenceA_" $ sequenceA_ value
410+ , benchIOSink value "sequence" $ sequence value
411+ , benchIOSink value "sequenceA" $ sequenceA value
412+ , benchIOSink value "manyAlt" manyAlt
413+ , benchIOSink value "sepBy1" sepBy1
414+ , benchIOSink value "someAlt" someAlt
415+ , benchIOSink value "choice" $ choice value
416+ ]
417+
418+-- O(n) heap beacuse of accumulation of the list in strict IO monad?
419+o_1_space_recursive :: Int -> [Benchmark]
420+o_1_space_recursive value =
421+ [ benchIOSink value "one (recursive)" $ one value
422+ ]
423+
424+-------------------------------------------------------------------------------
425+-- Driver
426+-------------------------------------------------------------------------------
427+
428+main :: IO ()
429+main = runWithCLIOpts defaultStreamSize allBenchmarks
430+
431+ where
432+
433+ allBenchmarks value =
434+ [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
435+ , bgroup (o_1_space_prefix moduleName) (o_1_space_recursive value)
436+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
437+ ]
benchmark/Streamly/Benchmark/Data/Ring/Unboxed.hs+3−4
@@ -12,12 +12,11 @@ module Main (main) where
1212
1313import Control.Monad (void)
1414import GHC.Ptr (Ptr(..))
15−
16−import qualified Streamly.Internal.Data.Array.Unboxed.Type as Array
17−import qualified Streamly.Internal.Data.Ring.Foreign as Ring
15+import qualified Streamly.Internal.Data.Array as Array
16+import qualified Streamly.Internal.Data.Ring as Ring
1817import qualified Data.Foldable as P
1918
20−import Gauge
19+import Test.Tasty.Bench
2120import Streamly.Benchmark.Common
2221
2322import Prelude as P
benchmark/Streamly/Benchmark/Data/Serialize.hsnew file+591
@@ -0,0 +1,591 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+{- HLINT ignore -}
3+
4+#undef FUSION_CHECK
5+#ifdef FUSION_CHECK
6+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
7+#endif
8+
9+-- |
10+-- Module : Streamly.Benchmark.Data.Serialize
11+-- Copyright : (c) 2023 Composewell
12+-- License : BSD-3-Clause
13+-- Maintainer : streamly@composewell.com
14+
15+module Main (main) where
16+
17+-------------------------------------------------------------------------------
18+-- Imports
19+-------------------------------------------------------------------------------
20+
21+import Control.DeepSeq (NFData(..), deepseq)
22+import Control.Monad (when, void)
23+import GHC.Generics (Generic)
24+import System.Random (randomRIO)
25+#ifndef USE_UNBOX
26+import Test.QuickCheck (Arbitrary, arbitrary)
27+#endif
28+
29+import Streamly.Internal.Data.MutByteArray
30+import qualified Streamly.Internal.Data.MutByteArray as MBA
31+#ifdef USE_UNBOX
32+import Data.Proxy (Proxy(..))
33+#else
34+import Control.DeepSeq (force)
35+import Test.QuickCheck (oneof, generate)
36+#endif
37+
38+import Test.Tasty.Bench
39+import Streamly.Benchmark.Common
40+
41+#ifndef USE_UNBOX
42+import Streamly.Benchmark.Data.Serialize.RecCompatible
43+import Streamly.Benchmark.Data.Serialize.RecNonCompatible
44+#endif
45+
46+#ifdef USE_UNBOX
47+#define SERIALIZE_CLASS Unbox
48+#define DERIVE_CLASS(typ) $(deriveUnbox [d|instance Unbox typ|])
49+#define SERIALIZE_OP pokeAt
50+#define DESERIALIZE_OP peekAt
51+#else
52+#define SERIALIZE_CLASS Serialize
53+#define DERIVE_CLASS(typ) $(deriveSerialize [d|instance Serialize typ|])
54+#define SERIALIZE_OP serializeAt
55+#define DESERIALIZE_OP deserializeAt
56+#endif
57+
58+-------------------------------------------------------------------------------
59+-- Types
60+-------------------------------------------------------------------------------
61+
62+data Unit = Unit
63+ deriving (Generic, Show, Eq)
64+
65+#ifndef USE_TH
66+instance SERIALIZE_CLASS Unit
67+#else
68+DERIVE_CLASS(Unit)
69+#endif
70+
71+instance NFData Unit where
72+ {-# INLINE rnf #-}
73+ rnf _ = ()
74+
75+data Sum2
76+ = Sum21
77+ | Sum22
78+ deriving (Generic, Show, Eq)
79+
80+#ifndef USE_TH
81+instance SERIALIZE_CLASS Sum2
82+#else
83+DERIVE_CLASS(Sum2)
84+#endif
85+
86+instance NFData Sum2 where
87+ {-# INLINE rnf #-}
88+ rnf _ = ()
89+
90+data Sum25
91+ = Sum251
92+ | Sum252
93+ | Sum253
94+ | Sum254
95+ | Sum255
96+ | Sum256
97+ | Sum257
98+ | Sum258
99+ | Sum259
100+ | Sum2510
101+ | Sum2511
102+ | Sum2512
103+ | Sum2513
104+ | Sum2514
105+ | Sum2515
106+ | Sum2516
107+ | Sum2517
108+ | Sum2518
109+ | Sum2519
110+ | Sum2520
111+ | Sum2521
112+ | Sum2522
113+ | Sum2523
114+ | Sum2524
115+ | Sum2525
116+ deriving (Generic, Show, Eq)
117+
118+#ifndef USE_TH
119+instance SERIALIZE_CLASS Sum25
120+#else
121+DERIVE_CLASS(Sum25)
122+#endif
123+
124+instance NFData Sum25 where
125+ {-# INLINE rnf #-}
126+ rnf _ = ()
127+
128+data Product25
129+ = Product25
130+ Int
131+ Int
132+ Int
133+ Int
134+ Int
135+ Int
136+ Int
137+ Int
138+ Int
139+ Int
140+ Int
141+ Int
142+ Int
143+ Int
144+ Int
145+ Int
146+ Int
147+ Int
148+ Int
149+ Int
150+ Int
151+ Int
152+ Int
153+ Int
154+ Int
155+ deriving (Generic, Show)
156+
157+#ifndef USE_TH
158+instance SERIALIZE_CLASS Product25
159+#else
160+DERIVE_CLASS(Product25)
161+#endif
162+
163+instance NFData Product25 where
164+ {-# INLINE rnf #-}
165+ rnf
166+ (Product25 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 a16 a17 a18 a19 a20 a21 a22 a23 a24 a25)
167+ = a1
168+ `seq` a2
169+ `seq` a3
170+ `seq` a4
171+ `seq` a5
172+ `seq` a6
173+ `seq` a7
174+ `seq` a8
175+ `seq` a9
176+ `seq` a10
177+ `seq` a11
178+ `seq` a12
179+ `seq` a13
180+ `seq` a14
181+ `seq` a15
182+ `seq` a16
183+ `seq` a17
184+ `seq` a18
185+ `seq` a19
186+ `seq` a20
187+ `seq` a21
188+ `seq` a22
189+ `seq` a23
190+ `seq` a24
191+ `seq` a25
192+ `seq` ()
193+
194+-- XXX derived Eq instance is not inlined
195+instance Eq Product25 where
196+ {-# INLINE (==) #-}
197+ (==)
198+ (Product25 a1 a2 a3 a4 a5 a6 a7 a8 a9 a10 a11 a12 a13 a14 a15 a16 a17 a18 a19 a20 a21 a22 a23 a24 a25)
199+ (Product25 b1 b2 b3 b4 b5 b6 b7 b8 b9 b10 b11 b12 b13 b14 b15 b16 b17 b18 b19 b20 b21 b22 b23 b24 b25)
200+ = a1 == b1
201+ && a2 == b2
202+ && a3 == b3
203+ && a4 == b4
204+ && a5 == b5
205+ && a6 == b6
206+ && a7 == b7
207+ && a8 == b8
208+ && a9 == b9
209+ && a10 == b10
210+ && a11 == b11
211+ && a12 == b12
212+ && a13 == b13
213+ && a14 == b14
214+ && a15 == b15
215+ && a16 == b16
216+ && a17 == b17
217+ && a18 == b18
218+ && a19 == b19
219+ && a20 == b20
220+ && a21 == b21
221+ && a22 == b22
222+ && a23 == b23
223+ && a24 == b24
224+ && a25 == b25
225+
226+-------------------------------------------------------------------------------
227+-- Simple non-recursive ADT
228+-------------------------------------------------------------------------------
229+
230+{-
231+data CustomDT1
232+ = CDT1C1
233+ | CDT1C2 Int
234+ | CDT1C3 Int Int
235+ deriving (Generic, Show, Eq)
236+
237+#ifndef USE_TH
238+instance SERIALIZE_CLASS CustomDT1
239+#else
240+DERIVE_CLASS(CustomDT1)
241+#endif
242+
243+instance NFData CustomDT1 where
244+ {-# INLINE rnf #-}
245+ rnf CDT1C1 = ()
246+ rnf (CDT1C2 i) = i `seq` ()
247+ rnf (CDT1C3 i1 i2) = i1 `seq` i2 `seq` ()
248+-}
249+
250+-------------------------------------------------------------------------------
251+-- Recursive ADT
252+-------------------------------------------------------------------------------
253+
254+#ifndef USE_UNBOX
255+data BinTree a
256+ = Tree (BinTree a) (BinTree a)
257+ | Leaf a
258+ deriving (Show, Read, Eq, Generic)
259+
260+#ifndef USE_TH
261+instance Serialize (BinTree a)
262+#else
263+$(deriveSerialize [d|instance Serialize a => Serialize (BinTree a)|])
264+#endif
265+
266+instance NFData a => NFData (BinTree a) where
267+ {-# INLINE rnf #-}
268+ rnf (Leaf a) = rnf a `seq` ()
269+ rnf (Tree l r) = rnf l `seq` rnf r
270+
271+-- XXX This may not terminate, or could become really large.
272+instance Arbitrary a => Arbitrary (BinTree a) where
273+ arbitrary = oneof [Leaf <$> arbitrary, Tree <$> arbitrary <*> arbitrary]
274+
275+mkBinTree :: (Arbitrary a) => Int -> IO (BinTree a)
276+mkBinTree = go (generate arbitrary)
277+
278+ where
279+
280+ go r 0 = Leaf <$> r
281+ go r n = Tree <$> go r (n - 1) <*> go r (n - 1)
282+
283+#endif
284+
285+-------------------------------------------------------------------------------
286+-- Size helpers
287+-------------------------------------------------------------------------------
288+
289+{-# INLINE getSize #-}
290+getSize :: forall a. SERIALIZE_CLASS a => a -> Int
291+#ifdef USE_UNBOX
292+getSize _ = sizeOf (Proxy :: Proxy a)
293+#else
294+getSize = addSizeTo 0
295+#endif
296+
297+-------------------------------------------------------------------------------
298+-- Common helpers
299+-------------------------------------------------------------------------------
300+
301+{- HLINT ignore "Eta reduce" -}
302+-- Parts of "f" that are dependent on val will not be optimized out.
303+{-# INLINE loop #-}
304+loop :: Int -> (a -> IO b) -> a -> IO ()
305+loop count f val = go count val
306+ where
307+
308+ go n x = when (n > 0) $ f x >> go (n-1) x
309+
310+-- The first arg of "f" is the environment which is not threaded around in the
311+-- loop.
312+{-# INLINE loopWith #-}
313+loopWith :: Int -> (e -> a -> IO b) -> e -> a -> IO ()
314+loopWith count f e val = go count val
315+ where
316+
317+ go n x = when (n > 0) $ f e x >> go (n-1) x
318+
319+benchSink :: NFData b => String -> Int -> (Int -> IO b) -> Benchmark
320+benchSink name times f = bench name (nfIO (randomRIO (times, times) >>= f))
321+
322+-------------------------------------------------------------------------------
323+-- Serialization Helpers
324+-------------------------------------------------------------------------------
325+
326+{-
327+{-# INLINE pokeWithSize #-}
328+pokeWithSize :: SERIALIZE_CLASS a => MutByteArray -> a -> IO ()
329+pokeWithSize arr val = do
330+ let n = getSize val
331+ n `seq` SERIALIZE_OP 0 arr val >> return ()
332+
333+{-# INLINE pokeTimesWithSize #-}
334+pokeTimesWithSize :: SERIALIZE_CLASS a => a -> Int -> IO ()
335+pokeTimesWithSize val times = do
336+ let n = getSize val
337+ arr <- MBA.new n
338+ loopWith times pokeWithSize arr val
339+-}
340+
341+{-# INLINE poke #-}
342+poke :: SERIALIZE_CLASS a => MutByteArray -> a -> IO ()
343+poke arr val = void (SERIALIZE_OP 0 arr val)
344+
345+{-# INLINE pokeTimes #-}
346+pokeTimes :: SERIALIZE_CLASS a => a -> Int -> IO ()
347+pokeTimes val times = do
348+ let n = getSize val
349+ arr <- MBA.new n
350+ loopWith times poke arr val
351+
352+{-# INLINE encode #-}
353+encode :: SERIALIZE_CLASS a => a -> IO ()
354+encode val = do
355+ let n = getSize val
356+ arr <- MBA.new n
357+ void (SERIALIZE_OP 0 arr val)
358+
359+{-# INLINE encodeTimes #-}
360+encodeTimes :: SERIALIZE_CLASS a => a -> Int -> IO ()
361+encodeTimes val times = loop times encode val
362+
363+{-# INLINE peek #-}
364+peek :: forall a. (NFData a, SERIALIZE_CLASS a) =>
365+ (a, Int) -> MutByteArray -> IO ()
366+#ifdef USE_UNBOX
367+peek (_val, _) arr = do
368+ (val1 :: a) <- DESERIALIZE_OP 0 arr
369+#else
370+peek (_val, n) arr = do
371+ (_, val1 :: a) <- DESERIALIZE_OP 0 arr n
372+#endif
373+ -- If the datatype is not deeply strict or deepseq is not used then use
374+ -- Equality.
375+ -- Ensure that we are actually constructing the type and using it. This
376+ -- is important, otherwise the structure is created and discarded, the
377+ -- cost of creation of the structure is not accounted. Otherwise we may
378+ -- just read the values and discard them. The comparison adds to the
379+ -- cost though. We could use deepseq but then we need to write
380+ -- instances of NFData and ensure that they are correct and perform
381+ -- well. Equality check also ensures correctness.
382+ {-
383+ if (val1 /= val)
384+ then error "peek: no match"
385+ else return ()
386+ -}
387+ val1 `deepseq` return ()
388+
389+{-# INLINE peekTimes #-}
390+peekTimes :: (NFData a, SERIALIZE_CLASS a) => Int -> a -> Int -> IO ()
391+peekTimes n val times = do
392+ arr <- MBA.new n
393+ _ <- SERIALIZE_OP 0 arr val
394+ loopWith times peek (val, n) arr
395+
396+{-# INLINE trip #-}
397+trip :: forall a. (NFData a, SERIALIZE_CLASS a) => a -> IO ()
398+trip val = do
399+ let n = getSize val
400+ arr <- MBA.new n
401+ _ <- SERIALIZE_OP 0 arr val
402+#ifdef USE_UNBOX
403+ (val1 :: a) <- DESERIALIZE_OP 0 arr
404+#else
405+ (_, val1 :: a) <- DESERIALIZE_OP 0 arr n
406+#endif
407+ -- Do not remove this or use deepseq, see the comments in peek.
408+ {-
409+ if (val1 /= val)
410+ then error "roundtrip: no match"
411+ else return ()
412+ -}
413+ -- Note: deepseq is not needed if the datatype is strict
414+ val1 `deepseq` return ()
415+
416+{-# INLINE roundtrip #-}
417+roundtrip :: (NFData a, SERIALIZE_CLASS a) => a -> Int -> IO ()
418+roundtrip val times = loop times trip val
419+
420+-------------------------------------------------------------------------------
421+-- Benchmarks
422+-------------------------------------------------------------------------------
423+
424+{-# INLINE benchConst #-}
425+benchConst ::
426+ String
427+ -> (forall a. (NFData a, SERIALIZE_CLASS a) =>
428+ Int -> a -> Int -> IO ())
429+ -> Int
430+ -> Benchmark
431+benchConst gname f times =
432+ bgroup gname
433+ [ let !n = getSize Unit
434+ in benchSink "Unit" times (f n Unit)
435+ {-
436+ , let !n = getSize CDT1C1
437+ in benchSink "C1" times (f n CDT1C1)
438+ , let val = CDT1C2 5
439+ !n = getSize val
440+ in benchSink "C2" (times `div` 2) (f n val)
441+ , let val = CDT1C3 5 2
442+ !n = getSize val
443+ in benchSink "C3" (times `div` 3) (f n val)
444+ -}
445+ , let !n = getSize Sum21
446+ in benchSink "Sum2" times (f n Sum21)
447+ , let !n = getSize Sum2525
448+ in benchSink "Sum25" times (f n Sum2525)
449+ , let val = Product25 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
450+ !n = getSize val
451+ in benchSink "Product25" (times `div` 26) (f n val)
452+ ]
453+
454+#ifndef USE_UNBOX
455+{-# INLINE benchVar #-}
456+benchVar ::
457+ String
458+ -> (forall a. (NFData a, SERIALIZE_CLASS a) =>
459+ Int -> a -> Int -> IO ())
460+ -> BinTree Int
461+ -> [Int]
462+ -> Int
463+ -> Benchmark
464+benchVar gname f tInt lInt times =
465+ bgroup gname
466+ [ let !n = getSize tInt
467+ in benchSink "bintree-int" times (f n tInt)
468+ , let !n = getSize lInt
469+ in benchSink "list-int" times (f n lInt)
470+ ]
471+
472+{-
473+{-# INLINE benchGeneric #-}
474+benchGeneric
475+ :: (NFData b, Serialize b)
476+ => String
477+ -> String
478+ -> (forall a. (NFData a, Serialize a) =>
479+ Int -> a -> Int -> IO ())
480+ -> b
481+ -> Int
482+ -> Benchmark
483+benchGeneric gname valId f val times =
484+ bgroup gname
485+ [ let !n = getSize val
486+ in benchSink valId times (f n val)
487+ ]
488+-}
489+
490+{-# INLINE benchLargeRec #-}
491+benchLargeRec ::
492+ String
493+ -> (forall a. (NFData a, Serialize a) =>
494+ Int -> a -> Int -> IO ())
495+ -> RecNonCompatible
496+ -> RecCompatible
497+ -> Int
498+ -> Benchmark
499+benchLargeRec gname f recL recR times =
500+ bgroup gname
501+ [ let !n = getSize recL
502+ in benchSink "RecNonCompatible" times (f n recL)
503+ , let !n = getSize recR
504+ in benchSink "RecCompatible" times (f n recR)
505+ ]
506+#endif
507+
508+-- Times is scaled by the number of constructors to normalize
509+#ifdef USE_UNBOX
510+allBenchmarks :: Int -> [Benchmark]
511+allBenchmarks times =
512+#else
513+allBenchmarks ::
514+ BinTree Int -> [Int] -> RecNonCompatible -> RecCompatible -> Int -> [Benchmark]
515+allBenchmarks tInt lInt recL recR times =
516+#endif
517+ [ bgroup "sizeOf"
518+ [
519+#ifndef USE_UNBOX
520+ bench "bintree-int" $ nf getSize tInt
521+ , bench "list-int" $ nf getSize lInt
522+#endif
523+ ]
524+ , benchConst "poke" (const pokeTimes) times
525+ -- , benchConst "pokeWithSize" (const pokeTimesWithSize) times
526+ , benchConst "encode" (const encodeTimes) times
527+ , benchConst "peek" peekTimes times
528+ , benchConst "roundtrip" (const roundtrip) times
529+#ifndef USE_UNBOX
530+ , benchVar "poke" (const pokeTimes) tInt lInt 1
531+ -- , benchVar "pokeWithSize" (const pokeTimesWithSize) tInt lInt 1
532+ , benchVar "encode" (const encodeTimes) tInt lInt 1
533+ , benchVar "peek" peekTimes tInt lInt 1
534+ , benchVar "roundtrip" (const roundtrip) tInt lInt 1
535+ , benchLargeRec "poke" (const pokeTimes) recL recR times
536+ , benchLargeRec "encode" (const encodeTimes) recL recR times
537+ , benchLargeRec "peek" peekTimes recL recR times
538+ , benchLargeRec "roundtrip" (const roundtrip) recL recR times
539+#endif
540+ ]
541+
542+-------------------------------------------------------------------------------
543+-- Driver
544+-------------------------------------------------------------------------------
545+
546+main :: IO ()
547+main = do
548+#ifndef USE_UNBOX
549+ -- Approximately 100000 constructors
550+ -- Assuming Leaf nodes constitute two constructors (Leaf, Int) and internal
551+ -- nodes 1 level = log_2 (100001/3) + 1 = 16
552+ !(tInt :: BinTree Int) <- force <$> mkBinTree 16
553+
554+ let !recL = valRecNonCompatible
555+ let !recR = valRecCompatible
556+
557+ -- Approximately 100000 constructors, assuming two constructors (Cons, Int)
558+ -- per element.
559+ let lInt = [1..50000 :: Int]
560+ let !len = length lInt -- evaluate the list
561+#endif
562+#ifndef FUSION_CHECK
563+#ifdef USE_UNBOX
564+ runWithCLIOpts defaultStreamSize allBenchmarks
565+#else
566+ len
567+ `seq` runWithCLIOpts
568+ defaultStreamSize
569+ (allBenchmarks tInt lInt recL recR)
570+#endif
571+#else
572+ -- Enable FUSION_CHECK macro at the beginning of the file
573+ -- Enable one benchmark below, and run the benchmark
574+ -- Check the .dump-simpl output
575+ let value = 100000
576+ -- print $ getSize (CDT1C3 4 2)
577+ -- print $ getSize tInt
578+ -- print $ getSize lInt
579+
580+ -- pokeTimes tInt 1
581+
582+ -- peekTimes ((CDT1C2 (5 :: Int)) :: CustomDT1) value
583+ -- peekTimes (Sum2525) value
584+ -- peekTimes (Product25 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25) value
585+ -- peekTimes tInt 1
586+ let !n = getSize lInt
587+ peekTimes n lInt 1
588+
589+ -- roundtrip ((CDT1C2 (5 :: Int)) :: CustomDT1) value
590+ return ()
591+#endif
benchmark/Streamly/Benchmark/Data/Serialize/RecCompatible.hsnew file+24
@@ -0,0 +1,24 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+
3+module Streamly.Benchmark.Data.Serialize.RecCompatible
4+ ( RecCompatible(..)
5+ , valRecCompatible
6+ ) where
7+
8+--------------------------------------------------------------------------------
9+-- Imports
10+--------------------------------------------------------------------------------
11+
12+import Streamly.Internal.Data.MutByteArray (Serialize)
13+import Streamly.Benchmark.Data.Serialize.TH (genLargeRecord)
14+
15+import qualified Streamly.Internal.Data.MutByteArray as Serialize
16+
17+--------------------------------------------------------------------------------
18+-- Code
19+--------------------------------------------------------------------------------
20+
21+$(genLargeRecord "RecCompatible" 50)
22+$(Serialize.deriveSerializeWith
23+ (Serialize.encodeRecordFields True)
24+ [d|instance Serialize RecCompatible|])
benchmark/Streamly/Benchmark/Data/Serialize/RecNonCompatible.hsnew file+21
@@ -0,0 +1,21 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+
3+module Streamly.Benchmark.Data.Serialize.RecNonCompatible
4+ ( RecNonCompatible(..)
5+ , valRecNonCompatible
6+ ) where
7+
8+--------------------------------------------------------------------------------
9+-- Imports
10+--------------------------------------------------------------------------------
11+
12+import Streamly.Benchmark.Data.Serialize.TH (genLargeRecord)
13+
14+import qualified Streamly.Internal.Data.MutByteArray as Serialize
15+
16+--------------------------------------------------------------------------------
17+-- Code
18+--------------------------------------------------------------------------------
19+
20+$(genLargeRecord "RecNonCompatible" 50)
21+$(Serialize.deriveSerialize [d|instance Serialize.Serialize RecNonCompatible|])
benchmark/Streamly/Benchmark/Data/Serialize/TH.hsnew file+76
@@ -0,0 +1,76 @@
1+{-# LANGUAGE TemplateHaskell #-}
2+
3+module Streamly.Benchmark.Data.Serialize.TH (genLargeRecord) where
4+
5+--------------------------------------------------------------------------------
6+-- Imports
7+--------------------------------------------------------------------------------
8+
9+import Language.Haskell.TH
10+
11+import Streamly.Internal.Data.MutByteArray (makeI)
12+import Control.DeepSeq (NFData(..))
13+
14+--------------------------------------------------------------------------------
15+-- Large Record
16+--------------------------------------------------------------------------------
17+
18+genLargeRecord :: String -> Int -> Q [Dec]
19+genLargeRecord tyName numFields =
20+ sequence
21+ [ dataD
22+ (pure [])
23+ (mkName tyName)
24+ []
25+ Nothing
26+ [mkCon tyName]
27+ [derivClause Nothing [conT ''Eq, conT ''Show]]
28+ , mkValueSigDec
29+ , mkValueDec
30+ , nfDataInstance tyName
31+ ]
32+
33+ where
34+
35+ fieldTypeChoices = [conT ''()]
36+ chooseCycle i xs = xs !! (i `mod` length xs)
37+ nfDataInstance nm =
38+ instanceD
39+ (pure [])
40+ (appT (conT ''NFData) (conT (mkName nm)))
41+ [ funD
42+ 'rnf
43+ [ clause
44+ [ conP
45+ (mkName nm)
46+ (varP . makeI <$> [0 .. (numFields - 1)])
47+ ]
48+ (normalB
49+ (foldl
50+ (\b a -> [|rnf $(b) `seq` rnf $(a)|])
51+ [|()|]
52+ (varE . makeI <$> [0 .. (numFields - 1)])))
53+ []
54+ ]
55+ ]
56+ valueName = mkName $ "val" ++ tyName
57+ mkValueSigDec = sigD valueName [t|$(conT (mkName tyName))|]
58+ mkValueDec =
59+ funD
60+ valueName
61+ [ clause
62+ []
63+ (normalB
64+ (foldl
65+ (\b a -> [|$(b) $(a)|])
66+ (conE (mkName tyName))
67+ (conE '() <$ [0 .. (numFields - 1)])))
68+ []
69+ ]
70+ mkCon nm = recC (mkName nm) (mkField <$> [0 .. (numFields - 1)])
71+ mkField i =
72+ varBangType
73+ (mkName ("field" ++ show i))
74+ (bangType
75+ (bang noSourceUnpackedness noSourceStrictness)
76+ (chooseCycle i fieldTypeChoices))
benchmark/Streamly/Benchmark/Data/Stream.hs+57
@@ -9,12 +9,19 @@
99{-# LANGUAGE ScopedTypeVariables #-}
1010{-# LANGUAGE RankNTypes #-}
1111
12+#undef FUSION_CHECK
13+#ifdef FUSION_CHECK
14+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
15+#endif
16+
1217module Main (main) where
1318
1419import Streamly.Benchmark.Common.Handle (mkHandleBenchEnv)
1520
1621import qualified Stream.Eliminate as Elimination
22+#ifndef USE_STREAMLY_CORE
1723import qualified Stream.Exceptions as Exceptions
24+#endif
1825import qualified Stream.Expand as NestedStream
1926import qualified Stream.Generate as Generation
2027import qualified Stream.Lift as Lift
@@ -26,8 +33,21 @@ import qualified Stream.Transform as Transformation
2633
2734import Streamly.Benchmark.Common
2835
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+
2945moduleName :: String
46+#ifdef USE_STREAMK
47+moduleName = "Data.Stream.StreamDK"
48+#else
3049moduleName = "Data.Stream"
50+#endif
3151
3252-------------------------------------------------------------------------------
3353-- Main
@@ -38,6 +58,7 @@ moduleName = "Data.Stream"
3858--
3959main :: IO ()
4060main = do
61+#ifndef FUSION_CHECK
4162 env <- mkHandleBenchEnv
4263 runWithCLIOpts defaultStreamSize (allBenchmarks env)
4364
@@ -46,7 +67,9 @@ main = do
4667 allBenchmarks env size = Prelude.concat
4768 [ Generation.benchmarks moduleName size
4869 , Elimination.benchmarks moduleName size
70+#ifndef USE_STREAMLY_CORE
4971 , Exceptions.benchmarks moduleName env size
72+#endif
5073#ifdef USE_PRELUDE
5174 , Split.benchmarks moduleName env
5275#endif
@@ -55,3 +78,37 @@ main = do
5578 , Lift.benchmarks moduleName size
5679 , NestedStream.benchmarks moduleName size
5780 ]
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/Async.hsdeleted−224
@@ -1,224 +0,0 @@
1−{-# LANGUAGE FlexibleContexts #-}
2−-- |
3−-- Module : Main
4−-- Copyright : (c) 2018 Composewell Technologies
5−--
6−-- License : BSD3
7−-- Maintainer : streamly@composewell.com
8−
9−import Stream.Common
10− (composeN, benchIO, benchIOSink, benchIOSrc, sourceUnfoldrM)
11−import Streamly.Data.Stream (Stream)
12−import Streamly.Internal.Data.Stream.Async (MonadAsync)
13−
14−import qualified Data.List as List
15−import qualified Streamly.Data.Fold as Fold
16−import qualified Streamly.Data.Stream as Stream
17−import qualified Streamly.Internal.Data.Stream.Async as Async
18−
19−import Gauge
20−import Prelude hiding (mapM)
21−import Streamly.Benchmark.Common
22−
23−moduleName :: String
24−moduleName = "Data.Stream.Async"
25−
26−-- XXX Write inspection tests to make sure no dictionaries are being passed
27−-- around to find specialization issues. Could be really bad for perf.
28−
29−-------------------------------------------------------------------------------
30−-- Mapping
31−-------------------------------------------------------------------------------
32−
33−{-# INLINE mapM #-}
34−mapM ::
35− MonadAsync m
36− => Int
37− -> Stream m Int
38− -> m ()
39−mapM n = composeN n $ Async.mapM return
40−
41−o_1_space_mapping :: Int -> [Benchmark]
42−o_1_space_mapping value =
43− [ bgroup "mapping"
44− [ benchIOSink value "mapM" $ mapM 1
45− ]
46− ]
47−
48−-------------------------------------------------------------------------------
49−-- Size conserving transformations (reordering, buffering, etc.)
50−-------------------------------------------------------------------------------
51−
52−o_n_heap_buffering :: Int -> [Benchmark]
53−o_n_heap_buffering value =
54− [ bgroup "buffered"
55− [benchIOSink value "mkAsync" (Stream.fold Fold.drain . Async.eval)]
56− ]
57−
58−-------------------------------------------------------------------------------
59−-- Joining
60−-------------------------------------------------------------------------------
61−
62−{-# INLINE async2 #-}
63−async2 :: Int -> Int -> IO ()
64−async2 count n =
65− Stream.fold Fold.drain $
66− sourceUnfoldrM count n `Async.append` sourceUnfoldrM count (n + 1)
67−
68−{-# INLINE concatAsync2 #-}
69−concatAsync2 :: Int -> Int -> IO ()
70−concatAsync2 count n =
71− Stream.fold Fold.drain $
72− Async.concatList [sourceUnfoldrM count n, sourceUnfoldrM count (n + 1)]
73−
74−{-# INLINE interleave2 #-}
75−interleave2 :: Int -> Int -> IO ()
76−interleave2 count n =
77− Stream.fold Fold.drain $
78− sourceUnfoldrM count n `Async.interleave` sourceUnfoldrM count (n + 1)
79−
80−o_1_space_joining :: Int -> [Benchmark]
81−o_1_space_joining value =
82− [ bgroup "joining"
83− [ benchIOSrc1 "async (2 of n/2)" (async2 (value `div` 2))
84− , benchIOSrc1 "concat async (2 of n/2)" (concatAsync2 (value `div` 2))
85− , benchIOSrc1 "interleave (2 of n/2)" (interleave2 (value `div` 2))
86− ]
87− ]
88−
89−-------------------------------------------------------------------------------
90−-- Concat
91−-------------------------------------------------------------------------------
92−
93−{-# INLINE sourceFoldMapWith #-}
94−sourceFoldMapWith :: Int -> Int -> Stream IO Int
95−sourceFoldMapWith value n =
96− Async.concatMap Stream.fromPure $ Stream.fromList [n..n+value]
97−
98−{-# INLINE sourceFoldMapWithStream #-}
99−sourceFoldMapWithStream :: Int -> Int -> Stream IO Int
100−sourceFoldMapWithStream value n =
101− Async.concatMap Stream.fromPure $ Stream.enumerateFromTo n (n + value)
102−
103−{-# INLINE concatFoldableWith #-}
104−concatFoldableWith :: Int -> Int -> Stream IO Int
105−concatFoldableWith value n =
106− let step x =
107− if x <= n + value
108− then Just (Stream.fromPure x, x + 1)
109− else Nothing
110− list = List.unfoldr step n
111− in Async.concatList list
112−
113−o_1_space_concatFoldable :: Int -> [Benchmark]
114−o_1_space_concatFoldable value =
115− [ bgroup "concat-foldable"
116− [ benchIOSrc "foldMapWith (<>) (List)"
117− (sourceFoldMapWith value)
118− , benchIOSrc "foldMapWith (<>) (Stream)"
119− (sourceFoldMapWithStream value)
120− , benchIOSrc "S.concatFoldableWith (<>) (List)"
121− (concatFoldableWith value)
122− ]
123− ]
124−
125−{-# INLINE concatMapStreamsWith #-}
126−concatMapStreamsWith
127− :: Int
128− -> Int
129− -> Int
130− -> IO ()
131−concatMapStreamsWith outer inner n =
132− Stream.fold Fold.drain
133− $ Async.concatMap (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
134−
135−{-# INLINE concatFmapStreamsWith #-}
136−concatFmapStreamsWith
137− :: Int
138− -> Int
139− -> Int
140− -> IO ()
141−concatFmapStreamsWith outer inner n =
142− Stream.fold Fold.drain
143− $ Async.concat
144− $ fmap (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
145−
146−{-# INLINE concatMapInterleaveStreamsWith #-}
147−concatMapInterleaveStreamsWith
148− :: Int
149− -> Int
150− -> Int
151− -> IO ()
152−concatMapInterleaveStreamsWith outer inner n =
153− Stream.fold Fold.drain
154− $ Async.concatMapInterleave
155− (sourceUnfoldrM inner) (sourceUnfoldrM outer n)
156−
157−o_1_space_concatMap :: Int -> [Benchmark]
158−o_1_space_concatMap value =
159− value2 `seq`
160− [ bgroup "concat"
161− [ benchIO "concatMapWith (n of 1)"
162− (concatMapStreamsWith value 1)
163− , benchIO "concatMapWith (sqrt x of sqrt x)"
164− (concatMapStreamsWith value2 value2)
165− , benchIO "concatMapWith (1 of n)"
166− (concatMapStreamsWith 1 value)
167− , benchIO "concat . fmap (n of 1)"
168− (concatFmapStreamsWith value 1)
169− , benchIO "concatMapInterleaveWith (n of 1)"
170− (concatMapInterleaveStreamsWith value 1)
171− , benchIO "concatMapInterleaveWith (sqrt x of sqrt x)"
172− (concatMapInterleaveStreamsWith value2 value2)
173− , benchIO "concatMapInterleaveWith (1 of n)"
174− (concatMapInterleaveStreamsWith 1 value)
175− ]
176− ]
177−
178− where
179−
180− value2 = round $ sqrt (fromIntegral value :: Double)
181−
182−-------------------------------------------------------------------------------
183−-- Monadic outer product
184−-------------------------------------------------------------------------------
185−
186−{-# INLINE toNullAp #-}
187−toNullAp :: Int -> Int -> IO ()
188−toNullAp linearCount start =
189− Stream.fold Fold.drain
190− $ Async.apply
191− (fmap (+) (sourceUnfoldrM nestedCount2 start))
192− (sourceUnfoldrM nestedCount2 start)
193−
194− where
195−
196− nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
197−
198−o_1_space_outerProduct :: Int -> [Benchmark]
199−o_1_space_outerProduct value =
200− [ bgroup "monad-outer-product"
201− [ benchIO "toNullAp" $ toNullAp value
202− ]
203− ]
204−
205−-------------------------------------------------------------------------------
206−-- Main
207−-------------------------------------------------------------------------------
208−
209−main :: IO ()
210−main = runWithCLIOpts defaultStreamSize allBenchmarks
211−
212−
213− where
214−
215− allBenchmarks value =
216− [ bgroup (o_1_space_prefix moduleName) $ concat
217− [ o_1_space_mapping value
218− , o_1_space_concatFoldable value
219− , o_1_space_concatMap value
220− , o_1_space_outerProduct value
221− , o_1_space_joining value
222− ]
223− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_buffering value)
224− ]
benchmark/Streamly/Benchmark/Data/Stream/Common.hs+133−66
@@ -9,9 +9,16 @@
99-- License : BSD-3-Clause
1010-- Maintainer : streamly@composewell.com
1111
12+#ifdef USE_PRELUDE
13+{-# OPTIONS_GHC -Wno-deprecations #-}
14+#endif
15+
1216module Stream.Common
1317 ( MonadAsync
1418
19+ , fromStream
20+ , toStream
21+
1522 -- Generation
1623 , fromListM
1724 , fromFoldableM
@@ -37,8 +44,10 @@ module Stream.Common
3744 , benchIO
3845
3946 -- Benchmarking functions
47+#ifdef USE_STREAMK
4048 , concatStreamsWith
41− , concatPairsWith
49+ , mergeMapWith
50+#endif
4251 , apDiscardFst
4352 , apDiscardSnd
4453 , apLiftA2
@@ -62,11 +71,12 @@ module Stream.Common
6271 )
6372where
6473
74+#if !MIN_VERSION_base(4,18,0)
6575import Control.Applicative (liftA2)
76+#endif
6677import Control.DeepSeq (NFData)
6778import Control.Exception (try)
6879import GHC.Exception (ErrorCall)
69−import Streamly.Internal.Data.Stream (Stream)
7080import System.Random (randomRIO)
7181
7282import qualified Streamly.Internal.Data.Fold as Fold
@@ -76,42 +86,97 @@ import qualified Streamly.Internal.Data.Pipe as Pipe
7686import Streamly.Prelude (foldl', scanl')
7787import qualified Streamly.Internal.Data.Stream.IsStream as Stream
7888import qualified Streamly.Prelude as Stream
89+import qualified Streamly.Prelude as StreamK
7990import Streamly.Benchmark.Prelude
8091 ( composeN, sourceConcatMapId, benchIOSink
81− , concatStreamsWith, concatPairsWith
92+ , concatStreamsWith
8293 )
8394#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
84102import qualified Streamly.Internal.Data.Stream as Stream
103+import qualified Streamly.Internal.Data.Stream as StreamK
104+#endif
85105#endif
86106
87−import Gauge
88−import Prelude hiding (mapM, replicate)
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
89123
90124#ifdef USE_PRELUDE
125+type Stream = Stream.SerialT
91126type MonadAsync m = Stream.MonadAsync m
127+mkCross = id
128+unCross = id
92129#else
93130type 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
94145#endif
95146
96−{-# INLINE append #-}
97−append :: Stream m a -> Stream m a -> Stream m a
98147#ifdef USE_PRELUDE
148+{-# INLINE append #-}
149+append :: Monad m => Stream m a -> Stream m a -> Stream m a
99150append = Stream.serial
100151#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
101157append = Stream.append
102158#endif
159+#endif
103160
104161{-# INLINE append2 #-}
105162append2 :: Monad m => Stream m a -> Stream m a -> Stream m a
106163#ifdef USE_PRELUDE
107164append2 = Stream.append
108165#else
109−append2 = Stream.append2
166+append2 = D.append
110167#endif
111168
112169{-# INLINE drain #-}
113170drain :: 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
114177drain = Stream.fold Fold.drain
178+toList = Stream.fold Fold.toList
179+#endif
115180
116181{-# INLINE fromListM #-}
117182fromListM :: MonadAsync m => [m a] -> Stream m a
@@ -126,7 +191,7 @@ fromFoldableM :: MonadAsync m => [m a] -> Stream m a
126191#ifdef USE_PRELUDE
127192fromFoldableM = Stream.fromFoldableM
128193#else
129−fromFoldableM = Stream.sequence . Stream.fromFoldable
194+fromFoldableM = Stream.sequence . toStream . StreamK.fromFoldable
130195#endif
131196
132197{-# INLINE sourceUnfoldrM #-}
@@ -163,8 +228,8 @@ sourceUnfoldrAction value n = Stream.unfoldr step n
163228 else Just (return cnt, cnt + 1)
164229
165230{-# INLINE sourceFromFoldable #-}
166−sourceFromFoldable :: Int -> Int -> Stream m Int
167−sourceFromFoldable value n = Stream.fromFoldable [n..n+value]
231+sourceFromFoldable :: Monad m => Int -> Int -> Stream m Int
232+sourceFromFoldable value n = toStream $ StreamK.fromFoldable [n..n+value]
168233
169234#ifndef USE_PRELUDE
170235{-# INLINE benchIOSink #-}
@@ -189,43 +254,45 @@ benchIO :: (NFData b) => String -> (Int -> IO b) -> Benchmark
189254benchIO name f = bench name $ nfIO $ randomRIO (1,1) >>= f
190255
191256#ifndef USE_PRELUDE
257+#ifdef USE_STREAMK
192258{-# INLINE concatStreamsWith #-}
193259concatStreamsWith
194− :: (Stream IO Int -> Stream IO Int -> Stream IO Int)
260+ :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
195261 -> Int
196262 -> Int
197263 -> Int
198264 -> IO ()
199265concatStreamsWith op outer inner n =
200− drain $ Stream.concatMapWith op
201− (sourceUnfoldrM inner)
202− (sourceUnfoldrM outer n)
266+ drain $ toStream $ StreamK.concatMapWith op
267+ (fromStream . sourceUnfoldrM inner)
268+ (fromStream $ sourceUnfoldrM outer n)
203269
204−{-# INLINE concatPairsWith #-}
205−concatPairsWith
206− :: (Stream IO Int -> Stream IO Int -> Stream IO Int)
270+{-# INLINE mergeMapWith #-}
271+mergeMapWith
272+ :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
207273 -> Int
208274 -> Int
209275 -> Int
210276 -> IO ()
211−concatPairsWith op outer inner n =
212− drain $ Stream.concatPairsWith op
213− (sourceUnfoldrM inner)
214− (sourceUnfoldrM outer n)
277+mergeMapWith op outer inner n =
278+ drain $ toStream $ StreamK.mergeMapWith op
279+ (fromStream . sourceUnfoldrM inner)
280+ (fromStream $ sourceUnfoldrM outer n)
281+#endif
215282
216283{-# INLINE sourceConcatMapId #-}
217284sourceConcatMapId :: (Monad m)
218285 => Int -> Int -> Stream m (Stream m Int)
219286sourceConcatMapId value n =
220− Stream.fromFoldable $ fmap (Stream.fromEffect . return) [n..n+value]
287+ Stream.fromList $ fmap (D.fromEffect . return) [n..n+value]
221288#endif
222289
223290{-# INLINE apDiscardFst #-}
224291apDiscardFst :: MonadAsync m =>
225292 Int -> Int -> m ()
226−apDiscardFst linearCount start = drain $
227− sourceUnfoldrM nestedCount2 start
228− *> sourceUnfoldrM nestedCount2 start
293+apDiscardFst linearCount start = drain $ toStream $ unCross $
294+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
295+ *> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
229296
230297 where
231298
@@ -233,9 +300,9 @@ apDiscardFst linearCount start = drain $
233300
234301{-# INLINE apDiscardSnd #-}
235302apDiscardSnd :: MonadAsync m => Int -> Int -> m ()
236−apDiscardSnd linearCount start = drain $
237− sourceUnfoldrM nestedCount2 start
238− <* sourceUnfoldrM nestedCount2 start
303+apDiscardSnd linearCount start = drain $ toStream $ unCross $
304+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
305+ <* mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
239306
240307 where
241308
@@ -243,9 +310,9 @@ apDiscardSnd linearCount start = drain $
243310
244311{-# INLINE apLiftA2 #-}
245312apLiftA2 :: MonadAsync m => Int -> Int -> m ()
246−apLiftA2 linearCount start = drain $
247− liftA2 (+) (sourceUnfoldrM nestedCount2 start)
248− (sourceUnfoldrM nestedCount2 start)
313+apLiftA2 linearCount start = drain $ toStream $ unCross $
314+ liftA2 (+) (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
315+ (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
249316
250317 where
251318
@@ -253,9 +320,9 @@ apLiftA2 linearCount start = drain $
253320
254321{-# INLINE toNullAp #-}
255322toNullAp :: MonadAsync m => Int -> Int -> m ()
256−toNullAp linearCount start = drain $
257− (+) <$> sourceUnfoldrM nestedCount2 start
258− <*> sourceUnfoldrM nestedCount2 start
323+toNullAp linearCount start = drain $ toStream $ unCross $
324+ (+) <$> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
325+ <*> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
259326
260327 where
261328
@@ -263,9 +330,9 @@ toNullAp linearCount start = drain $
263330
264331{-# INLINE monadThen #-}
265332monadThen :: MonadAsync m => Int -> Int -> m ()
266−monadThen linearCount start = drain $ do
267− sourceUnfoldrM nestedCount2 start >>
268− sourceUnfoldrM nestedCount2 start
333+monadThen linearCount start = drain $ toStream $ unCross $ do
334+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start) >>
335+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
269336
270337 where
271338
@@ -273,9 +340,9 @@ monadThen linearCount start = drain $ do
273340
274341{-# INLINE toNullM #-}
275342toNullM :: MonadAsync m => Int -> Int -> m ()
276−toNullM linearCount start = drain $ do
277− x <- sourceUnfoldrM nestedCount2 start
278− y <- sourceUnfoldrM nestedCount2 start
343+toNullM linearCount start = drain $ toStream $ unCross $ do
344+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
345+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
279346 return $ x + y
280347
281348 where
@@ -284,56 +351,56 @@ toNullM linearCount start = drain $ do
284351
285352{-# INLINE toNullM3 #-}
286353toNullM3 :: MonadAsync m => Int -> Int -> m ()
287−toNullM3 linearCount start = drain $ do
288− x <- sourceUnfoldrM nestedCount3 start
289− y <- sourceUnfoldrM nestedCount3 start
290− z <- sourceUnfoldrM nestedCount3 start
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)
291358 return $ x + y + z
292359 where
293360 nestedCount3 = round (fromIntegral linearCount**(1/3::Double))
294361
295362{-# INLINE filterAllOutM #-}
296363filterAllOutM :: MonadAsync m => Int -> Int -> m ()
297−filterAllOutM linearCount start = drain $ do
298− x <- sourceUnfoldrM nestedCount2 start
299− y <- sourceUnfoldrM nestedCount2 start
364+filterAllOutM linearCount start = drain $ toStream $ unCross $ do
365+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
366+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
300367 let s = x + y
301368 if s < 0
302369 then return s
303− else Stream.nil
370+ else mkCross StreamK.nil
304371 where
305372 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
306373
307374{-# INLINE filterAllInM #-}
308375filterAllInM :: MonadAsync m => Int -> Int -> m ()
309−filterAllInM linearCount start = drain $ do
310− x <- sourceUnfoldrM nestedCount2 start
311− y <- sourceUnfoldrM nestedCount2 start
376+filterAllInM linearCount start = drain $ toStream $ unCross $ do
377+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
378+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
312379 let s = x + y
313380 if s > 0
314381 then return s
315− else Stream.nil
382+ else mkCross StreamK.nil
316383 where
317384 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
318385
319386{-# INLINE filterSome #-}
320387filterSome :: MonadAsync m => Int -> Int -> m ()
321−filterSome linearCount start = drain $ do
322− x <- sourceUnfoldrM nestedCount2 start
323− y <- sourceUnfoldrM nestedCount2 start
388+filterSome linearCount start = drain $ toStream $ unCross $ do
389+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
390+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
324391 let s = x + y
325392 if s > 1100000
326393 then return s
327− else Stream.nil
394+ else mkCross StreamK.nil
328395 where
329396 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
330397
331398{-# INLINE breakAfterSome #-}
332399breakAfterSome :: Int -> Int -> IO ()
333400breakAfterSome linearCount start = do
334− (_ :: Either ErrorCall ()) <- try $ drain $ do
335− x <- sourceUnfoldrM nestedCount2 start
336− y <- sourceUnfoldrM nestedCount2 start
401+ (_ :: Either ErrorCall ()) <- try $ drain $ toStream $ unCross $ do
402+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
403+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
337404 let s = x + y
338405 if s > 1100000
339406 then error "break"
@@ -344,9 +411,9 @@ breakAfterSome linearCount start = do
344411
345412{-# INLINE toListM #-}
346413toListM :: MonadAsync m => Int -> Int -> m [Int]
347−toListM linearCount start = Stream.fold Fold.toList $ do
348− x <- sourceUnfoldrM nestedCount2 start
349− y <- sourceUnfoldrM nestedCount2 start
414+toListM linearCount start = toList $ toStream $ unCross $ do
415+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
416+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
350417 return $ x + y
351418 where
352419 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
@@ -356,9 +423,9 @@ toListM linearCount start = Stream.fold Fold.toList $ do
356423{-# INLINE toListSome #-}
357424toListSome :: MonadAsync m => Int -> Int -> m [Int]
358425toListSome linearCount start =
359− Stream.fold Fold.toList $ Stream.take 10000 $ do
360− x <- sourceUnfoldrM nestedCount2 start
361− y <- sourceUnfoldrM nestedCount2 start
426+ toList $ Stream.take 10000 $ toStream $ unCross $ do
427+ x <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
428+ y <- mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
362429 return $ x + y
363430 where
364431 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
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/Data/Stream/Eliminate.hs+71−41
@@ -6,9 +6,15 @@
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
@@ -26,39 +32,41 @@ 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
35−#endif
36−import qualified Streamly.Internal.Data.Fold as Fold
37−#ifdef USE_PRELUDE
38−import qualified Streamly.Internal.Data.Stream.IsStream as S
39−#else
40−import qualified Streamly.Internal.Data.Stream as S
40+import qualified Streamly.Internal.Data.Stream as D
4141#endif
4242
43−import Gauge
44−import Streamly.Internal.Data.Stream (Stream)
4543#ifdef USE_PRELUDE
4644import Streamly.Prelude (fromSerial)
4745import Streamly.Benchmark.Prelude
46+import qualified Streamly.Internal.Data.Stream.IsStream as S
47+import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
4848#else
4949import Stream.Common
50− ( sourceUnfoldr
51− , sourceUnfoldrM
52− , sourceUnfoldrAction
53− , benchIOSink
54− )
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
5558#endif
59+
60+import Test.Tasty.Bench
5661import Streamly.Benchmark.Common
5762import Prelude hiding (length, sum, or, and, any, all, notElem, elem, (!!),
5863 lookup, repeat, minimum, maximum, product, last, mapM_, init)
5964import qualified Prelude
6065
6166#ifdef USE_PRELUDE
67+type Stream = S.SerialT
68+fromStream = id
69+
6270{-# INLINE repeat #-}
6371repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
6472repeat count = S.take count . S.repeat
@@ -124,12 +132,14 @@ foldableAny :: Int -> Int -> Bool
124132foldableAny value n =
125133 Prelude.any (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
126134
135+{- HLINT ignore "Use all"-}
127136{-# INLINE foldableAnd #-}
128137foldableAnd :: Int -> Int -> Bool
129138foldableAnd value n =
130139 Prelude.and $ fmap
131140 (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
132141
142+{- HLINT ignore "Use any"-}
133143{-# INLINE foldableOr #-}
134144foldableOr :: Int -> Int -> Bool
135145foldableOr value n =
@@ -207,6 +217,9 @@ o_1_space_elimination_foldable value =
207217 , bench "minimum" $ nf (foldableMin value) 1
208218 , benchPureSink value "min (ord)" ordInstanceMin
209219 , 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
210223 , bench "length . toList"
211224 $ nf (Prelude.length . foldableToList value) 1
212225 , bench "notElem" $ nf (foldableNotElem value) 1
@@ -229,25 +242,16 @@ o_1_space_elimination_foldable value =
229242 ]
230243 ]
231244
232−o_n_space_elimination_foldable :: Int -> [Benchmark]
233−o_n_space_elimination_foldable value =
234− -- Head recursive strict right folds.
235− [ bgroup "foldl"
236− -- XXX the definitions of minimumBy and maximumBy in Data.Foldable use
237− -- foldl1 which does not work in constant memory for our
238− -- implementation. It works in constant memory for lists but even for
239− -- lists it takes 15x more time compared to our foldl' based
240− -- implementation.
241− [ bench "minimumBy" $ nf (`foldableMinBy` 1) value
242− , bench "maximumBy" $ nf (`foldableMaxBy` 1) value
243− , bench "minimumByList" $ nf (`foldableListMinBy` 1) value
244− ]
245− ]
246−
247245-------------------------------------------------------------------------------
248246-- Stream folds
249247-------------------------------------------------------------------------------
250248
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+
251255{-# INLINE benchPureSink #-}
252256benchPureSink :: NFData b
253257 => Int -> String -> (Stream Identity Int -> b) -> Benchmark
@@ -273,9 +277,13 @@ benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
273277-------------------------------------------------------------------------------
274278
275279{-# INLINE uncons #-}
280+#ifdef USE_STREAMK
281+uncons :: Monad m => StreamK m Int -> m ()
282+#else
276283uncons :: Monad m => Stream m Int -> m ()
284+#endif
277285uncons s = do
278− r <- S.uncons s
286+ r <- StreamK.uncons s
279287 case r of
280288 Nothing -> return ()
281289 Just (_, t) -> uncons t
@@ -300,9 +308,15 @@ foldrMElem e =
300308 else xs)
301309 (return False)
302310
311+#ifdef USE_STREAMK
303312{-# INLINE foldrToStream #-}
304−foldrToStream :: Monad m => Stream m Int -> m (Stream Identity Int)
305−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
306320
307321{-# INLINE foldrMBuild #-}
308322foldrMBuild :: Monad m => Stream m Int -> m [Int]
@@ -446,17 +460,34 @@ o_1_space_elimination_folds value =
446460 ]
447461 , bgroup "Identity"
448462 [ benchIdentitySink value "foldrMElem" (foldrMElem value)
463+#ifdef USE_STREAMK
449464 , benchIdentitySink value "foldrToStreamLength"
465+ (S.fold Fold.length . toStream . runIdentity . foldrToStream)
466+ {-
467+ , benchIdentitySink 16 "foldrToStreamLength (16)"
468+ (S.fold Fold.length . toStream . runIdentity . foldrToStream)
469+ -}
470+#else
471+ {-
472+ , benchIdentitySink 16 "foldrToStreamLength (16)"
450473 (S.fold Fold.length . runIdentity . foldrToStream)
474+ -}
475+#endif
476+ {-
477+ , benchPureSink 16 "foldrMToListLength (16)"
478+ (Prelude.length . runIdentity . foldrMBuild)
479+ -}
451480 , benchPureSink value "foldrMToListLength"
452481 (Prelude.length . runIdentity . foldrMBuild)
453482 ]
454483 ]
455484
456485 -- deconstruction
457− , benchIOSink value "uncons" uncons
458− , benchHoistSink value "length . generally"
459− (S.fold Fold.length . S.generally)
486+ , benchIOSink value "uncons" (uncons . fromStream)
487+#ifndef USE_PRELUDE
488+ , benchHoistSink value "length . generalizeInner"
489+ (S.fold Fold.length . S.generalizeInner)
490+#endif
460491#ifdef USE_PRELUDE
461492 , benchIOSink value "init" init
462493
@@ -577,8 +608,10 @@ o_n_space_elimination_toList value =
577608 [ bgroup "toList"
578609 -- Converting the stream to a list or pure stream in a strict monad
579610 [ benchIOSink value "toList" S.toList
611+#ifndef USE_PRELUDE
580612 , benchIOSink value "toStream"
581613 (S.toStream :: (Stream IO Int -> IO (Stream Identity Int)))
614+#endif
582615 ]
583616 ]
584617#endif
@@ -708,11 +741,8 @@ benchmarks moduleName size =
708741#ifdef USE_PRELUDE
709742 ++ o_n_heap_elimination_foldl size
710743 ++ o_n_heap_elimination_toList size
711−#endif
712− , bgroup (o_n_space_prefix moduleName) $
713− o_n_space_elimination_foldable size
714−#ifdef USE_PRELUDE
715744 ++ o_n_space_elimination_toList size
716745#endif
717− ++ o_n_space_elimination_foldr size
746+ , bgroup (o_n_space_prefix moduleName) $
747+ o_n_space_elimination_foldr size
718748 ]
benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hs+63−38
@@ -10,6 +10,10 @@
1010{-# LANGUAGE FlexibleContexts #-}
1111{-# LANGUAGE ScopedTypeVariables #-}
1212
13+#ifdef USE_PRELUDE
14+{-# OPTIONS_GHC -Wno-deprecations #-}
15+#endif
16+
1317#ifdef __HADDOCK_VERSION__
1418#undef INSPECTION
1519#endif
@@ -23,49 +27,65 @@ module Stream.Exceptions (benchmarks) where
2327
2428import Control.Exception (Exception, throwIO)
2529import Stream.Common (drain)
26−import Streamly.Internal.Data.Stream (Stream)
2730
2831import qualified Data.IORef as Ref
2932import qualified Data.Map.Strict as Map
30−import qualified Stream.Common as Common
3133
32−#ifndef USE_STREAMLY_CORE
3334import Control.Exception (SomeException)
3435import System.IO (Handle, hClose, hPutChar)
3536import qualified Streamly.FileSystem.Handle as FH
3637import qualified Streamly.Internal.FileSystem.Handle as IFH
3738import qualified Streamly.Internal.Data.Unfold as IUF
38−#endif
39+import qualified Streamly.Internal.Data.Unfold.Prelude as IUF
3940
4041#ifdef USE_PRELUDE
4142import qualified Streamly.Internal.Data.Stream.IsStream as Stream
4243#else
4344import qualified Streamly.Internal.Data.Stream as Stream
45+import qualified Streamly.Internal.Data.Stream.Prelude as Stream
4446#endif
4547
46−import Gauge hiding (env)
48+import Test.Tasty.Bench hiding (env)
4749import Prelude hiding (last, length)
4850import Streamly.Benchmark.Common
4951import Streamly.Benchmark.Common.Handle
5052
5153#ifdef INSPECTION
54+import Control.Monad.Catch (MonadCatch)
5255import Test.Inspection
5356
54−import qualified Streamly.Internal.Data.Stream.StreamD as D
57+import qualified Streamly.Internal.Data.Stream as D
5558#endif
5659
57−-------------------------------------------------------------------------------
58−-- stream exceptions
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
6071
61−{-# INLINE replicateM #-}
62−replicateM :: Common.MonadAsync m => Int -> m a -> Stream m a
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
6375#ifdef USE_PRELUDE
64−replicateM = Stream.replicateM
76+afterUnsafe = Stream.after_
77+finallyUnsafe = Stream.finally_
78+bracketUnsafe = Stream.bracket_
6579#else
66−replicateM n = Stream.sequence . Stream.replicate n
80+afterUnsafe = Stream.afterUnsafe
81+finallyUnsafe = Stream.finallyUnsafe
82+bracketUnsafe = Stream.bracketUnsafe
6783#endif
6884
85+-------------------------------------------------------------------------------
86+-- stream exceptions
87+-------------------------------------------------------------------------------
88+
6989data BenchException
7090 = BenchException1
7191 | BenchException2
@@ -95,7 +115,7 @@ retryNone length from = do
95115 where
96116
97117 source ref =
98− replicateM (from + length)
118+ Stream.replicateM (from + length)
99119 $ Ref.modifyIORef' ref (+ 1) >> Ref.readIORef ref
100120
101121retryAll :: Int -> Int -> IO ()
@@ -140,7 +160,6 @@ o_1_space_serial_exceptions length =
140160 ]
141161
142162-- XXX Move these to FileSystem.Handle benchmarks
143−#ifndef USE_STREAMLY_CORE
144163
145164-------------------------------------------------------------------------------
146165-- copy stream exceptions
@@ -149,7 +168,7 @@ o_1_space_serial_exceptions length =
149168-- | Send the file contents to /dev/null with exception handling
150169readWriteOnExceptionStream :: Handle -> Handle -> IO ()
151170readWriteOnExceptionStream inh devNull =
152− let readEx = Stream.onException (hClose inh) (Stream.unfold FH.read inh)
171+ let readEx = Stream.onException (hClose inh) (Stream.unfold FH.reader inh)
153172 in Stream.fold (FH.write devNull) readEx
154173
155174#ifdef INSPECTION
@@ -159,8 +178,9 @@ inspect $ hasNoTypeClasses 'readWriteOnExceptionStream
159178-- | Send the file contents to /dev/null with exception handling
160179readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
161180readWriteHandleExceptionStream inh devNull =
162− let handler (_e :: SomeException) = Stream.fromEffect (hClose inh >> return 10)
163− readEx = Stream.handle handler (Stream.unfold FH.read inh)
181+ let handler (_e :: SomeException) =
182+ return $ Stream.fromEffect (hClose inh >> return 10)
183+ readEx = Stream.handle handler (Stream.unfold FH.reader inh)
164184 in Stream.fold (FH.write devNull) readEx
165185
166186#ifdef INSPECTION
@@ -170,7 +190,8 @@ inspect $ hasNoTypeClasses 'readWriteHandleExceptionStream
170190-- | Send the file contents to /dev/null with exception handling
171191readWriteFinally_Stream :: Handle -> Handle -> IO ()
172192readWriteFinally_Stream inh devNull =
173− let readEx = Stream.finally_ (hClose inh) (Stream.unfold FH.read inh)
193+ let readEx =
194+ finallyUnsafe (hClose inh) (Stream.unfold FH.reader inh)
174195 in Stream.fold (FH.write devNull) readEx
175196
176197#ifdef INSPECTION
@@ -179,15 +200,15 @@ inspect $ hasNoTypeClasses 'readWriteFinally_Stream
179200
180201readWriteFinallyStream :: Handle -> Handle -> IO ()
181202readWriteFinallyStream inh devNull =
182− let readEx = Stream.finally (hClose inh) (Stream.unfold FH.read inh)
203+ let readEx = Stream.finally (hClose inh) (Stream.unfold FH.reader inh)
183204 in Stream.fold (FH.write devNull) readEx
184205
185206-- | Send the file contents to /dev/null with exception handling
186207fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
187208fromToBytesBracket_Stream inh devNull =
188− let readEx = Stream.bracket_ (return ()) (\_ -> hClose inh)
189− (\_ -> IFH.getBytes inh)
190− in IFH.putBytes devNull readEx
209+ let readEx = bracketUnsafe (return ()) (\_ -> hClose inh)
210+ (\_ -> fromStreamD $ IFH.read inh)
211+ in IFH.putBytes devNull (toStreamD readEx)
191212
192213#ifdef INSPECTION
193214inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
@@ -196,14 +217,14 @@ inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
196217fromToBytesBracketStream :: Handle -> Handle -> IO ()
197218fromToBytesBracketStream inh devNull =
198219 let readEx = Stream.bracket (return ()) (\_ -> hClose inh)
199− (\_ -> IFH.getBytes inh)
200− in IFH.putBytes devNull readEx
220+ (\_ -> fromStreamD $ IFH.read inh)
221+ in IFH.putBytes devNull (toStreamD readEx)
201222
202223readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
203224readWriteBeforeAfterStream inh devNull =
204225 let readEx =
205226 Stream.after (hClose inh)
206− $ Stream.before (hPutChar devNull 'A') (Stream.unfold FH.read inh)
227+ $ Stream.before (hPutChar devNull 'A') (Stream.unfold FH.reader inh)
207228 in Stream.fold (FH.write devNull) readEx
208229
209230#ifdef INSPECTION
@@ -212,7 +233,7 @@ inspect $ 'readWriteBeforeAfterStream `hasNoType` ''D.Step
212233
213234readWriteAfterStream :: Handle -> Handle -> IO ()
214235readWriteAfterStream inh devNull =
215− let readEx = Stream.after (hClose inh) (Stream.unfold FH.read inh)
236+ let readEx = Stream.after (hClose inh) (Stream.unfold FH.reader inh)
216237 in Stream.fold (FH.write devNull) readEx
217238
218239#ifdef INSPECTION
@@ -221,7 +242,7 @@ inspect $ 'readWriteAfterStream `hasNoType` ''D.Step
221242
222243readWriteAfter_Stream :: Handle -> Handle -> IO ()
223244readWriteAfter_Stream inh devNull =
224− let readEx = Stream.after_ (hClose inh) (Stream.unfold FH.read inh)
245+ let readEx = afterUnsafe (hClose inh) (Stream.unfold FH.reader inh)
225246 in Stream.fold (FH.write devNull) readEx
226247
227248#ifdef INSPECTION
@@ -262,26 +283,34 @@ o_1_space_copy_stream_exceptions env =
262283-- | Send the file contents to /dev/null with exception handling
263284readChunksOnException :: Handle -> Handle -> IO ()
264285readChunksOnException inh devNull =
265− let readEx = IUF.onException (\_ -> hClose inh) FH.readChunks
286+ let readEx = IUF.onException (\_ -> hClose inh) FH.chunkReader
266287 in IUF.fold (IFH.writeChunks devNull) readEx inh
267288
268289#ifdef INSPECTION
290+#if __GLASGOW_HASKELL__ >= 906
291+inspect $ hasNoTypeClassesExcept 'readChunksOnException [''MonadCatch]
292+#else
269293inspect $ hasNoTypeClasses 'readChunksOnException
270294#endif
295+#endif
271296
272297-- | Send the file contents to /dev/null with exception handling
273298readChunksBracket_ :: Handle -> Handle -> IO ()
274299readChunksBracket_ inh devNull =
275− let readEx = IUF.bracket_ return (\_ -> hClose inh) FH.readChunks
300+ let readEx = IUF.bracket_ return (\_ -> hClose inh) FH.chunkReader
276301 in IUF.fold (IFH.writeChunks devNull) readEx inh
277302
278303#ifdef INSPECTION
304+#if __GLASGOW_HASKELL__ >= 906
305+inspect $ hasNoTypeClassesExcept 'readChunksBracket_ [''MonadCatch]
306+#else
279307inspect $ hasNoTypeClasses 'readChunksBracket_
280308#endif
309+#endif
281310
282311readChunksBracket :: Handle -> Handle -> IO ()
283312readChunksBracket inh devNull =
284− let readEx = IUF.bracket return (\_ -> hClose inh) FH.readChunks
313+ let readEx = IUF.bracket return (\_ -> hClose inh) FH.chunkReader
285314 in IUF.fold (IFH.writeChunks devNull) readEx inh
286315
287316o_1_space_copy_exceptions_readChunks :: BenchEnv -> [Benchmark]
@@ -303,10 +332,10 @@ o_1_space_copy_exceptions_readChunks env =
303332-- | Send the file contents to /dev/null with exception handling
304333toChunksBracket_ :: Handle -> Handle -> IO ()
305334toChunksBracket_ inh devNull =
306− let readEx = Stream.bracket_
335+ let readEx = bracketUnsafe
307336 (return ())
308337 (\_ -> hClose inh)
309− (\_ -> IFH.getChunks inh)
338+ (\_ -> fromStreamD $ IFH.readChunks inh)
310339 in Stream.fold (IFH.writeChunks devNull) readEx
311340
312341#ifdef INSPECTION
@@ -318,7 +347,7 @@ toChunksBracket inh devNull =
318347 let readEx = Stream.bracket
319348 (return ())
320349 (\_ -> hClose inh)
321− (\_ -> IFH.getChunks inh)
350+ (\_ -> fromStreamD $ IFH.readChunks inh)
322351 in Stream.fold (IFH.writeChunks devNull) readEx
323352
324353o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
@@ -331,16 +360,12 @@ o_1_space_copy_exceptions_toChunks env =
331360 ]
332361 ]
333362
334−#endif
335−
336363benchmarks :: String -> BenchEnv -> Int -> [Benchmark]
337364benchmarks moduleName _env size =
338365 [ bgroup (o_1_space_prefix moduleName) $ concat
339366 [ o_1_space_serial_exceptions size
340−#ifndef USE_STREAMLY_CORE
341367 , o_1_space_copy_exceptions_readChunks _env
342368 , o_1_space_copy_exceptions_toChunks _env
343369 , o_1_space_copy_stream_exceptions _env
344−#endif
345370 ]
346371 ]
benchmark/Streamly/Benchmark/Data/Stream/Expand.hs+161−114
@@ -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
@@ -20,32 +25,37 @@
2025
2126module Stream.Expand (benchmarks) where
2227
23−import Control.Monad.Trans.Class (lift)
24−import Streamly.Internal.Data.Stream (Stream)
25−
26−import qualified Control.Applicative as AP
27−
2828#ifdef INSPECTION
2929import GHC.Types (SPEC(..))
3030import Test.Inspection
3131
32−import qualified Streamly.Internal.Data.Stream.StreamD as D
32+import qualified Streamly.Internal.Data.Stream as D
3333#endif
3434
3535import qualified Stream.Common as Common
36+import qualified Streamly.Internal.Data.Unfold as UF
37+
3638#ifdef USE_PRELUDE
3739import qualified Streamly.Internal.Data.Stream.IsStream as S
40+import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
3841import Streamly.Benchmark.Prelude
3942 ( sourceFoldMapM, sourceFoldMapWith, sourceFoldMapWithM
4043 , sourceFoldMapWithStream, concatFoldableWith, concatForFoldableWith)
4144#else
4245import qualified Streamly.Internal.Data.Stream as S
43−#endif
44−import qualified Streamly.Internal.Data.Unfold as UF
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
4550import 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
4656
47−import Gauge
48−import Stream.Common hiding (append2)
57+import Test.Tasty.Bench
58+import Stream.Common
4959import Streamly.Benchmark.Common
5060import Prelude hiding (concatMap)
5161
@@ -53,6 +63,7 @@ import Prelude hiding (concatMap)
5363-- Iteration/looping utilities
5464-------------------------------------------------------------------------------
5565
66+#ifdef USE_STREAMK
5667{-# INLINE iterateN #-}
5768iterateN :: (Int -> a -> a) -> a -> Int -> a
5869iterateN g initial count = f count initial
@@ -64,12 +75,16 @@ iterateN g initial count = f count initial
6475
6576-- Iterate a transformation over a singleton stream
6677{-# INLINE iterateSingleton #-}
67−iterateSingleton :: Monad m
68− => (Int -> Stream m Int -> Stream m Int)
78+iterateSingleton :: Applicative m =>
79+ (Int -> CrossStreamK m Int -> CrossStreamK m Int)
6980 -> Int
7081 -> Int
7182 -> Stream m Int
72−iterateSingleton g count n = iterateN g (return n) count
83+iterateSingleton g count n =
84+ toStream
85+ $ StreamK.unCross
86+ $ iterateN g (StreamK.mkCross (StreamK.fromPure n)) count
87+#endif
7388
7489{-
7590-- XXX need to check why this is slower than the explicit recursion above, even
@@ -98,50 +113,28 @@ _iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
98113{-# INLINE serial2 #-}
99114serial2 :: Int -> Int -> IO ()
100115serial2 count n =
101− drain $
102− Common.append (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
116+ drain $ toStream $
117+ Common.append
118+ (fromStream $ sourceUnfoldrM count n)
119+ (fromStream $ sourceUnfoldrM count (n + 1))
103120
104121{-# INLINE serial4 #-}
105122serial4 :: Int -> Int -> IO ()
106123serial4 count n =
107− drain $
124+ drain $ toStream $
108125 Common.append
109− (Common.append (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1)))
110126 (Common.append
111− (sourceUnfoldrM count (n + 2))
112− (sourceUnfoldrM count (n + 3)))
113−
114−{-# INLINE append2 #-}
115−append2 :: Int -> Int -> IO ()
116−append2 count n =
117− drain $
118− Common.append2 (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
119−
120−{-# INLINE append4 #-}
121−append4 :: Int -> Int -> IO ()
122−append4 count n =
123− drain $
124− Common.append2
125− (Common.append2
126− (sourceUnfoldrM count n)
127− (sourceUnfoldrM count (n + 1)))
128− (Common.append2
129− (sourceUnfoldrM count (n + 2))
130− (sourceUnfoldrM count (n + 3)))
131−
132−#ifdef INSPECTION
133−inspect $ hasNoTypeClasses 'append2
134−inspect $ 'append2 `hasNoType` ''SPEC
135−inspect $ 'append2 `hasNoType` ''D.AppendState
136−#endif
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)))
137132
138133o_1_space_joining :: Int -> [Benchmark]
139134o_1_space_joining value =
140135 [ bgroup "joining"
141136 [ benchIOSrc1 "serial (2,x/2)" (serial2 (value `div` 2))
142− , benchIOSrc1 "append (2,x/2)" (append2 (value `div` 2))
143137 , benchIOSrc1 "serial (2,2,x/4)" (serial4 (value `div` 4))
144− , benchIOSrc1 "append (2,2,x/4)" (append4 (value `div` 4))
145138 ]
146139 ]
147140
@@ -177,10 +170,11 @@ o_1_space_concatFoldable value =
177170{-# INLINE concatMap #-}
178171concatMap :: Int -> Int -> Int -> IO ()
179172concatMap outer inner n =
180− drain $ S.concatMap
181− (\_ -> sourceUnfoldrM inner n)
182− (sourceUnfoldrM outer n)
173+ drain $ toStream $ StreamK.concatMap
174+ (\_ -> fromStream $ sourceUnfoldrM inner n)
175+ (fromStream $ sourceUnfoldrM outer n)
183176
177+#ifndef USE_STREAMK
184178{-# INLINE concatMapM #-}
185179concatMapM :: Int -> Int -> Int -> IO ()
186180concatMapM outer inner n =
@@ -192,18 +186,23 @@ concatMapM outer inner n =
192186inspect $ hasNoTypeClasses 'concatMap
193187inspect $ 'concatMap `hasNoType` ''SPEC
194188#endif
189+#endif
195190
196191-- concatMap unfoldr/unfoldr
197192
198193{-# INLINE concatMapPure #-}
199194concatMapPure :: Int -> Int -> Int -> IO ()
200195concatMapPure outer inner n =
201− drain $ S.concatMap
202− (\_ -> sourceUnfoldr inner n)
203− (sourceUnfoldr outer n)
196+ drain $ toStream $ StreamK.concatMap
197+ (\_ -> fromStream $ sourceUnfoldr inner n)
198+ (fromStream $ sourceUnfoldr outer n)
204199
205200#ifdef INSPECTION
201+#if __GLASGOW_HASKELL__ >= 906
202+inspect $ hasNoTypeClassesExcept 'concatMapPure [''Applicative]
203+#else
206204inspect $ hasNoTypeClasses 'concatMapPure
205+#endif
207206inspect $ 'concatMapPure `hasNoType` ''SPEC
208207#endif
209208
@@ -212,15 +211,21 @@ inspect $ 'concatMapPure `hasNoType` ''SPEC
212211{-# INLINE concatMapRepl #-}
213212concatMapRepl :: Int -> Int -> Int -> IO ()
214213concatMapRepl outer inner n =
215− drain $ S.concatMap (S.replicate inner) (sourceUnfoldrM outer n)
214+ drain $ toStream $ StreamK.concatMap
215+ (fromStream . S.replicate inner) (fromStream $ sourceUnfoldrM outer n)
216216
217217#ifdef INSPECTION
218+#if __GLASGOW_HASKELL__ >= 906
219+inspect $ hasNoTypeClassesExcept 'concatMapRepl [''Applicative]
220+#else
218221inspect $ hasNoTypeClasses 'concatMapRepl
222+#endif
219223inspect $ 'concatMapRepl `hasNoType` ''SPEC
220224#endif
221225
222226-- concatMapWith
223227
228+#ifdef USE_STREAMK
224229{-# INLINE concatMapWithSerial #-}
225230concatMapWithSerial :: Int -> Int -> Int -> IO ()
226231concatMapWithSerial = concatStreamsWith Common.append
@@ -230,6 +235,7 @@ inspect $ hasNoTypeClasses 'concatMapWithSerial
230235inspect $ 'concatMapWithSerial `hasNoType` ''SPEC
231236#endif
232237
238+{-
233239{-# INLINE concatMapWithAppend #-}
234240concatMapWithAppend :: Int -> Int -> Int -> IO ()
235241concatMapWithAppend = concatStreamsWith Common.append2
@@ -238,16 +244,20 @@ concatMapWithAppend = concatStreamsWith Common.append2
238244inspect $ hasNoTypeClasses 'concatMapWithAppend
239245inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
240246#endif
247+-}
241248
242−-- concatPairWith
249+-- mergeMapWith
243250
244−{-# INLINE concatPairWithSerial #-}
245−concatPairWithSerial :: Int -> Int -> Int -> IO ()
246−concatPairWithSerial = concatPairsWith Common.append
251+{-# INLINE mergeMapWithSerial #-}
252+mergeMapWithSerial :: Int -> Int -> Int -> IO ()
253+mergeMapWithSerial = mergeMapWith Common.append
247254
248−{-# INLINE concatPairWithAppend #-}
249−concatPairWithAppend :: Int -> Int -> Int -> IO ()
250−concatPairWithAppend = concatPairsWith Common.append2
255+{-
256+{-# INLINE mergeMapWithAppend #-}
257+mergeMapWithAppend :: Int -> Int -> Int -> IO ()
258+mergeMapWithAppend = mergeMapWith Common.append2
259+-}
260+#endif
251261
252262-- unfoldMany
253263
@@ -258,8 +268,9 @@ unfoldManyRepl :: Int -> Int -> Int -> IO ()
258268unfoldManyRepl outer inner n =
259269 drain
260270 $ S.unfoldMany
261− (UF.lmap return (UF.replicateM inner))
262− (sourceUnfoldrM outer n)
271+ UF.replicateM
272+ (fmap ((inner,) . return) (sourceUnfoldrM outer n))
273+
263274
264275#ifdef INSPECTION
265276inspect $ hasNoTypeClasses 'unfoldManyRepl
@@ -277,10 +288,6 @@ o_1_space_concat value = sqrtVal `seq`
277288 , benchIOSrc1 "concatMapPure (1 of n)"
278289 (concatMapPure 1 value)
279290
280− -- This is for comparison with foldMapWith
281− , benchIOSrc "concatMapId (n of 1) (fromFoldable)"
282− (S.concatMap id . sourceConcatMapId value)
283−
284291 , benchIOSrc1 "concatMap (n of 1)"
285292 (concatMap value 1)
286293 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
@@ -288,16 +295,25 @@ o_1_space_concat value = sqrtVal `seq`
288295 , benchIOSrc1 "concatMap (1 of n)"
289296 (concatMap 1 value)
290297
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+
291303 , benchIOSrc1 "concatMapM (n of 1)"
292304 (concatMapM value 1)
293305 , benchIOSrc1 "concatMapM (sqrt n of sqrt n)"
294306 (concatMapM sqrtVal sqrtVal)
295307 , benchIOSrc1 "concatMapM (1 of n)"
296308 (concatMapM 1 value)
309+#endif
297310
311+#ifdef USE_STREAMK
312+ {-
298313 -- This is for comparison with foldMapWith
299314 , benchIOSrc "concatMapWithId (n of 1) (fromFoldable)"
300− (S.concatMapWith Common.append id . sourceConcatMapId value)
315+ (toStream . S.concatMapWith Common.append id . sourceConcatMapId value)
316+ -}
301317
302318 , benchIOSrc1 "concatMapWith (n of 1)"
303319 (concatMapWithSerial value 1)
@@ -306,9 +322,12 @@ o_1_space_concat value = sqrtVal `seq`
306322 , benchIOSrc1 "concatMapWith (1 of n)"
307323 (concatMapWithSerial 1 value)
308324
325+ {-
309326 -- quadratic with number of outer streams
310327 , benchIOSrc1 "concatMapWithAppend (2 of n/2)"
311328 (concatMapWithAppend 2 (value `div` 2))
329+ -}
330+#endif
312331
313332 -- concatMap vs unfoldMany
314333 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
@@ -322,31 +341,35 @@ o_1_space_concat value = sqrtVal `seq`
322341
323342 sqrtVal = round $ sqrt (fromIntegral value :: Double)
324343
325−o_n_space_concat :: Int -> [Benchmark]
326−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`
327347 [ bgroup "concat"
328348 [
329− -------------------concatPairsWith-----------------
349+ -------------------mergeMapWith-----------------
330350
331351 -- Use large number of streams to check scalability
332352
333− benchIOSrc1 "concatPairWithSerial (n of 1)"
334− (concatPairWithSerial value 1)
335− , benchIOSrc1 "concatPairWithSerial (sqrtVal of sqrtVal)"
336− (concatPairWithSerial sqrtVal sqrtVal)
337− , benchIOSrc1 "concatPairWithSerial (2 of n/2)"
338− (concatPairWithSerial 2 (value `div` 2))
339−
340− , benchIOSrc1 "concatPairWithAppend (n of 1)"
341− (concatPairWithAppend value 1)
342− , benchIOSrc1 "concatPairWithAppend (sqrtVal of sqrtVal)"
343− (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+ -}
344366 ]
345367 ]
346368
347369 where
348370
349371 sqrtVal = round $ sqrt (fromIntegral value :: Double)
372+#endif
350373
351374-------------------------------------------------------------------------------
352375-- Applicative
@@ -362,9 +385,10 @@ o_1_space_applicative value =
362385 ]
363386 ]
364387
388+#ifdef USE_STREAMK
365389o_n_space_applicative :: Int -> [Benchmark]
366390o_n_space_applicative value =
367− [ bgroup "Applicative"
391+ [ bgroup "iterated"
368392 [ benchIOSrc "(*>) (n times)" $
369393 iterateSingleton ((*>) . pure) value
370394 , benchIOSrc "(<*) (n times)" $
@@ -375,6 +399,7 @@ o_n_space_applicative value =
375399 iterateSingleton (AP.liftA2 (+) . pure) value
376400 ]
377401 ]
402+#endif
378403
379404-------------------------------------------------------------------------------
380405-- Monad
@@ -398,30 +423,46 @@ o_1_space_monad value =
398423 ]
399424 ]
400425
426+#ifdef USE_STREAMK
401427-- This is a good benchmark but inefficient way to compute primes. As we see a
402428-- new prime we keep appending a division filter for all the future numbers.
403429{-# INLINE sieve #-}
404−sieve :: Monad m => Stream m Int -> Stream m Int
405−sieve s = do
406− 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
407433 case r of
408434 Just (prime, rest) ->
409− prime `S.cons` sieve (S.filter (\n -> n `mod` prime /= 0) rest)
410− 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
411458
412459o_n_space_monad :: Int -> [Benchmark]
413460o_n_space_monad value =
414461 [ bgroup "Monad"
415− [ benchIOSrc "(>>) (n times)" $
416− iterateSingleton ((>>) . pure) value
417− , benchIOSrc "(>>=) (n times)" $
418− iterateSingleton (\x xs -> xs >>= \y -> return (x + y)) value
419− , benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
462+ [ benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
420463 toListM value
421464 , benchIO "(>>=) (sqrt n x sqrt n) (toListSome)" $
422465 toListSome value
423− , benchIO "naive prime sieve (n/4)"
424− (\n -> S.fold Fold.sum $ sieve $ S.enumerateFromTo 2 (value `div` 4 + n))
425466 ]
426467 ]
427468
@@ -429,6 +470,7 @@ o_n_space_monad value =
429470-- Joining
430471-------------------------------------------------------------------------------
431472
473+{-
432474toKv :: Int -> (Int, Int)
433475toKv p = (p, p)
434476
@@ -457,22 +499,22 @@ o_n_heap_buffering :: Int -> [Benchmark]
457499o_n_heap_buffering value =
458500 [ bgroup "buffered"
459501 [
460− benchIOSrc1 "joinInner (sqrtVal)"
461− $ joinWith S.joinInner sqrtVal
462− , benchIOSrc1 "joinInnerMap"
463− $ joinMapWith S.joinInnerMap halfVal
464− , benchIOSrc1 "joinLeft (sqrtVal)"
465− $ joinWith S.joinLeft sqrtVal
466− , benchIOSrc1 "joinLeftMap "
467− $ joinMapWith S.joinLeftMap halfVal
468− , benchIOSrc1 "joinOuter (sqrtVal)"
469− $ joinWith S.joinOuter sqrtVal
470− , benchIOSrc1 "joinOuterMap"
471− $ joinMapWith S.joinOuterMap halfVal
472− , benchIOSrc1 "intersectBy (sqrtVal)"
473− $ joinWith S.intersectBy sqrtVal
474− , benchIOSrc1 "intersectBySorted"
475− $ joinMapWith (S.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
476518 ]
477519 ]
478520
@@ -480,6 +522,7 @@ o_n_heap_buffering value =
480522
481523 halfVal = value `div` 2
482524 sqrtVal = round $ sqrt (fromIntegral value :: Double)
525+-}
483526
484527-------------------------------------------------------------------------------
485528-- Main
@@ -488,6 +531,7 @@ o_n_heap_buffering value =
488531-- In addition to gauge options, the number of elements in the stream can be
489532-- passed using the --stream-size option.
490533--
534+{-# ANN benchmarks "HLint: ignore" #-}
491535benchmarks :: String -> Int -> [Benchmark]
492536benchmarks moduleName size =
493537 [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
@@ -498,19 +542,22 @@ benchmarks moduleName size =
498542 , o_1_space_concatFoldable size
499543#endif
500544 , o_1_space_concat size
501−
502545 , o_1_space_applicative size
503546 , o_1_space_monad size
504−
505547 ]
506548 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
507549 [
508550 -- multi-stream
509− o_n_space_applicative size
510− , o_n_space_monad size
511− , 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
512557 ]
558+ {-
513559 , bgroup (o_n_heap_prefix moduleName) $
514560 -- multi-stream
515561 o_n_heap_buffering size
562+ -}
516563 ]
benchmark/Streamly/Benchmark/Data/Stream/Generate.hs+56−25
@@ -6,35 +6,43 @@
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+
1218module Stream.Generate (benchmarks) where
1319
14−import Data.Functor.Identity (Identity)
20+import Control.DeepSeq (NFData(..))
21+import Data.Functor.Identity (Identity(..))
1522
1623import qualified GHC.Exts as GHC
17−import qualified Stream.Common as Common
24+import qualified Streamly.Internal.Data.Fold as Fold
25+
1826#ifdef USE_PRELUDE
27+import Streamly.Prelude (MonadAsync)
28+import Stream.Common hiding (MonadAsync)
1929import Streamly.Benchmark.Prelude (sourceFromFoldableM, absTimes)
2030import qualified Streamly.Prelude as S
2131import qualified Streamly.Internal.Data.Stream.IsStream as Stream
2232#else
33+import Stream.Common
34+import Streamly.Internal.Data.Stream (Stream)
2335import 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
2440#endif
25−import qualified Prelude
26−
27−import Gauge
28−import Streamly.Benchmark.Common
29−import Streamly.Internal.Data.Stream (Stream)
30−#ifdef USE_PRELUDE
31−import Streamly.Prelude (MonadAsync)
32−import Stream.Common hiding (MonadAsync)
33−#else
34−import Stream.Common
3541#endif
3642
37−import System.IO.Unsafe (unsafeInterleaveIO)
43+import Test.Tasty.Bench
44+import Streamly.Benchmark.Common
45+import qualified Prelude
3846
3947import Prelude hiding (repeat, replicate, iterate)
4048
@@ -42,6 +50,14 @@ import Prelude hiding (repeat, replicate, iterate)
4250-- Generation
4351-------------------------------------------------------------------------------
4452
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+
4561-------------------------------------------------------------------------------
4662-- fromList
4763-------------------------------------------------------------------------------
@@ -148,15 +164,15 @@ iterate count = Stream.take count . Stream.iterate (+1)
148164iterateM :: MonadAsync m => Int -> Int -> Stream m Int
149165iterateM count = Stream.take count . Stream.iterateM (return . (+1)) . return
150166
151−#ifdef USE_PRELUDE
152167{-# INLINE repeatM #-}
153−repeatM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
154−repeatM count = S.take count . S.repeatM . return
168+repeatM :: MonadAsync m => Int -> Int -> Stream m Int
169+repeatM count = Stream.take count . Stream.repeatM . return
155170
156171{-# INLINE replicateM #-}
157−replicateM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
158−replicateM count = S.replicateM count . return
172+replicateM :: MonadAsync m => Int -> Int -> Stream m Int
173+replicateM count = Stream.replicateM count . return
159174
175+#ifdef USE_PRELUDE
160176{-# INLINE fromIndices #-}
161177fromIndices :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
162178fromIndices value n = S.take value $ S.fromIndices (+ n)
@@ -166,15 +182,17 @@ fromIndicesM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
166182fromIndicesM value n = S.take value $ S.fromIndicesM (return <$> (+ n))
167183#endif
168184
185+#ifdef USE_STREAMK
169186{-# INLINE mfixUnfold #-}
170187mfixUnfold :: Int -> Int -> Stream IO (Int, Int)
171−mfixUnfold count start = Stream.mfix f
188+mfixUnfold count start = toStream $ StreamK.mfix f
172189 where
173− f action = do
190+ f action = StreamK.unCross $ do
174191 let incr n act = fmap ((+n) . snd) $ unsafeInterleaveIO act
175− x <- Common.fromListM [incr 1 action, incr 2 action]
176− y <- Common.sourceUnfoldr count start
192+ x <- StreamK.mkCross (fromStream $ Common.fromListM [incr 1 action, incr 2 action])
193+ y <- StreamK.mkCross (fromStream $ Common.sourceUnfoldr count start)
177194 return (x, y)
195+#endif
178196
179197o_1_space_generation :: Int -> [Benchmark]
180198o_1_space_generation value =
@@ -192,34 +210,47 @@ o_1_space_generation value =
192210 , benchIOSrc "fracFromTo" (sourceFracFromTo value)
193211 , benchIOSrc "fromList" (sourceFromList value)
194212 , benchIOSrc "fromListM" (sourceFromListM value)
195− , benchPureSrc "IsList.fromList" (sourceIsList value)
196− , benchPureSrc "IsString.fromString" (sourceIsString value)
213+ , benchPureSrc "IsList.fromList" (toStreamD . sourceIsList value)
214+ , benchPureSrc "IsString.fromString" (toStreamD . sourceIsString value)
197215 , benchIOSrc "enumerateFrom" (enumerateFrom value)
198216 , benchIOSrc "enumerateFromTo" (enumerateFromTo value)
199217 , benchIOSrc "enumerateFromThen" (enumerateFromThen value)
200218 , benchIOSrc "enumerateFromThenTo" (enumerateFromThenTo value)
201219 , benchIOSrc "enumerate" (enumerate value)
202220 , benchIOSrc "enumerateTo" (enumerateTo value)
203−#ifdef USE_PRELUDE
204221 , benchIOSrc "repeatM" (repeatM value)
205222 , benchIOSrc "replicateM" (replicateM value)
223+#ifdef USE_PRELUDE
206224 , benchIOSrc "fromIndices" (fromIndices value)
207225 , benchIOSrc "fromIndicesM" (fromIndicesM value)
208226#endif
209227
210228 -- These essentially test cons and consM
229+#ifdef USE_STREAMK
211230 , benchIOSrc "fromFoldable" (sourceFromFoldable value)
231+ -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
232+#else
233+ -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
234+#endif
212235
213236#ifdef USE_PRELUDE
214237 , benchIOSrc "fromFoldableM" (sourceFromFoldableM value)
215238 , benchIOSrc "absTimes" $ absTimes value
216239#endif
240+#ifdef USE_STREAMK
217241 , Common.benchIOSrc "mfix_10" (mfixUnfold 10)
218242 , Common.benchIOSrc "mfix_100" (mfixUnfold 100)
219243 , Common.benchIOSrc "mfix_1000" (mfixUnfold 1000)
244+#endif
220245 ]
221246 ]
222247
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+
223254o_n_heap_generation :: Int -> [Benchmark]
224255o_n_heap_generation value =
225256 [ bgroup "buffered"
benchmark/Streamly/Benchmark/Data/Stream/Lift.hs+38−33
@@ -9,30 +9,42 @@
99{-# LANGUAGE ScopedTypeVariables #-}
1010{-# LANGUAGE RankNTypes #-}
1111
12+#ifdef USE_PRELUDE
13+{-# OPTIONS_GHC -Wno-deprecations #-}
14+#endif
15+
1216module Stream.Lift (benchmarks) where
1317
1418import Control.DeepSeq (NFData(..))
15−import Control.Monad.Trans.Class (lift)
16−import Control.Monad.State.Strict (StateT, get, put, MonadState)
19+import Control.Monad.State.Strict (StateT, get, put)
1720import Data.Functor.Identity (Identity)
18−import Stream.Common
19− (benchIO, sourceUnfoldr, sourceUnfoldrM, benchIOSrc, drain)
21+import Stream.Common (sourceUnfoldr, sourceUnfoldrM, benchIOSrc)
2022import System.Random (randomRIO)
23+
24+import qualified Stream.Common as Common
25+import qualified Streamly.Internal.Data.Fold as Fold
26+
2127#ifdef USE_PRELUDE
2228import qualified Streamly.Internal.Data.Stream.IsStream as Stream
2329#else
30+import Streamly.Internal.Data.Stream (Stream)
2431import qualified Streamly.Internal.Data.Stream as Stream
25−#endif
26−import qualified Streamly.Internal.Data.Fold as Fold
27−import qualified Stream.Common as Common
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
2836import qualified Control.Monad.State.Strict as State
37+#endif
38+#endif
2939
30−import Gauge
31−import Streamly.Internal.Data.Stream (Stream)
40+import Test.Tasty.Bench
3241import Streamly.Benchmark.Common
33−
3442import Prelude hiding (reverse, tail)
3543
44+#ifdef USE_PRELUDE
45+type Stream = Stream.SerialT
46+#endif
47+
3648-------------------------------------------------------------------------------
3749-- Monad transformation (hoisting etc.)
3850-------------------------------------------------------------------------------
@@ -73,11 +85,15 @@ o_1_space_hoisting value =
7385 [ bgroup "hoisting"
7486 [ benchIOSrc "evalState" (evalStateT value)
7587 , benchIOSrc "withState" (withState value)
76− , benchHoistSink value "generally"
77− ((\xs -> Stream.fold Fold.length xs :: IO Int) . Stream.generally)
88+#ifndef USE_PRELUDE
89+ , benchHoistSink value "generalizeInner"
90+ ((\xs -> Stream.fold Fold.length xs :: IO Int)
91+ . Stream.generalizeInner)
92+#endif
7893 ]
7994 ]
8095
96+#ifdef USE_STREAMK
8197{-# INLINE iterateStateIO #-}
8298iterateStateIO ::
8399 Monad m
@@ -91,29 +107,17 @@ iterateStateIO n = do
91107 iterateStateIO n
92108 else return x
93109
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.
94112{-# INLINE iterateStateT #-}
95−iterateStateT :: Int -> Stream (StateT Int IO) Int
96−iterateStateT n = do
97− x <- lift get
98− if x > n
99− then do
100− lift $ put (x - 1)
101− iterateStateT n
102− else return x
103−
104−{-# INLINE iterateState #-}
105−{-# SPECIALIZE iterateState :: Int -> Stream (StateT Int IO) Int #-}
106−iterateState ::
107− MonadState Int m
108− => Int
109− -> Stream m Int
110−iterateState n = do
113+iterateStateT :: Int -> StreamK (StateT Int IO) Int
114+iterateStateT n = StreamK.concatEffect $ do
111115 x <- get
112116 if x > n
113117 then do
114118 put (x - 1)
115− iterateState n
116− else return x
119+ return $ iterateStateT n
120+ else return $ StreamK.fromPure x
117121
118122o_n_heap_transformer :: Int -> [Benchmark]
119123o_n_heap_transformer value =
@@ -121,11 +125,10 @@ o_n_heap_transformer value =
121125 [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
122126 State.evalStateT (iterateStateIO n) value
123127 , benchIO "Stream (StateT Int IO) (n times)" $ \n ->
124− State.evalStateT (drain (iterateStateT n)) value
125− , benchIO "MonadState Int m => Stream m Int" $ \n ->
126− State.evalStateT (drain (iterateState n)) value
128+ State.evalStateT (drain $ Common.toStream (iterateStateT n)) value
127129 ]
128130 ]
131+#endif
129132
130133-------------------------------------------------------------------------------
131134-- Main
@@ -137,5 +140,7 @@ o_n_heap_transformer value =
137140benchmarks :: String -> Int -> [Benchmark]
138141benchmarks moduleName size =
139142 [ bgroup (o_1_space_prefix moduleName) (o_1_space_hoisting size)
143+#ifdef USE_STREAMK
140144 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_transformer size)
145+#endif
141146 ]
benchmark/Streamly/Benchmark/Data/Stream/Reduce.hs+169−119
@@ -11,23 +11,31 @@
1111{-# LANGUAGE DeriveGeneric #-}
1212{-# LANGUAGE RankNTypes #-}
1313
14+#ifdef USE_PRELUDE
15+{-# OPTIONS_GHC -Wno-deprecations #-}
16+#endif
17+
1418module Stream.Reduce (benchmarks) where
1519
1620import Control.DeepSeq (NFData(..))
1721import Control.Monad.IO.Class (MonadIO(..))
1822import Data.Monoid (Sum(..))
1923import GHC.Generics (Generic)
20−import Streamly.Internal.Data.Stream (Stream)
2124
2225import qualified Streamly.Internal.Data.Refold.Type as Refold
2326import qualified Streamly.Internal.Data.Fold as FL
2427import qualified Stream.Common as Common
25−#ifdef USE_PRELUDE
26−import Control.Monad (when)
27−import Data.Proxy (Proxy(..))
28+
29+#ifndef USE_STREAMLY_CORE
2830import Data.HashMap.Strict (HashMap)
31+import Data.Proxy (Proxy(..))
2932import Streamly.Internal.Data.IsMap.HashMap ()
33+#endif
34+
35+#ifdef USE_PRELUDE
36+import Control.Monad (when)
3037import qualified Streamly.Internal.Data.Stream.IsStream as S
38+import qualified Streamly.Prelude as S
3139import Streamly.Prelude (fromSerial)
3240import Streamly.Benchmark.Prelude hiding
3341 ( benchIO, benchIOSrc, sourceUnfoldrM, apDiscardFst, apDiscardSnd, apLiftA2
@@ -35,53 +43,50 @@ import Streamly.Benchmark.Prelude hiding
3543 , filterSome, breakAfterSome, toListM, toListSome, transformMapM
3644 , transformComposeMapM, transformTeeMapM, transformZipMapM)
3745#else
46+
47+import Streamly.Internal.Data.Stream (Stream)
3848import 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
3952#endif
4053
41−import Gauge
54+#ifdef USE_STREAMK
55+import Streamly.Internal.Data.StreamK (StreamK)
56+import qualified Streamly.Internal.Data.Parser as PR
57+import qualified Streamly.Internal.Data.StreamK as K
58+#else
59+import qualified Streamly.Internal.Data.Stream as K
60+#endif
61+
62+#endif
63+
64+import Test.Tasty.Bench
4265import Streamly.Benchmark.Common
4366import Stream.Common
4467import Prelude hiding (reverse, tail)
4568
46−-------------------------------------------------------------------------------
47−-- Iteration/looping utilities
48−-------------------------------------------------------------------------------
49−
50−{-# INLINE iterateN #-}
51−iterateN :: (Int -> a -> a) -> a -> Int -> a
52−iterateN g initial count = f count initial
53−
54− where
55−
56− f (0 :: Int) x = x
57− f i x = f (i - 1) (g i x)
69+#ifdef USE_PRELUDE
70+type Stream = S.SerialT
71+#endif
5872
59−-- Iterate a transformation over a singleton stream
60−{-# INLINE iterateSingleton #-}
61−iterateSingleton :: Monad m
62− => (Int -> Stream m Int -> Stream m Int)
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)
6379 -> Int
6480 -> Int
65− -> Stream m Int
66−iterateSingleton g count n = iterateN g (return n) count
67−
68−{-
69−-- XXX need to check why this is slower than the explicit recursion above, even
70−-- if the above code is written in a foldr like head recursive way. We also
71−-- need to try this with foldlM' once #150 is fixed.
72−-- However, it is perhaps best to keep the iteration benchmarks independent of
73−-- foldrM and any related fusion issues.
74−{-# INLINE _iterateSingleton #-}
75−_iterateSingleton ::
76− Monad m
77− => (Int -> Stream m Int -> Stream m Int)
7881 -> Int
79− -> Int
80− -> Stream m Int
81−_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
82−-}
82+ -> StreamK m Int
83+iterateSource g count len n = f count (fromStream $ sourceUnfoldrM len n)
8384
84−-- Apply transformation g count times on a stream of length len
85+ where
86+
87+ f (0 :: Int) stream = stream
88+ f i stream = f (i - 1) (g stream)
89+#else
8590{-# INLINE iterateSource #-}
8691iterateSource ::
8792 MonadAsync m
@@ -96,57 +101,56 @@ iterateSource g count len n = f count (sourceUnfoldrM len n)
96101
97102 f (0 :: Int) stream = stream
98103 f i stream = f (i - 1) (g stream)
99−
100−-------------------------------------------------------------------------------
101−-- Functor
102−-------------------------------------------------------------------------------
103−
104−o_n_space_functor :: Int -> [Benchmark]
105−o_n_space_functor value =
106− [ bgroup "Functor"
107− [ benchIO "(+) (n times) (baseline)" $ \i0 ->
108− iterateN (\i acc -> acc >>= \n -> return $ i + n) (return i0) value
109− , benchIOSrc "(<$) (n times)" $
110− iterateSingleton (<$) value
111− , benchIOSrc "fmap (n times)" $
112− iterateSingleton (fmap . (+)) value
113− {-
114− , benchIOSrc fromSerial "_(<$) (n times)" $
115− _iterateSingleton (<$) value
116− , benchIOSrc fromSerial "_fmap (n times)" $
117− _iterateSingleton (fmap . (+)) value
118− -}
119− ]
120− ]
104+#endif
121105
122106-------------------------------------------------------------------------------
123107-- Grouping transformations
124108-------------------------------------------------------------------------------
125109
126−#ifdef USE_PRELUDE
127110{-# INLINE groups #-}
128111groups :: MonadIO m => Stream m Int -> m ()
129−groups = Common.drain . S.groups FL.drain
112+groups =
113+#ifdef USE_PRELUDE
114+ Common.drain . S.groups FL.drain
115+#else
116+ Common.drain . S.groupsWhile (==) FL.drain
117+#endif
130118
131−-- XXX Change this test when the order of comparison is later changed
132−{-# INLINE groupsByGT #-}
133−groupsByGT :: MonadIO m => Stream m Int -> m ()
134−groupsByGT = Common.drain . S.groupsBy (>) FL.drain
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
135136
136−{-# INLINE groupsByEq #-}
137−groupsByEq :: MonadIO m => Stream m Int -> m ()
138−groupsByEq = Common.drain . S.groupsBy (==) FL.drain
139137
140−-- XXX Change this test when the order of comparison is later changed
141138{-# INLINE groupsByRollingLT #-}
142139groupsByRollingLT :: MonadIO m => Stream m Int -> m ()
143140groupsByRollingLT =
141+#ifdef USE_PRELUDE
144142 Common.drain . S.groupsByRolling (<) FL.drain
143+#else
144+ Common.drain . S.groupsRollingBy (<) FL.drain
145+#endif
145146
146147{-# INLINE groupsByRollingEq #-}
147148groupsByRollingEq :: MonadIO m => Stream m Int -> m ()
148149groupsByRollingEq =
150+#ifdef USE_PRELUDE
149151 Common.drain . S.groupsByRolling (==) FL.drain
152+#else
153+ Common.drain . S.groupsRollingBy (==) FL.drain
150154#endif
151155
152156{-# INLINE foldMany #-}
@@ -191,52 +195,84 @@ refoldIterateM =
191195 (Refold.take 2 Refold.sconcat) (return (Sum 0))
192196 . fmap Sum
193197
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+
194208o_1_space_grouping :: Int -> [Benchmark]
195209o_1_space_grouping value =
196210 -- Buffering operations using heap proportional to group/window sizes.
197211 [ bgroup "grouping"
198212 [
199−#ifdef USE_PRELUDE
200213 benchIOSink value "groups" groups
201− , benchIOSink value "groupsByGT" groupsByGT
202− , benchIOSink value "groupsByEq" groupsByEq
214+ , benchIOSink value "groupsWhileLT" groupsWhileLT
215+ , benchIOSink value "groupsWhileEq" groupsWhileEq
203216 , benchIOSink value "groupsByRollingLT" groupsByRollingLT
204217 , benchIOSink value "groupsByRollingEq" groupsByRollingEq
205218 ,
206−#endif
219+
207220 -- XXX parseMany/parseIterate benchmarks are in the Parser/ParserD
208− -- modules we can bring those here. arraysOf benchmarks are in
221+ -- modules we can bring those here. chunksOf benchmarks are in
209222 -- Parser/ParserD/Array.Stream/FileSystem.Handle.
210223 benchIOSink value "foldMany" foldMany
211224 , benchIOSink value "foldManyPost" foldManyPost
212225 , benchIOSink value "refoldMany" refoldMany
213226 , benchIOSink value "foldIterateM" foldIterateM
214227 , 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
215242 ]
216243 ]
217244
245+#ifndef USE_STREAMLY_CORE
246+ where
247+
248+ getKey :: Int -> Int -> Int
249+ getKey n = (`mod` n)
250+#endif
251+
218252-------------------------------------------------------------------------------
219253-- Size conserving transformations (reordering, buffering, etc.)
220254-------------------------------------------------------------------------------
221255
256+#ifndef USE_PRELUDE
222257{-# INLINE reverse #-}
223258reverse :: MonadIO m => Int -> Stream m Int -> m ()
224−reverse n = composeN n S.reverse
259+reverse n = composeN n (toStream . K.reverse . fromStream)
225260
226261{-# INLINE reverse' #-}
227262reverse' :: MonadIO m => Int -> Stream m Int -> m ()
228−reverse' n = composeN n S.reverse'
263+reverse' n = composeN n S.reverseUnbox
264+#endif
229265
230266o_n_heap_buffering :: Int -> [Benchmark]
231267o_n_heap_buffering value =
232268 [ bgroup "buffered"
233269 [
270+#ifndef USE_PRELUDE
234271 -- Reversing a stream
235272 benchIOSink value "reverse" (reverse 1)
236273 , benchIOSink value "reverse'" (reverse' 1)
237−
238−#ifdef USE_PRELUDE
239− , benchIOSink value "mkAsync" (mkAsync fromSerial)
274+#else
275+ benchIOSink value "mkAsync" (mkAsync fromSerial)
240276#endif
241277 ]
242278 ]
@@ -245,9 +281,9 @@ o_n_heap_buffering value =
245281-- Grouping/Splitting
246282-------------------------------------------------------------------------------
247283
248−#ifdef USE_PRELUDE
284+#ifndef USE_STREAMLY_CORE
249285{-# INLINE classifySessionsOf #-}
250−classifySessionsOf :: MonadAsync m => (Int -> Int) -> Stream m Int -> m ()
286+classifySessionsOf :: S.MonadAsync m => (Int -> Int) -> Stream m Int -> m ()
251287classifySessionsOf getKey =
252288 Common.drain
253289 . S.classifySessionsOf
@@ -256,7 +292,7 @@ classifySessionsOf getKey =
256292 . fmap (\x -> (getKey x, x))
257293
258294{-# INLINE classifySessionsOfHash #-}
259−classifySessionsOfHash :: MonadAsync m =>
295+classifySessionsOfHash :: S.MonadAsync m =>
260296 (Int -> Int) -> Stream m Int -> m ()
261297classifySessionsOfHash getKey =
262298 Common.drain
@@ -265,25 +301,6 @@ classifySessionsOfHash getKey =
265301 1 False (const (return False)) 3 (FL.take 10 FL.sum)
266302 . S.timestamped
267303 . fmap (\x -> (getKey x, x))
268−
269−o_n_space_grouping :: Int -> [Benchmark]
270−o_n_space_grouping value =
271− -- Buffering operations using heap proportional to group/window sizes.
272− [ bgroup "grouping"
273− [ benchIOSink value "classifySessionsOf (10000 buckets)"
274− (classifySessionsOf (getKey 10000))
275− , benchIOSink value "classifySessionsOf (64 buckets)"
276− (classifySessionsOf (getKey 64))
277− , benchIOSink value "classifySessionsOfHash (10000 buckets)"
278− (classifySessionsOfHash (getKey 10000))
279− , benchIOSink value "classifySessionsOfHash (64 buckets)"
280− (classifySessionsOfHash (getKey 64))
281− ]
282− ]
283−
284− where
285−
286− getKey n = (`mod` n)
287304#endif
288305
289306-------------------------------------------------------------------------------
@@ -345,8 +362,9 @@ data Pair a b =
345362 deriving (Generic, NFData)
346363
347364{-# INLINE sumProductFold #-}
348−sumProductFold :: Monad m => Stream m Int -> m (Int, Int)
349−sumProductFold = Common.foldl' (\(s, p) x -> (s + x, p * x)) (0, 1)
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)
350368
351369{-# INLINE sumProductScan #-}
352370sumProductScan :: Monad m => Stream m Int -> m (Pair Int Int)
@@ -394,6 +412,46 @@ o_1_space_transformations_mixedX4 value =
394412-- Iterating a transformation over and over again
395413-------------------------------------------------------------------------------
396414
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+
397455-- this is quadratic
398456{-# INLINE iterateScan #-}
399457iterateScan :: MonadAsync m => Int -> Int -> Int -> Stream m Int
@@ -422,15 +480,11 @@ iterateTakeAll value = iterateSource (S.take (value + 1))
422480iterateDropOne :: MonadAsync m => Int -> Int -> Int -> Stream m Int
423481iterateDropOne = iterateSource (S.drop 1)
424482
425−{-# INLINE iterateDropWhileFalse #-}
426−iterateDropWhileFalse :: MonadAsync m
427− => Int -> Int -> Int -> Int -> Stream m Int
428−iterateDropWhileFalse value = iterateSource (S.dropWhile (> (value + 1)))
429−
430483{-# INLINE iterateDropWhileTrue #-}
431484iterateDropWhileTrue :: MonadAsync m
432485 => Int -> Int -> Int -> Int -> Stream m Int
433486iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
487+#endif
434488
435489#ifdef USE_PRELUDE
436490{-# INLINE tail #-}
@@ -451,8 +505,10 @@ o_n_stack_iterated :: Int -> [Benchmark]
451505o_n_stack_iterated value = by10 `seq` by100 `seq`
452506 [ bgroup "iterated"
453507 [ benchIOSrc "mapM (n/10 x 10)" $ iterateMapM by10 10
508+#ifndef USE_STREAMK
454509 , benchIOSrc "scanl' (quadratic) (n/100 x 100)" $
455510 iterateScan by100 100
511+#endif
456512#ifdef USE_PRELUDE
457513 , benchIOSrc "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
458514#endif
@@ -461,8 +517,10 @@ o_n_stack_iterated value = by10 `seq` by100 `seq`
461517 , benchIOSrc "takeAll (n/10 x 10)" $
462518 iterateTakeAll value by10 10
463519 , benchIOSrc "dropOne (n/10 x 10)" $ iterateDropOne by10 10
520+#ifdef USE_STREAMK
464521 , benchIOSrc "dropWhileFalse (n/10 x 10)" $
465522 iterateDropWhileFalse value by10 10
523+#endif
466524 , benchIOSrc "dropWhileTrue (n/10 x 10)" $
467525 iterateDropWhileTrue value by10 10
468526#ifdef USE_PRELUDE
@@ -526,13 +584,5 @@ benchmarks moduleName size =
526584 , o_1_space_pipesX4 size
527585 ]
528586 , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
529− , bgroup (o_n_heap_prefix moduleName) $ Prelude.concat
530− [
531−#ifdef USE_PRELUDE
532− o_n_space_grouping size
533− ,
534−#endif
535− o_n_space_functor size
536− , o_n_heap_buffering size
537− ]
587+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_buffering size)
538588 ]
benchmark/Streamly/Benchmark/Data/Stream/Split.hs+9−6
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Stream.Split
35-- Copyright : (c) 2019 Composewell Technologies
@@ -25,7 +27,7 @@ import Data.Word (Word8)
2527import System.IO (Handle)
2628
2729import qualified Streamly.FileSystem.Handle as FH
28−import qualified Streamly.Internal.Data.Array.Unboxed 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.Unboxed.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
@@ -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
@@ -218,8 +220,9 @@ o_1_space_reduce_read_split env =
218220splitOnSeqUtf8 :: String -> Handle -> IO Int
219221splitOnSeqUtf8 str inh =
220222 (S.length $ IP.splitOnSeq (A.fromList str) FL.drain
223+ $ IP.fromStream
221224 $ IUS.decodeUtf8Arrays
222− $ IFH.getChunks inh) -- >>= print
225+ $ IFH.readChunks inh) -- >>= print
223226
224227o_1_space_reduce_toChunks_split :: BenchEnv -> [Benchmark]
225228o_1_space_reduce_toChunks_split env =
benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+38−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,14 +22,17 @@
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
3237import qualified Streamly.Internal.Data.Fold as FL
3338
@@ -321,6 +326,34 @@ filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
321326-- Nested Composition
322327-------------------------------------------------------------------------------
323328
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+
324357{-# INLINE toNullApNested #-}
325358toNullApNested :: Monad m => Stream m Int -> m ()
326359toNullApNested s = runStream $ do
@@ -416,8 +449,8 @@ unfoldManyRepl :: Int -> Int -> Int -> IO ()
416449unfoldManyRepl outer inner n =
417450 S.drain
418451 $ S.unfoldMany
419− (UF.lmap return (UF.replicateM inner))
420− (sourceUnfoldrMN outer n)
452+ UF.replicateM
453+ (S.map ((inner,) . return) (sourceUnfoldrMN outer n))
421454
422455#ifdef INSPECTION
423456inspect $ hasNoTypeClasses 'unfoldManyRepl
@@ -430,7 +463,7 @@ inspect $ 'unfoldManyRepl `hasNoType` ''SPEC
430463-------------------------------------------------------------------------------
431464
432465moduleName :: String
433−moduleName = "Data.Stream.StreamD"
466+moduleName = "Data.StreamD"
434467
435468o_1_space :: [Benchmark]
436469o_1_space =
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/Data/Stream/Transform.hs+153−31
@@ -6,9 +6,15 @@
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
@@ -20,31 +26,47 @@
2026
2127module Stream.Transform (benchmarks) where
2228
23−import Control.DeepSeq (NFData(..))
2429import Control.Monad.IO.Class (MonadIO(..))
25−import Data.Functor.Identity (Identity)
2630
2731import System.Random (randomRIO)
2832
2933import qualified Streamly.Internal.Data.Fold as FL
3034
31−import qualified Prelude
3235import qualified Stream.Common as Common
3336import qualified Streamly.Internal.Data.Unfold as Unfold
37+
3438#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
3543import qualified Streamly.Internal.Data.Stream.IsStream as Stream
3644import Streamly.Internal.Data.Time.Units
3745#else
38−import qualified Streamly.Internal.Data.Stream.Parallel as Stream
46+import Streamly.Internal.Data.Stream (Stream)
3947import qualified Streamly.Internal.Data.Stream as Stream
48+#ifndef USE_STREAMLY_CORE
49+import qualified Streamly.Internal.Data.Stream.Prelude as Stream
50+#endif
51+#ifdef USE_STREAMK
52+import Control.DeepSeq (NFData(..))
53+import Data.Functor.Identity (Identity(..))
54+import qualified Prelude
55+import qualified Streamly.Internal.Data.Fold as Fold
56+import Streamly.Internal.Data.StreamK (StreamK)
57+import qualified Streamly.Internal.Data.StreamK as StreamK
58+#endif
4059#endif
4160
42−import Gauge
43−import Streamly.Internal.Data.Stream (Stream)
61+import Test.Tasty.Bench
4462import Stream.Common hiding (scanl')
4563import Streamly.Benchmark.Common
4664import Prelude hiding (sequence, mapM)
4765
66+#ifdef USE_PRELUDE
67+type Stream = Stream.SerialT
68+#endif
69+
4870-------------------------------------------------------------------------------
4971-- Pipelines (stream-to-stream transformations)
5072-------------------------------------------------------------------------------
@@ -57,28 +79,36 @@ import Prelude hiding (sequence, mapM)
5779-- Traversable Instance
5880-------------------------------------------------------------------------------
5981
82+#ifdef USE_STREAMK
6083{-# INLINE traversableTraverse #-}
61−traversableTraverse :: Stream Identity Int -> IO (Stream Identity Int)
84+traversableTraverse :: StreamK Identity Int -> IO (StreamK Identity Int)
6285traversableTraverse = traverse return
6386
6487{-# INLINE traversableSequenceA #-}
65−traversableSequenceA :: Stream Identity Int -> IO (Stream Identity Int)
88+traversableSequenceA :: StreamK Identity Int -> IO (StreamK Identity Int)
6689traversableSequenceA = sequenceA . Prelude.fmap return
6790
6891{-# INLINE traversableMapM #-}
69−traversableMapM :: Stream Identity Int -> IO (Stream Identity Int)
92+traversableMapM :: StreamK Identity Int -> IO (StreamK Identity Int)
7093traversableMapM = Prelude.mapM return
7194
7295{-# INLINE traversableSequence #-}
73−traversableSequence :: Stream Identity Int -> IO (Stream Identity Int)
96+traversableSequence :: StreamK Identity Int -> IO (StreamK Identity Int)
7497traversableSequence = Prelude.sequence . Prelude.fmap return
7598
7699{-# INLINE benchPureSinkIO #-}
77100benchPureSinkIO
78101 :: NFData b
79− => Int -> String -> (Stream Identity Int -> IO b) -> Benchmark
102+ => Int -> String -> (StreamK Identity Int -> IO b) -> Benchmark
80103benchPureSinkIO value name f =
81− 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)
82112
83113o_n_space_traversable :: Int -> [Benchmark]
84114o_n_space_traversable value =
@@ -91,6 +121,7 @@ o_n_space_traversable value =
91121 , benchPureSinkIO value "sequence" traversableSequence
92122 ]
93123 ]
124+#endif
94125
95126-------------------------------------------------------------------------------
96127-- maps and scans
@@ -155,21 +186,33 @@ timestamped :: (MonadAsync m) => Stream m Int -> m ()
155186timestamped = Stream.drain . Stream.timestamped
156187#endif
157188
189+#ifdef USE_STREAMK
158190{-# INLINE foldrS #-}
159191foldrS :: MonadIO m => Int -> Stream m Int -> m ()
160−foldrS n = composeN n $ Stream.foldrS Stream.cons Stream.nil
192+foldrS n =
193+ composeN n (toStream . StreamK.foldrS StreamK.cons StreamK.nil . fromStream)
161194
162195{-# INLINE foldrSMap #-}
163196foldrSMap :: MonadIO m => Int -> Stream m Int -> m ()
164−foldrSMap n = composeN n $ Stream.foldrS (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
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
165204
205+{-
166206{-# INLINE foldrT #-}
167207foldrT :: MonadIO m => Int -> Stream m Int -> m ()
168−foldrT n = composeN n $ Stream.foldrT Stream.cons Stream.nil
208+foldrT n = composeN n (unCrossStream . Stream.foldrT cns (CrossStream Stream.nil))
209+
210+ where cns x (CrossStream xs) = CrossStream (Stream.cons x xs)
169211
170212{-# INLINE foldrTMap #-}
171213foldrTMap :: MonadIO m => Int -> Stream m Int -> m ()
172214foldrTMap n = composeN n $ Stream.foldrT (\x xs -> x + 1 `Stream.cons` xs) Stream.nil
215+-}
173216
174217{-# INLINE trace #-}
175218trace :: MonadAsync m => Int -> Stream m Int -> m ()
@@ -180,14 +223,17 @@ o_1_space_mapping value =
180223 [ bgroup
181224 "mapping"
182225 [
226+#ifdef USE_STREAMK
183227 -- Right folds
184228 benchIOSink value "foldrS" (foldrS 1)
185229 , benchIOSink value "foldrSMap" (foldrSMap 1)
186− , benchIOSink value "foldrT" (foldrT 1)
187− , benchIOSink value "foldrTMap" (foldrTMap 1)
230+ ,
231+#endif
232+ -- , benchIOSink value "foldrT" (foldrT 1)
233+ -- , benchIOSink value "foldrTMap" (foldrTMap 1)
188234
189235 -- Mapping
190− , benchIOSink value "map" (mapN 1)
236+ benchIOSink value "map" (mapN 1)
191237 , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
192238 sequence (sourceUnfoldrAction value n)
193239 , benchIOSink value "mapM" (mapM 1)
@@ -258,6 +304,73 @@ o_1_space_functor value =
258304 ]
259305 ]
260306
307+-------------------------------------------------------------------------------
308+-- Iteration/looping utilities
309+-------------------------------------------------------------------------------
310+
311+{-# INLINE iterateN #-}
312+iterateN :: (Int -> a -> a) -> a -> Int -> a
313+iterateN g initial count = f count initial
314+
315+ where
316+
317+ f (0 :: Int) x = x
318+ f i x = f (i - 1) (g i x)
319+
320+#ifdef USE_STREAMK
321+-- Iterate a transformation over a singleton stream
322+{-# INLINE iterateSingleton #-}
323+iterateSingleton :: Applicative m =>
324+ (Int -> StreamK m Int -> StreamK m Int)
325+ -> Int
326+ -> Int
327+ -> Stream m Int
328+iterateSingleton g count n = toStream $ iterateN g (StreamK.fromPure n) count
329+#else
330+-- Iterate a transformation over a singleton stream
331+{-# INLINE iterateSingleton #-}
332+iterateSingleton :: Applicative m =>
333+ (Int -> Stream m Int -> Stream m Int)
334+ -> Int
335+ -> Int
336+ -> Stream m Int
337+iterateSingleton g count n = iterateN g (Stream.fromPure n) count
338+#endif
339+
340+{-
341+-- XXX need to check why this is slower than the explicit recursion above, even
342+-- if the above code is written in a foldr like head recursive way. We also
343+-- need to try this with foldlM' once #150 is fixed.
344+-- However, it is perhaps best to keep the iteration benchmarks independent of
345+-- foldrM and any related fusion issues.
346+{-# INLINE _iterateSingleton #-}
347+_iterateSingleton ::
348+ Monad m
349+ => (Int -> Stream m Int -> Stream m Int)
350+ -> Int
351+ -> Int
352+ -> Stream m Int
353+_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
354+-}
355+
356+o_n_space_iterated :: Int -> [Benchmark]
357+o_n_space_iterated value =
358+ [ bgroup "iterated"
359+ [ benchIO "(+) (n times) (baseline)" $ \i0 ->
360+ iterateN (\i acc -> acc >>= \n -> return $ i + n) (return i0) value
361+ , benchIOSrc "(<$) (n times)" $
362+ iterateSingleton (<$) value
363+ , benchIOSrc "fmap (n times)" $
364+ iterateSingleton (fmap . (+)) value
365+ {-
366+ , benchIOSrc fromSerial "_(<$) (n times)" $
367+ _iterateSingleton (<$) value
368+ , benchIOSrc fromSerial "_fmap (n times)" $
369+ _iterateSingleton (fmap . (+)) value
370+ -}
371+ ]
372+ ]
373+
261374-------------------------------------------------------------------------------
262375-- Size reducing transformations (filtering)
263376-------------------------------------------------------------------------------
@@ -302,6 +415,7 @@ takeWhileTrue value n = composeN n $ Stream.takeWhile (<= (value + 1))
302415takeWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
303416takeWhileMTrue value n = composeN n $ Stream.takeWhileM (return . (<= (value + 1)))
304417
418+#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
305419{-# INLINE takeInterval #-}
306420takeInterval :: Double -> Int -> Stream IO Int -> IO ()
307421takeInterval i n = composeN n (Stream.takeInterval i)
@@ -314,6 +428,18 @@ takeInterval i n = composeN n (Stream.takeInterval i)
314428-- inspect $ 'takeInterval `hasNoType` ''D.Step
315429#endif
316430
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+
317443{-# INLINE dropOne #-}
318444dropOne :: MonadIO m => Int -> Stream m Int -> m ()
319445dropOne n = composeN n $ Stream.drop 1
@@ -341,17 +467,6 @@ _intervalsOfSum :: MonadAsync m => Double -> Int -> Stream m Int -> m ()
341467_intervalsOfSum i n = composeN n (Stream.intervalsOf i FL.sum)
342468#endif
343469
344−{-# INLINE dropInterval #-}
345−dropInterval :: Double -> Int -> Stream IO Int -> IO ()
346−dropInterval i n = composeN n (Stream.dropInterval i)
347−
348−-- Inspection testing is disabled for dropInterval
349−-- Enable it when looking at it throughly
350−#ifdef INSPECTION
351−-- inspect $ hasNoTypeClasses 'dropInterval
352−-- inspect $ 'dropInterval `hasNoType` ''D.Step
353−#endif
354−
355470{-# INLINE findIndices #-}
356471findIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
357472findIndices value n = composeN n $ Stream.findIndices (== (value + 1))
@@ -406,8 +521,10 @@ o_1_space_filtering value =
406521 -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
407522 , benchIOSink value "drop-one" (dropOne 1)
408523 , benchIOSink value "drop-all" (dropAll value 1)
524+#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
409525 , benchIOSink value "takeInterval-all" (takeInterval 10000 1)
410526 , benchIOSink value "dropInterval-all" (dropInterval 10000 1)
527+#endif
411528 , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
412529 -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
413530 , benchIOSink
@@ -559,7 +676,12 @@ benchmarks moduleName size =
559676 , o_1_space_indexingX4 size
560677 ]
561678 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
562− [ o_n_space_traversable size
563− , 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
564686 ]
565687 ]
benchmark/Streamly/Benchmark/Data/Unfold.hs+25−15
@@ -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.Unfold.Prelude as UF
3435import qualified Streamly.Internal.Data.Stream as S
35−import qualified Streamly.Internal.Data.Stream.StreamD as D
36−import qualified Streamly.Internal.Data.Stream.StreamK as K
36+import qualified Streamly.Internal.Data.Stream as D
37+import qualified Streamly.Internal.Data.StreamK as K
3738
38−
39−import Gauge hiding (env)
39+import Test.Tasty.Bench hiding (env)
4040import 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
@@ -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 ()
@@ -426,7 +427,7 @@ toNullAp value start =
426427 let end = start + nthRoot 2 value
427428 s = source end
428429 -- in UF.fold ((+) <$> s <*> s) FL.drain start
429− in UF.fold FL.drain ((+) `fmap` s `UF.apply` s) start
430+ in UF.fold FL.drain ((+) `fmap` s `UF.crossApply` s) start
430431
431432{-# INLINE _apDiscardFst #-}
432433_apDiscardFst :: Int -> Int -> m ()
@@ -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]
@@ -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+ let readEx = UF.onException (\_ -> hClose inh) FH.reader
752753 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,44 +761,53 @@ 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+ readEx = UF.handle (UF.functionM handler) FH.reader
764765 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
776+ let readEx = UF.finally_ (\_ -> hClose inh) FH.reader
775777 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
790+ let readEx = UF.finally (\_ -> hClose inh) FH.reader
785791 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
796+ let readEx = UF.bracket_ return (\_ -> hClose inh) FH.reader
791797 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
810+ let readEx = UF.bracket return (\_ -> hClose inh) FH.reader
801811 in S.fold (FH.write devNull) $ S.unfold readEx inh
802812
803813o_1_space_copy_read_exceptions :: BenchEnv -> [Benchmark]
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+59−51
@@ -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.Unboxed as A
32−import qualified Streamly.Internal.Data.Array.Unboxed.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.Unboxed.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.ArrayUnsafe -- 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.ArrayUnsafe -- 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.ArrayUnsafe -- 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.ArrayUnsafe -- 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.ArrayUnsafe -- 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
241+inspect $ hasNoTypeClasses 'groupsOf
242+inspect $ 'groupsOf `hasNoType` ''Step
243+inspect $ 'groupsOf `hasNoType` ''FoldMany
244+inspect $ 'groupsOf `hasNoType` ''MutArray.ArrayUnsafe -- AT.writeNUnsafe
238245 -- FH.read/A.read
239−inspect $ 'chunksOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
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+23−22
@@ -1,3 +1,5 @@
1+{-# OPTIONS_GHC -Wno-deprecations #-}
2+
13-- |
24-- Module : Streamly.Benchmark.FileSystem.Handle
35-- Copyright : (c) 2019 Composewell Technologies
@@ -29,19 +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.Unboxed 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.Unboxed.Type as AT
45+import qualified Streamly.Internal.Data.MutArray as MutArray
4546
4647import Test.Inspection
4748#endif
@@ -52,7 +53,7 @@ import Test.Inspection
5253
5354-- | Copy file
5455copyChunks :: Handle -> Handle -> IO ()
55−copyChunks inh outh = S.fold (IFH.writeChunks outh) $ IFH.getChunks inh
56+copyChunks inh outh = S.fold (IFH.writeChunks outh) $ IFH.readChunks inh
5657
5758#ifdef INSPECTION
5859inspect $ hasNoTypeClasses 'copyChunks
@@ -75,13 +76,13 @@ o_1_space_copy_chunked env =
7576
7677-- | Copy file
7778copyStream :: Handle -> Handle -> IO ()
78−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)
7980
8081#ifdef INSPECTION
8182inspect $ hasNoTypeClasses 'copyStream
8283inspect $ 'copyStream `hasNoType` ''Step -- S.unfold
8384inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
84−inspect $ 'copyStream `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
85+inspect $ 'copyStream `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
8586 -- FH.read/A.read
8687inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/chunksOf
8788#endif
@@ -102,13 +103,13 @@ o_1_space_copy_read env =
102103
103104-- | Send the file contents to /dev/null
104105readFromBytesNull :: Handle -> Handle -> IO ()
105−readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.read inh
106+readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.reader inh
106107
107108#ifdef INSPECTION
108109inspect $ hasNoTypeClasses 'readFromBytesNull
109110inspect $ 'readFromBytesNull `hasNoType` ''Step
110−inspect $ 'readFromBytesNull `hasNoType` ''MAS.SpliceState
111−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
112113inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
113114#endif
114115
@@ -116,13 +117,13 @@ inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
116117readWithFromBytesNull :: Handle -> Handle -> IO ()
117118readWithFromBytesNull inh devNull =
118119 IFH.putBytes devNull
119− $ S.unfold FH.readWith (defaultChunkSize, inh)
120+ $ S.unfold FH.readerWith (defaultChunkSize, inh)
120121
121122#ifdef INSPECTION
122123inspect $ hasNoTypeClasses 'readWithFromBytesNull
123124inspect $ 'readWithFromBytesNull `hasNoType` ''Step
124−inspect $ 'readWithFromBytesNull `hasNoType` ''MAS.SpliceState
125−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
126127inspect $ 'readWithFromBytesNull `hasNoType` ''D.FoldMany
127128#endif
128129
@@ -134,7 +135,7 @@ _readChunks inh devNull = IUF.fold fld unf inh
134135 where
135136
136137 fld = FH.write devNull
137− unf = IUF.many A.read FH.readChunks
138+ unf = IUF.many A.reader FH.chunkReader
138139
139140-- | Send the chunk content to /dev/null
140141-- Implicitly benchmarked via 'readWithFromBytesNull'
@@ -144,7 +145,7 @@ _readChunksWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
144145 where
145146
146147 fld = FH.write devNull
147− unf = IUF.many A.read FH.readChunksWith
148+ unf = IUF.many A.reader FH.chunkReaderWith
148149
149150o_1_space_copy_fromBytes :: BenchEnv -> [Benchmark]
150151o_1_space_copy_fromBytes env =
@@ -163,13 +164,13 @@ writeReadWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
163164 where
164165
165166 fld = FH.writeWith defaultChunkSize devNull
166− unf = FH.readWith
167+ unf = FH.readerWith
167168
168169#ifdef INSPECTION
169170inspect $ hasNoTypeClasses 'writeReadWith
170171inspect $ 'writeReadWith `hasNoType` ''Step
171172inspect $ 'writeReadWith `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
172−inspect $ 'writeReadWith `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
173+inspect $ 'writeReadWith `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
173174 -- FH.read/A.read
174175#endif
175176
@@ -180,13 +181,13 @@ writeRead inh devNull = IUF.fold fld unf inh
180181 where
181182
182183 fld = FH.write devNull
183− unf = FH.read
184+ unf = FH.reader
184185
185186#ifdef INSPECTION
186187inspect $ hasNoTypeClasses 'writeRead
187188inspect $ 'writeRead `hasNoType` ''Step
188189inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
189−inspect $ 'writeRead `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
190+inspect $ 'writeRead `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
190191 -- FH.read/A.read
191192#endif
192193
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+3−1
@@ -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"
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/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+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.ZipAsync"
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.Unboxed (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.Unboxed 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+58−31
@@ -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,28 +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.Unboxed 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 Streamly.Internal.Data.Unboxed (Unboxed)
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.Unboxed.Type as Array
4352
4453import Test.Inspection
4554#endif
@@ -53,8 +62,8 @@ copyCodecUtf8ArraysLenient :: Handle -> Handle -> IO ()
5362copyCodecUtf8ArraysLenient inh outh =
5463 Stream.fold (Handle.write outh)
5564 $ Unicode.encodeUtf8'
56− $ Unicode.decodeUtf8Arrays
57− $ Handle.getChunks inh
65+ $ Unicode.decodeUtf8Chunks
66+ $ Handle.readChunks inh
5867
5968#ifdef INSPECTION
6069inspect $ hasNoTypeClasses 'copyCodecUtf8ArraysLenient
@@ -74,23 +83,29 @@ o_1_space_decode_encode_chunked env =
7483-- copy with group/ungroup transformations
7584-------------------------------------------------------------------------------
7685
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+
7792{-# NOINLINE linesUnlinesCopy #-}
7893linesUnlinesCopy :: Handle -> Handle -> IO ()
7994linesUnlinesCopy inh outh =
8095 Stream.fold (Handle.write outh)
8196 $ Unicode.encodeLatin1'
8297 $ Unicode.unlines Unfold.fromList
83− $ Stream.splitOnSuffix (== '\n') Fold.toList
98+ $ splitOnSuffix (== '\n') Fold.toList
8499 $ Unicode.decodeLatin1
85− $ Stream.unfold Handle.read inh
100+ $ Stream.unfold Handle.reader inh
86101
87102{-# NOINLINE linesUnlinesArrayWord8Copy #-}
88103linesUnlinesArrayWord8Copy :: Handle -> Handle -> IO ()
89104linesUnlinesArrayWord8Copy inh outh =
90105 Stream.fold (Handle.write outh)
91− $ Stream.interposeSuffix 10 Array.read
92− $ Stream.splitOnSuffix (== 10) Array.write
93− $ Stream.unfold Handle.read inh
106+ $ Stream.interposeSuffix 10 Array.reader
107+ $ splitOnSuffix (== 10) Array.write
108+ $ Stream.unfold Handle.reader inh
94109
95110-- XXX splitSuffixOn requires -funfolding-use-threshold=150 for better fusion
96111-- | Lines and unlines
@@ -102,10 +117,10 @@ linesUnlinesArrayCharCopy inh outh =
102117 $ UnicodeArr.unlines
103118 $ UnicodeArr.lines
104119 $ Unicode.decodeLatin1
105− $ Stream.unfold Handle.read inh
120+ $ Stream.unfold Handle.reader inh
106121
107122#ifdef INSPECTION
108−inspect $ hasNoTypeClassesExcept 'linesUnlinesArrayCharCopy [''Unboxed]
123+inspect $ hasNoTypeClassesExcept 'linesUnlinesArrayCharCopy [''Unbox]
109124-- inspect $ 'linesUnlinesArrayCharCopy `hasNoType` ''Step
110125#endif
111126
@@ -130,7 +145,7 @@ wordsUnwordsCopyWord8 inh outh =
130145 Stream.fold (Handle.write outh)
131146 $ Stream.interposeSuffix 32 Unfold.fromList
132147 $ Stream.wordsBy isSp Fold.toList
133− $ Stream.unfold Handle.read inh
148+ $ Stream.unfold Handle.reader inh
134149
135150#ifdef INSPECTION
136151inspect $ hasNoTypeClasses 'wordsUnwordsCopyWord8
@@ -154,7 +169,7 @@ wordsUnwordsCopy inh outh =
154169 $ Stream.wordsBy isSpace Fold.toList
155170 -- -- $ Stream.splitOn isSpace Fold.toList
156171 $ Unicode.decodeLatin1
157− $ Stream.unfold Handle.read inh
172+ $ Stream.unfold Handle.reader inh
158173
159174#ifdef INSPECTION
160175-- inspect $ hasNoTypeClasses 'wordsUnwordsCopy
@@ -169,7 +184,7 @@ wordsUnwordsCharArrayCopy inh outh =
169184 $ UnicodeArr.unwords
170185 $ UnicodeArr.words
171186 $ Unicode.decodeLatin1
172− $ Stream.unfold Handle.read inh
187+ $ Stream.unfold Handle.reader inh
173188
174189o_1_space_copy_read_group_ungroup :: BenchEnv -> [Benchmark]
175190o_1_space_copy_read_group_ungroup env =
@@ -201,7 +216,7 @@ copyStreamLatin1' inh outh =
201216 Stream.fold (Handle.write outh)
202217 $ Unicode.encodeLatin1'
203218 $ Unicode.decodeLatin1
204− $ Stream.unfold Handle.read inh
219+ $ Stream.unfold Handle.reader inh
205220
206221#ifdef INSPECTION
207222inspect $ hasNoTypeClasses 'copyStreamLatin1'
@@ -209,7 +224,7 @@ inspect $ 'copyStreamLatin1' `hasNoType` ''Step
209224inspect $ 'copyStreamLatin1' `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.many
210225
211226inspect $ 'copyStreamLatin1' `hasNoType` ''Fold.Step
212−inspect $ 'copyStreamLatin1' `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
227+inspect $ 'copyStreamLatin1' `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
213228 -- Handle.read/Array.read
214229inspect $ 'copyStreamLatin1' `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
215230#endif
@@ -221,7 +236,7 @@ copyStreamLatin1 inh outh =
221236 Stream.fold (Handle.write outh)
222237 $ Unicode.encodeLatin1
223238 $ Unicode.decodeLatin1
224− $ Stream.unfold Handle.read inh
239+ $ Stream.unfold Handle.reader inh
225240
226241#ifdef INSPECTION
227242inspect $ hasNoTypeClasses 'copyStreamLatin1
@@ -230,7 +245,7 @@ inspect $ 'copyStreamLatin1 `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.m
230245
231246inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.ManyState
232247inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.Step
233−inspect $ 'copyStreamLatin1 `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
248+inspect $ 'copyStreamLatin1 `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
234249 -- Handle.read/Array.read
235250inspect $ 'copyStreamLatin1 `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
236251#endif
@@ -241,7 +256,7 @@ _copyStreamUtf8' inh outh =
241256 Stream.fold (Handle.write outh)
242257 $ Unicode.encodeUtf8'
243258 $ Unicode.decodeUtf8'
244− $ Stream.unfold Handle.read inh
259+ $ Stream.unfold Handle.reader inh
245260
246261#ifdef INSPECTION
247262inspect $ hasNoTypeClasses '_copyStreamUtf8'
@@ -257,7 +272,7 @@ copyStreamUtf8 inh outh =
257272 Stream.fold (Handle.write outh)
258273 $ Unicode.encodeUtf8
259274 $ Unicode.decodeUtf8
260− $ Stream.unfold Handle.read inh
275+ $ Stream.unfold Handle.reader inh
261276
262277#ifdef INSPECTION
263278inspect $ hasNoTypeClasses 'copyStreamUtf8
@@ -271,17 +286,18 @@ _copyStreamUtf8'Fold :: Handle -> Handle -> IO ()
271286_copyStreamUtf8'Fold inh outh =
272287 Stream.fold (Handle.write outh)
273288 $ Unicode.encodeUtf8
274− $ Stream.foldMany Unicode.writeCharUtf8'
275− $ Stream.unfold Handle.read inh
289+ $ Stream.catRights
290+ $ Stream.parseMany Unicode.writeCharUtf8'
291+ $ Stream.unfold Handle.reader inh
276292
277293{-# NOINLINE _copyStreamUtf8Parser #-}
278294_copyStreamUtf8Parser :: Handle -> Handle -> IO ()
279295_copyStreamUtf8Parser inh outh =
280296 Stream.fold (Handle.write outh)
281297 $ Unicode.encodeUtf8
282− $ Stream.parseMany
298+ $ Stream.catRights $ Stream.parseMany
283299 (Unicode.parseCharUtf8With Unicode.TransliterateCodingFailure)
284− $ Stream.unfold Handle.read inh
300+ $ Stream.unfold Handle.reader inh
285301
286302o_1_space_decode_encode_read :: BenchEnv -> [Benchmark]
287303o_1_space_decode_encode_read env =
@@ -308,6 +324,7 @@ o_1_space_decode_encode_read env =
308324
309325main :: IO ()
310326main = do
327+#ifndef FUSION_CHECK
311328 env <- mkHandleBenchEnv
312329 defaultMain (allBenchmarks env)
313330
@@ -320,3 +337,13 @@ main = do
320337 , o_1_space_decode_encode_read env
321338 ]
322339 ]
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-runner/Main.hs+88−39
@@ -14,20 +14,32 @@ rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
1414
1515 -- Drop All.
1616 benchName = drop 4 benchName0
17+
1718 general
18− | "o-1-sp" `isInfixOf` benchName = "-K36K -M16M"
19+ -- GHC-9.6 requires 32M heap vs 16M for GHC-9.4
20+ | "o-1-sp" `isInfixOf` benchName = "-K36K -M32M"
1921 | "o-n-h" `isInfixOf` benchName = "-K36K -M32M"
20− | "o-n-st" `isInfixOf` benchName = "-K1M -M16M"
22+ -- GHC-9.6 requires 32M heap vs 16M for GHC-9.4
23+ | "o-n-st" `isInfixOf` benchName = "-K1M -M32M"
2124 | "o-n-sp" `isInfixOf` benchName = "-K1M -M32M"
2225 | otherwise = ""
26+
2327 exeSpecific
2428 | "Prelude.Concurrent" `isSuffixOf` exeName = "-K512K -M384M"
2529 | otherwise = ""
30+
2631 benchSpecific
27− | "Data.Stream.StreamD/o-n-space.elimination.toList" == benchName =
28− "-K2M"
29− | "Data.Stream.StreamK/o-n-space.elimination.toList" == benchName =
30− "-K2M"
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+
3143 | "Prelude.Parallel/o-n-heap.mapping.mapM" == benchName = "-M256M"
3244 | "Prelude.Parallel/o-n-heap.monad-outer-product."
3345 `isPrefixOf` benchName = "-M256M"
@@ -35,22 +47,6 @@ rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
3547 `isPrefixOf` benchName = "-K2M -M256M"
3648 | "Prelude.Rate/o-1-space." `isPrefixOf` benchName = "-K128K"
3749 | "Prelude.Rate/o-1-space.asyncly." `isPrefixOf` benchName = "-K128K"
38− | "Data.Stream/o-1-space.mixed.sum-product-fold" == benchName =
39− "-K64M"
40− | "Data.Stream/o-n-heap.grouping.classifySessionsOf"
41− `isPrefixOf` benchName = "-K1M -M32M"
42− | "Data.Stream/o-n-heap.Functor." `isPrefixOf` benchName =
43− "-K4M -M32M"
44− | "Data.Stream/o-n-heap.transformer." `isPrefixOf` benchName =
45− "-K8M -M64M"
46− | "Data.Stream/o-n-space.Functor." `isPrefixOf` benchName =
47− "-K4M -M64M"
48− | "Data.Stream/o-n-space.Applicative." `isPrefixOf` benchName =
49− "-K8M -M128M"
50− | "Data.Stream/o-n-space.Monad." `isPrefixOf` benchName =
51− "-K8M -M64M"
52− | "Data.Stream/o-n-space.grouping." `isPrefixOf` benchName = ""
53− | "Data.Stream/o-n-space." `isPrefixOf` benchName = "-K4M"
5450 | "Prelude.WSerial/o-n-space." `isPrefixOf` benchName = "-K4M"
5551 | "Prelude.Async/o-n-space.monad-outer-product." `isPrefixOf` benchName =
5652 "-K4M"
@@ -63,27 +59,80 @@ rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
6359 "-M64M"
6460 | "Prelude.WAsync/o-n-space.monad-outer-product." `isPrefixOf` benchName =
6561 "-K4M"
66− | "Data.Parser.ParserD/o-1-space.some" == benchName = "-K8M"
67− | "Data.Parser/o-1-space.some" == benchName = "-K8M"
68− | "Data.Parser.ParserD/o-1-space.manyTill" == benchName = "-K4M"
69− | "Data.Parser/o-1-space.manyTill" == benchName = "-K4M"
70− | "Data.Parser/o-n-heap.manyAlt" == benchName = "-K4M -M128M"
71− | "Data.Parser/o-n-heap.someAlt" == benchName = "-K4M -M128M"
72− | "Data.Parser/o-n-heap.choice" == benchName = "-K16M -M32M"
73− | "Data.Parser.ParserK/o-n-heap.manyAlt" == benchName = "-K4M -M128M"
74− | "Data.Parser.ParserK/o-n-heap.someAlt" == benchName = "-K4M -M128M"
75− | "Data.Parser.ParserK/o-n-heap.sequence" == benchName = "-M64M"
76− | "Data.Parser.ParserK/o-n-heap.sequenceA" == benchName = "-M64M"
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+
77113 | "Data.Array" `isPrefixOf` benchName
78114 && "/o-1-space.generation.read" `isSuffixOf` benchName = "-M32M"
115+ -- XXX GHC 9.6 onwards needs 64M, earlier it was 32M
79116 | "Data.Array" `isPrefixOf` benchName
80− && "/o-1-space.generation.show" `isSuffixOf` benchName = "-M32M"
81− | "Data.Array/o-1-space.transformationX4.map" == benchName = "-M32M"
82− | "Data.Array.Unboxed/o-1-space.elimination.foldable.foldl"
83− `isPrefixOf` benchName = "-K8M"
84− | "Data.Array.Unboxed/o-1-space.elimination.foldable.sum" == benchName =
85− "-K8M"
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+
86134 | "Unicode.Char/o-1-space." `isPrefixOf` benchName = "-M32M"
135+
87136 | otherwise = ""
88137
89138speedOpts :: String -> String -> Maybe Quickness
benchmark/bench-runner/cabal.project+3
@@ -1 +1,4 @@
11packages: . ../../targets
2+
3+package bench-report
4+ flags: +no-charts
benchmark/bench-runner/default.nix+1−1
@@ -49,7 +49,7 @@ let haskellPackages =
4949 nixpkgs.haskell.lib.overrideCabal
5050 (let src = fetchGit {
5151 url = "git@github.com:composewell/bench-report.git";
52− rev = "ca3872acd4b817731b951c6ed91bfa6c58f26c5a";
52+ rev = "3b50bf0ad06f746bca42f30c8d40a0426e159af3";
5353 }; in super.callCabal2nix "bench-report" src {})
5454 (old:
5555 { enableLibraryProfiling = false;
benchmark/lib/Streamly/Benchmark/Common.hs+1−1
@@ -56,7 +56,7 @@ import System.Random (randomRIO)
5656import qualified Streamly.Internal.Data.Fold as Fold
5757import qualified Streamly.Internal.Data.Stream as S
5858
59−import Gauge
59+import Test.Tasty.Bench
6060
6161-------------------------------------------------------------------------------
6262-- Benchmark Prefixes
benchmark/lib/Streamly/Benchmark/Common/Handle.hs+3−1
@@ -30,6 +30,8 @@ module Streamly.Benchmark.Common.Handle
3030 , isSpace
3131 , isSp
3232 , mkHandleBenchEnv
33+ , Handles(..)
34+ , getHandles
3335 )
3436where
3537
@@ -46,7 +48,7 @@ import System.Process (callCommand)
4648
4749import Data.IORef
4850import Prelude hiding (last, length)
49−import Gauge hiding (env)
51+import Test.Tasty.Bench hiding (env)
5052
5153
5254scratchDir :: String
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+297−152
@@ -54,11 +54,6 @@ flag opt
5454 manual: True
5555 default: True
5656
57−flag use-gauge
58− description: Use gauge instead of tasty-bench for benchmarking
59− manual: True
60− default: False
61−
6257flag use-streamly-core
6358 description: Benchmark only core package
6459 manual: True
@@ -73,15 +68,49 @@ flag use-prelude
7368-- Common stanzas
7469-------------------------------------------------------------------------------
7570
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+
76107common compile-options
108+ import: default-extensions
77109 default-language: Haskell2010
78110
79111 if flag(use-streamly-core)
80112 cpp-options: -DUSE_STREAMLY_CORE
81113
82− if flag(use-prelude)
83− cpp-options: -DUSE_PRELUDE
84−
85114 if flag(dev)
86115 cpp-options: -DDEVBUILD
87116
@@ -111,6 +140,10 @@ common compile-options
111140 -Wno-missing-kind-signatures
112141 -Wno-operator-whitespace
113142
143+ if impl(ghc >= 9.8)
144+ ghc-options:
145+ -Wno-missing-role-annotations
146+
114147 if flag(has-llvm)
115148 ghc-options: -fllvm
116149
@@ -118,15 +151,17 @@ common compile-options
118151 ghc-options: -Wmissed-specialisations
119152 -Wall-missed-specialisations
120153
121− if flag(dev) || flag(debug)
122− ghc-options: -fno-ignore-asserts
123−
124154common optimization-options
125155 if flag(opt)
126156 ghc-options: -O2
127157 -fdicts-strict
128158 -fspec-constr-recursive=16
129159 -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+
130165 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
131166 ghc-options: -fplugin Fusion.Plugin
132167 else
@@ -140,43 +175,34 @@ common bench-depends
140175 -- Core libraries shipped with ghc, the min and max
141176 -- constraints of these libraries should match with
142177 -- the GHC versions we support
143− base >= 4.9 && < 4.18
144− , deepseq >= 1.4.1 && < 1.5
145− , 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
146181
147182 -- other libraries
183+ , exceptions >= 0.8 && < 0.11
148184 , random >= 1.0 && < 2.0
149185 , transformers >= 0.4 && < 0.7
150− , containers >= 0.5 && < 0.7
186+ , containers >= 0.5 && < 0.8
151187 , hashable >= 1.3 && < 1.5
152188 , unordered-containers >= 0.2 && < 0.3
153189 , process >= 1.4 && < 1.7
154190 , directory >= 1.2.2 && < 1.4
155− , filepath >= 1.4.1 && < 1.5
156− , ghc-prim >= 0.4 && < 0.10
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
157196
158− if flag(use-streamly-core)
159− build-depends: streamly-core
160− else
197+ if !flag(use-streamly-core)
161198 build-depends: streamly
162− , streamly-core
163−
164− if flag(use-gauge)
165− build-depends: gauge >= 0.2.4 && < 0.3
166− else
167− build-depends: tasty-bench >= 0.3 && < 0.4
168− , tasty >= 1.4.1 && < 1.5
169− mixins: tasty-bench
170− (Test.Tasty.Bench as Gauge
171− , Test.Tasty.Bench as Gauge.Main
172− )
173199
174200 if flag(fusion-plugin) && !impl(ghcjs) && !impl(ghc < 8.6)
175201 build-depends:
176202 fusion-plugin >= 0.2 && < 0.3
177203 if flag(inspection)
178− build-depends: template-haskell >= 2.14 && < 2.20
179− , inspection-testing >= 0.4 && < 0.5
204+ build-depends: template-haskell >= 2.14 && < 2.22
205+ , inspection-testing >= 0.4 && < 0.6
180206 -- Array uses a Storable constraint in dev build making several inspection
181207 -- tests fail
182208 if flag(dev) && flag(inspection)
@@ -191,7 +217,7 @@ library
191217 hs-source-dirs: lib
192218 exposed-modules: Streamly.Benchmark.Common
193219 , Streamly.Benchmark.Common.Handle
194− if !flag(use-streamly-core)
220+ if flag(use-prelude)
195221 exposed-modules: Streamly.Benchmark.Prelude
196222
197223
@@ -232,116 +258,124 @@ benchmark Data.Stream
232258 Stream.Transform
233259 Stream.Reduce
234260 Stream.Expand
235− Stream.Exceptions
236261 Stream.Lift
237262 Stream.Common
238− if flag(use-prelude)
263+ if !flag(use-streamly-core)
239264 other-modules:
240− Stream.Split
265+ Stream.Exceptions
241266 if flag(limit-build-mem)
242267 if flag(dev)
243268 ghc-options: +RTS -M3500M -RTS
244269 else
245270 ghc-options: +RTS -M2500M -RTS
246271
247−benchmark Data.Stream.Async
248− import: bench-options-threaded
272+-- Use StreamK functions where possible, converting to StreaK to StreamD
273+benchmark Data.Stream.StreamDK
274+ import: bench-options
249275 type: exitcode-stdio-1.0
250− hs-source-dirs: Streamly/Benchmark/Data/Stream/, Streamly/Benchmark/Data/
251− main-is: Async.hs
276+ hs-source-dirs: Streamly/Benchmark/Data
277+ main-is: Stream.hs
252278 other-modules:
279+ Stream.Generate
280+ Stream.Eliminate
281+ Stream.Transform
282+ Stream.Reduce
283+ Stream.Expand
284+ Stream.Lift
253285 Stream.Common
254− if flag(use-streamly-core) || impl(ghcjs)
255− buildable: False
256− else
257− buildable: True
258−
259−benchmark Prelude.WSerial
260− import: bench-options
261− type: exitcode-stdio-1.0
262− hs-source-dirs: Streamly/Benchmark/Prelude
263− main-is: WSerial.hs
264− if flag(use-streamly-core) || impl(ghcjs)
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)
265291 buildable: False
266− else
267− buildable: True
292+ cpp-options: -DUSE_STREAMK
268293 if flag(limit-build-mem)
269− ghc-options: +RTS -M750M -RTS
294+ if flag(dev)
295+ ghc-options: +RTS -M3500M -RTS
296+ else
297+ ghc-options: +RTS -M2500M -RTS
270298
271−benchmark Prelude.Merge
272− import: bench-options
299+benchmark Data.Stream.Concurrent
300+ import: bench-options-threaded
273301 type: exitcode-stdio-1.0
274− hs-source-dirs: Streamly/Benchmark/Prelude
275− main-is: Merge.hs
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
276307 if flag(use-streamly-core) || impl(ghcjs)
277308 buildable: False
278309 else
279310 buildable: True
280311
281−benchmark Prelude.ZipSerial
282− import: bench-options
312+benchmark Data.Stream.ConcurrentInterleaved
313+ import: bench-options-threaded
283314 type: exitcode-stdio-1.0
284− hs-source-dirs: Streamly/Benchmark/Prelude
285− main-is: ZipSerial.hs
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
286320 if flag(use-streamly-core) || impl(ghcjs)
287321 buildable: False
288322 else
289323 buildable: True
290324
291−benchmark Prelude.ZipAsync
292− import: bench-options
325+benchmark Data.Stream.ConcurrentEager
326+ import: bench-options-threaded
293327 type: exitcode-stdio-1.0
294− hs-source-dirs: Streamly/Benchmark/Prelude
295− main-is: ZipAsync.hs
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
296333 if flag(use-streamly-core) || impl(ghcjs)
297334 buildable: False
298335 else
299336 buildable: True
300− if flag(limit-build-mem)
301− ghc-options: +RTS -M1000M -RTS
302337
303−benchmark Prelude.Ahead
338+benchmark Data.Stream.ConcurrentOrdered
304339 import: bench-options-threaded
305340 type: exitcode-stdio-1.0
306− hs-source-dirs: Streamly/Benchmark/Prelude
307− main-is: Ahead.hs
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
308346 if flag(use-streamly-core) || impl(ghcjs)
309347 buildable: False
310348 else
311349 buildable: True
312350
313−benchmark Prelude.Async
314− import: bench-options-threaded
351+benchmark Data.Unbox
352+ import: bench-options
315353 type: exitcode-stdio-1.0
316− hs-source-dirs: Streamly/Benchmark/Prelude
317− main-is: Async.hs
318− if flag(use-streamly-core) || impl(ghcjs)
319− buildable: False
320− else
321− buildable: True
354+ hs-source-dirs: .
355+ cpp-options: -DUSE_UNBOX
356+ main-is: Streamly/Benchmark/Data/Serialize.hs
322357
323−benchmark Prelude.WAsync
324− import: bench-options-threaded
358+benchmark Data.Unbox.Derive.TH
359+ import: bench-options
325360 type: exitcode-stdio-1.0
326− hs-source-dirs: Streamly/Benchmark/Prelude
327− main-is: WAsync.hs
328− if flag(use-streamly-core) || impl(ghcjs)
329− buildable: False
330− else
331− buildable: True
361+ hs-source-dirs: .
362+ cpp-options: -DUSE_UNBOX
363+ cpp-options: -DUSE_TH
364+ main-is: Streamly/Benchmark/Data/Serialize.hs
332365
333−benchmark Prelude.Parallel
334− import: bench-options-threaded
366+benchmark Data.Serialize
367+ import: bench-options
335368 type: exitcode-stdio-1.0
336− hs-source-dirs: Streamly/Benchmark/Prelude
337− main-is: Parallel.hs
338− if flag(use-streamly-core) || impl(ghcjs)
339− buildable: False
340− else
341− 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
342377 if flag(limit-build-mem)
343− ghc-options: +RTS -M2000M -RTS
344−
378+ ghc-options: +RTS -M1000M -RTS
345379
346380benchmark Data.Unfold
347381 import: bench-options
@@ -373,12 +407,12 @@ benchmark Data.Fold.Window
373407 else
374408 buildable: True
375409
376−benchmark Data.Parser.ParserD
410+benchmark Data.Parser
377411 import: bench-options
378412 type: exitcode-stdio-1.0
379− hs-source-dirs: Streamly/Benchmark/Data/Parser
380− main-is: ParserD.hs
381− if flag(use-streamly-core) || impl(ghcjs)
413+ hs-source-dirs: Streamly/Benchmark/Data
414+ main-is: Parser.hs
415+ if impl(ghcjs)
382416 buildable: False
383417 else
384418 buildable: True
@@ -387,80 +421,77 @@ benchmark Data.Parser.ParserD
387421 if flag(dev)
388422 ghc-options: +RTS -M3000M -RTS
389423 else
390− ghc-options: +RTS -M750M -RTS
424+ ghc-options: +RTS -M2000M -RTS
391425
392−benchmark Data.Parser.ParserK
426+benchmark Data.ParserK
393427 import: bench-options
394428 type: exitcode-stdio-1.0
395− hs-source-dirs: Streamly/Benchmark/Data/Parser
429+ hs-source-dirs: Streamly/Benchmark/Data
430+ cpp-options: -DBENCH_SINGULAR
396431 main-is: ParserK.hs
397− if flag(use-streamly-core) || impl(ghcjs)
432+ if impl(ghcjs)
398433 buildable: False
399434 else
400435 buildable: True
401436 build-depends: exceptions >= 0.8 && < 0.11
402437
403−-- Note: to use this we have to set DISABLE_FUSION in ParserD.hs so that
404−-- the rewrite rules are disabled. We can also use the "no-fusion" build
405−-- flag but we need to keep in mind that it disables fusion for streams
406−-- as well.
407−benchmark Data.Parser.FromParserK
438+benchmark Data.ParserK.Chunked
408439 import: bench-options
409440 type: exitcode-stdio-1.0
410− hs-source-dirs: Streamly/Benchmark/Data/Parser
411− cpp-options: -DFROM_PARSERK
441+ hs-source-dirs: Streamly/Benchmark/Data
442+ cpp-options: -DBENCH_CHUNKED
412443 main-is: ParserK.hs
413− if flag(use-streamly-core) || impl(ghcjs)
444+ if impl(ghcjs)
414445 buildable: False
415446 else
416447 buildable: True
417448 build-depends: exceptions >= 0.8 && < 0.11
418449
419−benchmark Data.Parser
450+benchmark Data.ParserK.Chunked.Generic
420451 import: bench-options
421452 type: exitcode-stdio-1.0
422453 hs-source-dirs: Streamly/Benchmark/Data
423− main-is: Parser.hs
424− if flag(use-streamly-core) || impl(ghcjs)
454+ cpp-options: -DBENCH_CHUNKED_GENERIC
455+ main-is: ParserK.hs
456+ if impl(ghcjs)
425457 buildable: False
426458 else
427459 buildable: True
428460 build-depends: exceptions >= 0.8 && < 0.11
429− if flag(limit-build-mem)
430− if flag(dev)
431− ghc-options: +RTS -M3000M -RTS
432− else
433− ghc-options: +RTS -M1000M -RTS
434461
435462-------------------------------------------------------------------------------
436463-- Raw Streams
437464-------------------------------------------------------------------------------
438465
439−benchmark Data.Stream.StreamD
466+benchmark Data.StreamD
440467 import: bench-options
441468 type: exitcode-stdio-1.0
442469 hs-source-dirs: Streamly/Benchmark/Data/Stream
443470 main-is: StreamD.hs
444471 if impl(ghcjs)
445472 buildable: False
446− else
447− buildable: True
448473
449−benchmark Data.Stream.StreamK
474+benchmark Data.StreamK
450475 import: bench-options
451476 type: exitcode-stdio-1.0
452477 hs-source-dirs: Streamly/Benchmark/Data/Stream
453478 main-is: StreamK.hs
454479 if impl(ghcjs)
455480 buildable: False
456− else
457− buildable: True
458481
459−benchmark Data.Stream.StreamDK
482+benchmark Data.Stream.ToStreamK
483+ import: bench-options
484+ type: exitcode-stdio-1.0
485+ hs-source-dirs: Streamly/Benchmark/Data/Stream
486+ main-is: ToStreamK.hs
487+ if !flag(dev) || impl(ghcjs)
488+ buildable: False
489+
490+benchmark Data.StreamK.Alt
460491 import: bench-options
461492 type: exitcode-stdio-1.0
462493 hs-source-dirs: Streamly/Benchmark/Data/Stream
463− main-is: StreamDK.hs
494+ main-is: StreamKAlt.hs
464495 if !flag(dev) || impl(ghcjs)
465496 buildable: False
466497
@@ -468,11 +499,115 @@ executable nano-bench
468499 import: bench-options
469500 hs-source-dirs: .
470501 main-is: NanoBenchmarks.hs
471− if flag(dev)
472− buildable: True
473− else
502+ if !flag(dev)
503+ buildable: False
504+
505+-------------------------------------------------------------------------------
506+-- Streamly.Prelude
507+-------------------------------------------------------------------------------
508+
509+benchmark Prelude
510+ import: bench-options
511+ type: exitcode-stdio-1.0
512+ hs-source-dirs: Streamly/Benchmark/Data
513+ main-is: Stream.hs
514+ other-modules:
515+ Stream.Generate
516+ Stream.Eliminate
517+ Stream.Transform
518+ Stream.Reduce
519+ Stream.Expand
520+ Stream.Lift
521+ Stream.Common
522+ Stream.Split
523+ Stream.Exceptions
524+ cpp-options: -DUSE_PRELUDE
525+ if !flag(use-prelude)
526+ buildable: False
527+ if flag(limit-build-mem)
528+ if flag(dev)
529+ ghc-options: +RTS -M3500M -RTS
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)
474580 buildable: False
475581
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+
476611-------------------------------------------------------------------------------
477612-- Concurrent Streams
478613-------------------------------------------------------------------------------
@@ -482,44 +617,45 @@ benchmark Prelude.Concurrent
482617 type: exitcode-stdio-1.0
483618 hs-source-dirs: Streamly/Benchmark/Prelude
484619 main-is: Concurrent.hs
485− if flag(use-streamly-core)
620+ cpp-options: -DUSE_PRELUDE
621+ if !flag(use-prelude)
486622 buildable: False
487− else
488− buildable: True
489623
490624benchmark Prelude.Adaptive
491625 import: bench-options-threaded
492626 type: exitcode-stdio-1.0
493627 hs-source-dirs: Streamly/Benchmark/Prelude
494628 main-is: Adaptive.hs
495− if flag(use-streamly-core) || impl(ghcjs)
629+ cpp-options: -DUSE_PRELUDE
630+ if !flag(use-prelude)
496631 buildable: False
497− else
498− buildable: True
499632
500633benchmark Prelude.Rate
501634 import: bench-options-threaded
502635 type: exitcode-stdio-1.0
503636 hs-source-dirs: Streamly/Benchmark/Prelude
504637 main-is: Rate.hs
505− if flag(use-streamly-core) || impl(ghcjs)
638+ cpp-options: -DUSE_PRELUDE
639+ if !flag(use-prelude)
506640 buildable: False
507− else
508− buildable: True
509641
510642-------------------------------------------------------------------------------
511643-- Array Benchmarks
512644-------------------------------------------------------------------------------
513645
514−benchmark Data.Array
646+benchmark Data.Array.Generic
515647 import: bench-options
516648 type: exitcode-stdio-1.0
517− hs-source-dirs: .
518− main-is: Streamly/Benchmark/Data/Array.hs
649+ hs-source-dirs: ., Streamly/Benchmark/Data
650+ main-is: Streamly/Benchmark/Data/Array/Generic.hs
651+ other-modules:
652+ Stream.Common
519653 if flag(use-streamly-core)
520654 buildable: False
521655 else
522656 buildable: True
657+ if flag(limit-build-mem)
658+ ghc-options: +RTS -M1000M -RTS
523659
524660benchmark Data.SmallArray
525661 import: bench-options
@@ -530,10 +666,13 @@ benchmark Data.SmallArray
530666 else
531667 buildable: False
532668
533−benchmark Data.Array.Unboxed
669+benchmark Data.Array
534670 import: bench-options
535671 type: exitcode-stdio-1.0
536− main-is: Streamly/Benchmark/Data/Array/Unboxed.hs
672+ hs-source-dirs: ., Streamly/Benchmark/Data
673+ main-is: Streamly/Benchmark/Data/Array.hs
674+ other-modules:
675+ Stream.Common
537676 if flag(use-streamly-core)
538677 buildable: False
539678 else
@@ -541,10 +680,10 @@ benchmark Data.Array.Unboxed
541680 if flag(limit-build-mem)
542681 ghc-options: +RTS -M1500M -RTS
543682
544−benchmark Data.Array.Unboxed.Mut
683+benchmark Data.MutArray
545684 import: bench-options
546685 type: exitcode-stdio-1.0
547− main-is: Streamly/Benchmark/Data/Array/Unboxed/Mut.hs
686+ main-is: Streamly/Benchmark/Data/MutArray.hs
548687 if flag(limit-build-mem)
549688 ghc-options: +RTS -M1500M -RTS
550689 if flag(use-streamly-core)
@@ -567,11 +706,11 @@ benchmark Data.Ring.Unboxed
567706-- Array Stream Benchmarks
568707-------------------------------------------------------------------------------
569708
570−benchmark Data.Array.Stream.Foreign
709+benchmark Data.Array.Stream
571710 import: bench-options
572711 type: exitcode-stdio-1.0
573− hs-source-dirs: Streamly/Benchmark/Data/Array/Stream
574− main-is: Foreign.hs
712+ hs-source-dirs: Streamly/Benchmark/Data/Array
713+ main-is: Stream.hs
575714 if flag(use-streamly-core) || impl(ghcjs)
576715 buildable: False
577716 else
@@ -631,3 +770,9 @@ benchmark Unicode.Utf8
631770 buildable: False
632771 else
633772 buildable: True
773+
774+benchmark Unicode.Parser
775+ import: bench-options
776+ type: exitcode-stdio-1.0
777+ hs-source-dirs: Streamly/Benchmark/Unicode
778+ main-is: Parser.hs
bin/mk-hscope.sh+1−1
@@ -1,7 +1,7 @@
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/run-ci.sh+1−1
@@ -108,7 +108,7 @@ werror () {
108108ghc_prime_Werror () {
109109 nix-shell \
110110 --argstr compiler "$GHC_PRIME_NIX" \
111− --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"
112112}
113113
114114ghc_prime_doctests () {
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
cabal.project.902deleted−23
@@ -1,23 +0,0 @@
1−packages: streamly.cabal
2− , core/streamly-core.cabal
3− , test/streamly-tests.cabal
4− , benchmark/streamly-benchmarks.cabal
5− , docs/streamly-docs.cabal
6−
7−package base-orphans
8− ghc-options: -optlm "--unresolved-symbols=ignore-all"
9−
10−package heaps
11− ghc-options: -optlm "--unresolved-symbols=ignore-all"
12−
13−package network
14− ghc-options: -optlm "--unresolved-symbols=ignore-all"
15−
16−package HUnit
17− ghc-options: -optlm "--unresolved-symbols=ignore-all"
18−
19−package colour
20− ghc-options: -optlm "--unresolved-symbols=ignore-all"
21−
22−package clock
23− ghc-options: -optlm "--unresolved-symbols=ignore-all"
cabal.project.doctest+1−1
@@ -1,6 +1,6 @@
11packages: streamly.cabal
22 , core/streamly-core.cabal
3− , docs/streamly-docs.cabal
3+ -- , docs/streamly-docs.cabal
44 -- for QuickCheck in property doctests
55 , test/streamly-tests.cabal
66
cabal.project.packdiff+2−16
@@ -1,23 +1,9 @@
1−packages:
2− streamly.cabal
3− core/streamly-core.cabal
4−
51source-repository-package
62 type: git
73 location: https://github.com/composewell/packdiff.git
8− tag: 45cdca157e7159b8dd4261b3616fe7fa4200b967
9−
10−source-repository-package
11− type: git
12− location: https://github.com/composewell/streamly-shell.git
13− tag: 1b3fea3239ebe47963955d81565b9d5e34567ab7
14−
15−source-repository-package
16− type: git
17− location: https://github.com/composewell/streamly-coreutils.git
18− tag: acf1ca79b964e7c92ddfc71ca77c1adcba7e2450
4+ tag: b11a50c9c0523382a19eebc0b12efdae194406a9
195
206source-repository-package
217 type: git
228 location: https://github.com/composewell/streamly-process.git
23− tag: 7ef84bddc869c6a7c46fd5e4ef9c1b4a22c301db
9+ tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
cabal.project.report+4−6
@@ -2,8 +2,6 @@ packages:
22 targets/streamly-targets.cabal
33 benchmark/bench-runner/bench-runner.cabal
44 test/test-runner/test-runner.cabal
5− streamly.cabal
6− core/streamly-core.cabal
75
86package bench-report
97 flags: +no-charts
@@ -14,19 +12,19 @@ package bench-show
1412source-repository-package
1513 type: git
1614 location: https://github.com/composewell/bench-report.git
17− tag: 5e02db298e2e3be01f665278f2764d0da68e8a86
15+ tag: 3b50bf0ad06f746bca42f30c8d40a0426e159af3
1816
1917source-repository-package
2018 type: git
2119 location: https://github.com/composewell/streamly-coreutils.git
22− tag: acf1ca79b964e7c92ddfc71ca77c1adcba7e2450
20+ tag: 5dbb8bcefac3aefd5eb298dc410b11e36e79f35a
2321
2422source-repository-package
2523 type: git
2624 location: https://github.com/composewell/streamly-shell.git
27− tag: 1b3fea3239ebe47963955d81565b9d5e34567ab7
25+ tag: b0c6318119d1cc5e2106343f17b5cff2ad94417f
2826
2927source-repository-package
3028 type: git
3129 location: https://github.com/composewell/streamly-process.git
32− tag: 7ef84bddc869c6a7c46fd5e4ef9c1b4a22c301db
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.9.0.
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.9.0'
614−PACKAGE_STRING='streamly 0.9.0'
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.9.0 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.9.0:";;
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.9.0
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.9.0, 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.9.0, 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.9.0
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.9.0], [streamly@composewell.com], [streamly], [https://streamly.composewell.com])
6+AC_INIT([streamly], [0.10.1], [streamly@composewell.com], [streamly], [https://streamly.composewell.com])
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
@@ -0,0 +1,306 @@
1+---------------------------------
2+API Annotations
3+---------------------------------
4+
5+[A] : Added
6+[R] : Removed
7+[C] : Changed
8+[O] : Old definition
9+[N] : New definition
10+[D] : Deprecated
11+
12+---------------------------------
13+API diff
14+---------------------------------
15+
16+[C] Streamly.Data.Stream
17+ [A] (FixityR,5)
18+ [A] (FixityR,5)
19+[C] Streamly.Data.MutArray.Generic
20+ [A] emptyOf :: MonadIO m => Int -> m (MutArray a)
21+ [A] createOf :: MonadIO m => Int -> Fold m a (MutArray a)
22+ [A] create :: MonadIO m => Fold m a (MutArray a)
23+[C] Streamly.Data.MutArray
24+ [A] pinnedEmptyOf :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
25+ [A] emptyOf :: (MonadIO m, Unbox a) => Int -> m (MutArray a)
26+ [A] createOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
27+ [A] create :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
28+ [A] appendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
29+ [A] append :: forall m a. (MonadIO m, Unbox a) => m (MutArray a) -> Fold m a (MutArray a)
30+[C] Streamly.Data.Array.Generic
31+ [A] createOf :: MonadIO m => Int -> Fold m a (Array a)
32+ [A] create :: MonadIO m => Fold m a (Array a)
33+[C] Streamly.Data.Array
34+ [A] class Serialize a
35+ [A] serializeAt :: Serialize a => Int -> MutByteArray -> a -> IO Int
36+ [A] pinnedSerialize :: Serialize a => a -> Array Word8
37+ [A] deserializeAt :: Serialize a => Int -> MutByteArray -> Int -> IO (Int, a)
38+ [A] deserialize :: Serialize a => Array Word8 -> a
39+ [A] createOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
40+ [A] create :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
41+ [A] addSizeTo :: Serialize a => Int -> a -> Int
42+
43+---------------------------------
44+Internal API diff
45+---------------------------------
46+
47+[C] Streamly.Internal.Unicode.Stream
48+ [A] encodeUtf16le' :: Stream m Char -> Stream m Word16
49+ [A] decodeUtf16le' :: Stream m Word16 -> Stream m Char
50+[A] Streamly.Internal.FileSystem.Path
51+ [A] class IsPath a
52+ [A] Rel
53+ [A] File
54+ [A] Dir
55+ [A] Abs
56+ [A] Streamly.Internal.FileSystem.Path.IsPath
57+ [A] instance Streamly.Internal.FileSystem.Path.IsPath Streamly.Internal.FileSystem.Path.Path
58+ [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Rel Streamly.Internal.FileSystem.Path.Path)
59+ [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Rel (Streamly.Internal.FileSystem.Path.File Streamly.Internal.FileSystem.Path.Path))
60+ [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Rel (Streamly.Internal.FileSystem.Path.Dir Streamly.Internal.FileSystem.Path.Path))
61+ [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.File Streamly.Internal.FileSystem.Path.Path)
62+ [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Dir Streamly.Internal.FileSystem.Path.Path)
63+ [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Abs Streamly.Internal.FileSystem.Path.Path)
64+ [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Abs (Streamly.Internal.FileSystem.Path.File Streamly.Internal.FileSystem.Path.Path))
65+ [A] instance Streamly.Internal.FileSystem.Path.IsPath (Streamly.Internal.FileSystem.Path.Abs (Streamly.Internal.FileSystem.Path.Dir Streamly.Internal.FileSystem.Path.Path))
66+ [A] GHC.Show.Show
67+ [A] instance GHC.Show.Show Streamly.Internal.FileSystem.Path.PathException
68+ [A] GHC.Exception.Type.Exception
69+ [A] instance GHC.Exception.Type.Exception Streamly.Internal.FileSystem.Path.PathException
70+ [A] GHC.Classes.Eq
71+ [A] instance GHC.Classes.Eq Streamly.Internal.FileSystem.Path.PathException
72+ [A] Path
73+ [A] Path :: Array Word8 -> Path
74+ [A] toString :: Path -> [Char]
75+ [A] toPath :: IsPath a => a -> Path
76+ [A] toChunk :: Path -> Array Word8
77+ [A] toChars :: Monad m => Path -> Stream m Char
78+ [A] relfile :: QuasiQuoter
79+ [A] reldir :: QuasiQuoter
80+ [A] rel :: QuasiQuoter
81+ [A] primarySeparator :: Char
82+ [A] path :: QuasiQuoter
83+ [A] mkRelFile :: String -> Q Exp
84+ [A] mkRelDir :: String -> Q Exp
85+ [A] mkRel :: String -> Q Exp
86+ [A] mkPath :: String -> Q Exp
87+ [A] mkFile :: String -> Q Exp
88+ [A] mkDir :: String -> Q Exp
89+ [A] mkAbsFile :: String -> Q Exp
90+ [A] mkAbsDir :: String -> Q Exp
91+ [A] mkAbs :: String -> Q Exp
92+ [A] isSeparator :: Char -> Bool
93+ [A] fromString :: MonadThrow m => [Char] -> m Path
94+ [A] fromPathUnsafe :: IsPath a => Path -> a
95+ [A] fromPath :: (IsPath a, MonadThrow m) => Path -> m a
96+ [A] fromChunkUnsafe :: Array Word8 -> Path
97+ [A] fromChunk :: MonadThrow m => Array Word8 -> m Path
98+ [A] fromChars :: MonadThrow m => Stream Identity Char -> m Path
99+ [A] file :: QuasiQuoter
100+ [A] extendPath :: Path -> Path -> Path
101+ [A] extendDir :: (IsPath (a (Dir Path)), IsPath b, IsPath (a b)) => a (Dir Path) -> Rel b -> a b
102+ [A] dir :: QuasiQuoter
103+ [A] adaptPath :: (MonadThrow m, IsPath a, IsPath b) => a -> m b
104+ [A] absfile :: QuasiQuoter
105+ [A] absdir :: QuasiQuoter
106+ [A] abs :: QuasiQuoter
107+[C] Streamly.Internal.Data.Stream
108+ [A] (FixityR,5)
109+ [A] (FixityR,5)
110+ [C] splitInnerBySuffix
111+ [O] splitInnerBySuffix :: (Monad m, Eq (f a), Monoid (f a)) => (f a -> m (f a, Maybe (f a))) -> (f a -> f a -> m (f a)) -> Stream m (f a) -> Stream m (f a)
112+ [N] splitInnerBySuffix :: Monad m => (f a -> Bool) -> (f a -> m (f a, Maybe (f a))) -> (f a -> f a -> m (f a)) -> Stream m (f a) -> Stream m (f a)
113+ [D] sliceOnSuffix :: Monad m => (a -> Bool) -> Stream m a -> Stream m (Int, Int)
114+ [A] indexOnSuffix :: Monad m => (a -> Bool) -> Stream m a -> Stream m (Int, Int)
115+[C] Streamly.Internal.Data.MutByteArray
116+ [A] unsafePinnedAsPtr :: MonadIO m => MutByteArray -> (Ptr a -> m b) -> m b
117+ [A] unsafeAsPtr :: MonadIO m => MutByteArray -> (Ptr a -> m b) -> m b
118+ [D] nil :: MutByteArray
119+ [A] empty :: MutByteArray
120+ [D] asPtrUnsafe :: MonadIO m => MutByteArray -> (Ptr a -> m b) -> m b
121+[D] Streamly.Internal.Data.MutArray.Stream
122+ [D] writeChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
123+ [D] fromArrayStreamK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
124+ [D] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
125+ [D] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
126+[C] Streamly.Internal.Data.MutArray.Generic
127+ [D] writeWith :: MonadIO m => Int -> Fold m a (MutArray a)
128+ [D] writeNUnsafe :: MonadIO m => Int -> Fold m a (MutArray a)
129+ [A] unsafeCreateOf :: MonadIO m => Int -> Fold m a (MutArray a)
130+ [A] emptyOf :: MonadIO m => Int -> m (MutArray a)
131+ [A] createWith :: MonadIO m => Int -> Fold m a (MutArray a)
132+ [A] createOf :: MonadIO m => Int -> Fold m a (MutArray a)
133+ [A] create :: MonadIO m => Fold m a (MutArray a)
134+[C] Streamly.Internal.Data.MutArray
135+ [A] SpliceState
136+ [A] SpliceYielding :: arr -> SpliceState s arr -> SpliceState s arr
137+ [A] SpliceInitial :: s -> SpliceState s arr
138+ [A] SpliceFinish :: SpliceState s arr
139+ [A] SpliceBuffering :: s -> arr -> SpliceState s arr
140+ [R] MutByteArray
141+ [D] writeWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
142+ [D] writeRevN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
143+ [D] writeNWithUnsafe :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
144+ [D] writeNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
145+ [D] writeChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
146+ [D] writeAppendWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int) -> m (MutArray a) -> Fold m a (MutArray a)
147+ [D] writeAppendNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
148+ [A] unsafePinnedCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
149+ [A] unsafePinnedAsPtr :: MonadIO m => MutArray a -> (Ptr a -> m b) -> m b
150+ [A] unsafeCreateOfWith :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
151+ [A] unsafeCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
152+ [A] unsafeAsPtr :: MonadIO m => MutArray a -> (Ptr a -> m b) -> m b
153+ [A] unsafeAppendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
154+ [A] toStreamWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
155+ [A] toStreamRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
156+ [R] toStreamDWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
157+ [R] toStreamDRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> MutArray a -> Stream m a
158+ [A] slicerFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (MutArray a)
159+ [A] sliceIndexerFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (Int, Int)
160+ [A] revCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
161+ [D] resizeExp :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
162+ [D] resize :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
163+ [A] pokeSkipUnsafe :: Int -> MutArray Word8 -> MutArray Word8
164+ [A] pokeAppendMay :: forall m a. (MonadIO m, Unbox a) => MutArray Word8 -> a -> m (Maybe (MutArray Word8))
165+ [A] pokeAppend :: forall m a. (MonadIO m, Unbox a) => MutArray Word8 -> a -> m (MutArray Word8)
166+ [D] pinnedWriteNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
167+ [D] pinnedWriteN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
168+ [D] pinnedWrite :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
169+ [D] pinnedNewBytes :: MonadIO m => Int -> m (MutArray a)
170+ [A] pinnedEmptyOf :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
171+ [A] pinnedCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
172+ [A] pinnedCreate :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
173+ [A] pinnedCompactLE :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
174+ [A] peekUnconsUnsafe :: forall m a. (MonadIO m, Unbox a) => MutArray Word8 -> m (a, MutArray Word8)
175+ [A] peekUncons :: forall m a. (MonadIO m, Unbox a) => MutArray Word8 -> m (Maybe a, MutArray Word8)
176+ [A] peekSkipUnsafe :: Int -> MutArray Word8 -> MutArray Word8
177+ [A] pPinnedCompactLE :: forall m a. (MonadIO m, Unbox a) => Int -> Parser (MutArray a) m (MutArray a)
178+ [A] pCompactLE :: forall m a. (MonadIO m, Unbox a) => Int -> Parser (MutArray a) m (MutArray a)
179+ [D] nil :: MutArray a
180+ [A] lPinnedCompactGE :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) () -> Fold m (MutArray a) ()
181+ [A] lCompactGE :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) () -> Fold m (MutArray a) ()
182+ [A] indexReaderWith :: (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m Int -> Unfold m (MutArray a) a
183+ [A] indexReader :: (MonadIO m, Unbox a) => Stream m Int -> Unfold m (MutArray a) a
184+ [A] growExp :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
185+ [A] grow :: forall m a. (MonadIO m, Unbox a) => Int -> MutArray a -> m (MutArray a)
186+ [D] getSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (MutArray a)
187+ [R] getIndicesD :: (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m Int -> Unfold m (MutArray a) a
188+ [D] getIndices :: (MonadIO m, Unbox a) => Stream m Int -> Unfold m (MutArray a) a
189+ [D] genSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (MutArray a) (Int, Int)
190+ [A] fromStreamN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (MutArray a)
191+ [D] fromStreamDN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (MutArray a)
192+ [D] fromStreamD :: (MonadIO m, Unbox a) => Stream m a -> m (MutArray a)
193+ [A] fromPureStreamN :: (MonadIO m, Unbox a) => Int -> Stream Identity a -> m (MutArray a)
194+ [A] fromPtrN :: MonadIO m => Int -> Ptr Word8 -> m (MutArray Word8)
195+ [A] fromChunksRealloced :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> m (MutArray a)
196+ [A] fromChunksK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
197+ [A] fromByteStr# :: MonadIO m => Addr# -> m (MutArray Word8)
198+ [D] fromArrayStreamK :: (Unbox a, MonadIO m) => StreamK m (MutArray a) -> m (MutArray a)
199+ [D] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
200+ [D] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
201+ [A] fPinnedCompactGE :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) (MutArray a)
202+ [A] fCompactGE :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m (MutArray a) (MutArray a)
203+ [A] emptyOf :: (MonadIO m, Unbox a) => Int -> m (MutArray a)
204+ [A] empty :: MutArray a
205+ [A] createWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
206+ [A] createOfWith :: forall m a. (MonadIO m, Unbox a) => (Int -> m (MutArray a)) -> Int -> Fold m a (MutArray a)
207+ [A] createOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (MutArray a)
208+ [A] create :: forall m a. (MonadIO m, Unbox a) => Fold m a (MutArray a)
209+ [A] concatWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m (MutArray a) -> Stream m a
210+ [A] concatRevWith :: forall m a. (Monad m, Unbox a) => (forall b. IO b -> m b) -> Stream m (MutArray a) -> Stream m a
211+ [A] concatRev :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
212+ [A] concat :: forall m a. (MonadIO m, Unbox a) => Stream m (MutArray a) -> Stream m a
213+ [A] compactOnByteSuffix :: MonadIO m => Word8 -> Stream m (MutArray Word8) -> Stream m (MutArray Word8)
214+ [A] compactOnByte :: MonadIO m => Word8 -> Stream m (MutArray Word8) -> Stream m (MutArray Word8)
215+ [A] compactLeAs :: forall m a. (MonadIO m, Unbox a) => PinnedState -> Int -> Stream m (MutArray a) -> Stream m (MutArray a)
216+ [A] compactLE :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
217+ [A] compactGE :: (MonadIO m, Unbox a) => Int -> Stream m (MutArray a) -> Stream m (MutArray a)
218+ [A] compactEQ :: Int -> Stream m (MutArray a) -> Stream m (MutArray a)
219+ [D] cmp :: MonadIO m => MutArray a -> MutArray a -> m Ordering
220+ [A] byteEq :: MonadIO m => MutArray a -> MutArray a -> m Bool
221+ [A] byteCmp :: MonadIO m => MutArray a -> MutArray a -> m Ordering
222+ [A] buildChunks :: (MonadIO m, Unbox a) => Int -> Fold m a (StreamK n (MutArray a))
223+ [D] asPtrUnsafe :: MonadIO m => MutArray a -> (Ptr a -> m b) -> m b
224+ [A] appendWith :: forall m a. (MonadIO m, Unbox a) => (Int -> Int) -> m (MutArray a) -> Fold m a (MutArray a)
225+ [A] appendN :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a) -> Fold m a (MutArray a)
226+ [A] append :: forall m a. (MonadIO m, Unbox a) => m (MutArray a) -> Fold m a (MutArray a)
227+[D] Streamly.Internal.Data.Array.Stream
228+ [C] interposeSuffix
229+ [O] interposeSuffix :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
230+ [N] interposeSuffix :: forall m a. (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
231+ [D] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
232+ [D] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
233+ [C] concatRev
234+ [O] concatRev :: (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
235+ [N] concatRev :: forall m a. (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
236+ [D] bufferChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
237+[C] Streamly.Internal.Data.Array.Generic
238+ [A] createOf :: MonadIO m => Int -> Fold m a (Array a)
239+ [A] create :: MonadIO m => Fold m a (Array a)
240+[C] Streamly.Internal.Data.Array
241+ [R] ArrayUnsafe
242+ [D] writeWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
243+ [D] writeNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
244+ [A] unsafePinnedCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
245+ [A] unsafePinnedAsPtr :: MonadIO m => Array a -> (Ptr a -> m b) -> m b
246+ [A] unsafeCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
247+ [D] toStreamDRev :: forall m a. (Monad m, Unbox a) => Array a -> Stream m a
248+ [D] toStreamD :: forall m a. (Monad m, Unbox a) => Array a -> Stream m a
249+ [C] splice
250+ [O] splice :: (MonadIO m, Unbox a) => Array a -> Array a -> m (Array a)
251+ [N] splice :: MonadIO m => Array a -> Array a -> m (Array a)
252+ [A] slicerFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (Array a) (Array a)
253+ [A] sliceIndexerFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (Array a) (Int, Int)
254+ [D] pinnedWriteNUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
255+ [D] pinnedWriteNAligned :: forall m a. (MonadIO m, Unbox a) => Int -> Int -> Fold m a (Array a)
256+ [D] pinnedWriteN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
257+ [D] pinnedWrite :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
258+ [A] pinnedCreateOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
259+ [A] pinnedCreate :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
260+ [A] pinnedCompactLE :: (MonadIO m, Unbox a) => Int -> Stream m (Array a) -> Stream m (Array a)
261+ [A] parseBreakChunksK :: forall m a b. (MonadIO m, Unbox a) => Parser a m b -> StreamK m (Array a) -> m (Either ParseError b, StreamK m (Array a))
262+ [D] nil :: Array a
263+ [A] lPinnedCompactGE :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) () -> Fold m (Array a) ()
264+ [A] lCompactGE :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) () -> Fold m (Array a) ()
265+ [A] interposeSuffix :: forall m a. (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
266+ [A] interpose :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
267+ [A] intercalateSuffix :: (Monad m, Unbox a) => Array a -> Stream m (Array a) -> Stream m a
268+ [A] indexReaderFromThenTo :: Unfold m (Int, Int, Int, Array a) a
269+ [A] indexReader :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
270+ [A] indexFinder :: (a -> Bool) -> Unfold Identity (Array a) Int
271+ [D] getSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (Array a) (Array a)
272+ [R] getIndicesFromThenTo :: Unfold m (Int, Int, Int, Array a) a
273+ [D] getIndices :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
274+ [D] genSlicesFromLen :: forall m a. (Monad m, Unbox a) => Int -> Int -> Unfold m (Array a) (Int, Int)
275+ [D] fromStreamDN :: forall m a. (MonadIO m, Unbox a) => Int -> Stream m a -> m (Array a)
276+ [D] fromStreamD :: forall m a. (MonadIO m, Unbox a) => Stream m a -> m (Array a)
277+ [A] fromPureStreamN :: Unbox a => Int -> Stream Identity a -> Array a
278+ [A] fromPtrN :: Int -> Ptr Word8 -> Array Word8
279+ [A] fromChunksK :: (MonadIO m, Unbox a) => StreamK m (Array a) -> m (Array a)
280+ [A] fromChunks :: (MonadIO m, Unbox a) => Stream m (Array a) -> m (Array a)
281+ [A] fromByteStr :: Ptr Word8 -> Array Word8
282+ [A] foldChunks :: (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m b
283+ [A] foldBreakChunksK :: forall m a b. (MonadIO m, Unbox a) => Fold m a b -> StreamK m (Array a) -> m (b, StreamK m (Array a))
284+ [A] foldBreakChunks :: forall m a b. (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m (b, Stream m (Array a))
285+ [D] flattenArraysRev :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
286+ [D] flattenArrays :: forall m a. (MonadIO m, Unbox a) => Stream m (Array a) -> Stream m a
287+ [C] findIndicesOf
288+ [O] findIndicesOf :: (a -> Bool) -> Unfold Identity (Array a) Int
289+ [N] findIndicesOf :: (a -> Bool) -> Array a -> Stream Identity Int
290+ [A] fPinnedCompactGE :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) (Array a)
291+ [A] fCompactGE :: (MonadIO m, Unbox a) => Int -> Fold m (Array a) (Array a)
292+ [A] empty :: Array a
293+ [A] createWith :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
294+ [A] createOf :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
295+ [A] create :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
296+ [A] concatRev :: forall m a. (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
297+ [A] concat :: (Monad m, Unbox a) => Stream m (Array a) -> Stream m a
298+ [A] compactOnByteSuffix :: MonadIO m => Word8 -> Stream m (Array Word8) -> Stream m (Array Word8)
299+ [A] compactOnByte :: MonadIO m => Word8 -> Stream m (Array Word8) -> Stream m (Array Word8)
300+ [A] compactLE :: (MonadIO m, Unbox a) => Int -> Stream m (Array a) -> Stream m (Array a)
301+ [A] compactGE :: (MonadIO m, Unbox a) => Int -> Stream m (Array a) -> Stream m (Array a)
302+ [A] byteEq :: Array a -> Array a -> Bool
303+ [A] byteCmp :: Array a -> Array a -> Ordering
304+ [A] buildChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
305+ [D] bufferChunks :: (MonadIO m, Unbox a) => Stream m a -> m (StreamK m (Array a))
306+ [D] asPtrUnsafe :: MonadIO m => Array a -> (Ptr a -> m b) -> m b
core/docs/Changelog.mdnew file+97
@@ -0,0 +1,97 @@
1+# Changelog
2+
3+## 0.2.2 (Jan 2024)
4+
5+* Add fixities `infixr 5` for `cons` and `consM` functions.
6+* Fix a bug in Array `Eq` instance when the type is a sum type with
7+ differently sized constructors.
8+* lpackArraysChunksOf, compact, writeChunksWith, putChunksWith now take the
9+ buffer size in number of array elements instead of bytes.
10+
11+## 0.2.1 (Dec 2023)
12+
13+* Make the serialization of the unit constructor deterministic.
14+* Expose `pinnedSerialize` & `deserialize` via `Streamly.Data.Array`.
15+
16+## 0.2.0 (Nov 2023)
17+
18+See [0.1.0-0.2.0 API Changelog](https://github.com/composewell/streamly/blob/streamly-0.10.0/core/docs/ApiChangelogs/0.1.0-0.2.0.txt)
19+for a full list of API changes in this release. Only a few significant
20+changes are mentioned here.
21+
22+### Breaking Changes
23+
24+* `ParserK` in `Streamly.Data.ParserK` is not implicitly specialized
25+ to arrays anymore. To adapt to the new code, change `ParserK a m
26+ b` to `ParserK (Array a) m b` where the `Array` type comes from
27+ `Streamly.Data.Array`. This change also affected the signatures of
28+ `parseChunks` and `parseBreakChunks`.
29+* Changed the signature of 'Streamly.Data.Stream.handle' to make the
30+ exception handler monadic.
31+* Behavior change: Exceptions are now rethrown promptly in `bracketIO`.
32+
33+### Enhancements
34+
35+* __Serialization__: Added a `Streamly.Data.MutByteArray` module with a
36+ `Serialize` type class for fast binary serialization. The Data.Array
37+ module supplies the `serialize` and `deserialize` operations for arrays.
38+* __Unpinned Arrays__: Unboxed arrays are now created unpinned by default,
39+ they were created pinned earlier. During IO operations, unpinned arrays
40+ are automatically copied to pinned memory. When arrays are directly
41+ passed to IO operations programmers can choose to create them pinned to
42+ avoid a copy. To create pinned arrays, use the internal APIs with the
43+ `pinned*` prefix.
44+* StreamK now supports native exception handling routines (handle, bracketIO).
45+ Earlier we had to convert it to the `Stream` type for exception handling.
46+
47+### Deprecations
48+
49+See [0.1.0-0.2.0 API Changelog](https://github.com/composewell/streamly/blob/streamly-0.10.0/core/docs/ApiChangelogs/0.1.0-0.2.0.txt)
50+for a full list of deprecations.
51+
52+### Internal API Changes
53+
54+* Fold constructor has changed, added a `final` field to support
55+ finalization and cleanup of a chain of folds. The `extract` field is
56+ now used only for mapping the fold internal state to fold result for
57+ scanning purposes. If your fold does not require cleanup you can just use
58+ your existing `extract` function as `final` as well to adapt to this change.
59+* Many low level internal modules have been removed, they are entirely
60+ exported from higher level internal modules. If you were importing any
61+ of the missing low level modules then import the higher level modules instead.
62+* Internal module changes:
63+ * Streamly.Internal.Serialize.FromBytes -> Streamly.Internal.Data.Binary.Parser
64+ * Streamly.Internal.Serialize.ToBytes -> Streamly.Internal.Data.Binary.Stream
65+ * Streamly.Internal.Data.Unbox is now exported via Streamly.Internal.Data.Serialize
66+ * Streamly.Internal.Data.IORef.Unboxed is now exported via Streamly.Internal.Data.Serialize
67+
68+## 0.1.0 (March 2023)
69+
70+Also see [streamly-core-0.1.0 API Changelog](https://github.com/composewell/streamly/blob/streamly-0.10.0/core/docs/ApiChangelogs/0.1.0.txt) or
71+https://hackage.haskell.org/package/streamly-core-0.1.0/docs/docs/ApiChangelogs/0.1.0.txt
72+
73+`streamly` package is split into two packages, (1) `streamly-core` that
74+has only GHC boot library depdendecies, and (2) `streamly` that contains
75+higher level operations (including concurrent ones) with additional
76+dependencies.
77+
78+* Moved the following modules from `streamly` package to the
79+ `streamly-core` package:
80+ * Streamly.Console.Stdio
81+ * Streamly.Data.Fold
82+ * Streamly.Data.Unfold
83+ * Streamly.FileSystem.Handle
84+ * Streamly.Unicode.Stream
85+* Added the following new modules:
86+ * Streamly.Data.Array
87+ * Streamly.Data.Array.Generic
88+ * Streamly.Data.MutArray
89+ * Streamly.Data.MutArray.Generic
90+ * Streamly.Data.Parser
91+ * Streamly.Data.ParserK
92+ * Streamly.Data.Stream
93+ * Streamly.Data.StreamK
94+ * Streamly.FileSystem.Dir
95+ * Streamly.FileSystem.File
96+ * Streamly.Unicode.Parser
97+ * Streamly.Unicode.String
core/docs/Readme.mdnew file+1
@@ -0,0 +1 @@
1+Please refer to the "streamly" package for tutorials and other documentation.
core/src/DocTestDataArray.hsnew file+22
@@ -0,0 +1,22 @@
1+{- $setup
2+>>> :m
3+>>> :set -XFlexibleContexts
4+>>> :set -XMagicHash
5+>>> import Data.Function ((&))
6+>>> import Data.Functor.Identity (Identity(..))
7+>>> import System.IO.Unsafe (unsafePerformIO)
8+
9+>>> import Streamly.Data.Array (Array)
10+>>> import Streamly.Data.Stream (Stream)
11+
12+>>> import qualified Streamly.Data.Array as Array
13+>>> import qualified Streamly.Data.Fold as Fold
14+>>> import qualified Streamly.Data.ParserK as ParserK
15+>>> import qualified Streamly.Data.Stream as Stream
16+>>> import qualified Streamly.Data.StreamK as StreamK
17+
18+For APIs that have not been released yet.
19+
20+>>> import qualified Streamly.Internal.Data.Array as Array
21+>>> import qualified Streamly.Internal.Data.Stream as Stream
22+-}
core/src/DocTestDataFold.hsnew file+27
@@ -0,0 +1,27 @@
1+{- $setup
2+>>> :m
3+>>> :set -XFlexibleContexts
4+>>> import Control.Monad (void)
5+>>> import qualified Data.Foldable as Foldable
6+>>> import Data.Function ((&))
7+>>> import Data.Functor.Identity (Identity, runIdentity)
8+>>> import Data.IORef (newIORef, readIORef, writeIORef)
9+>>> import Data.Maybe (fromJust, isJust)
10+>>> import Data.Monoid (Endo(..), Last(..), Sum(..))
11+
12+>>> import Streamly.Data.Array (Array)
13+>>> import Streamly.Data.Fold (Fold, Tee(..))
14+>>> import Streamly.Data.Stream (Stream)
15+
16+>>> import qualified Streamly.Data.Array as Array
17+>>> import qualified Streamly.Data.Fold as Fold
18+>>> import qualified Streamly.Data.MutArray as MutArray
19+>>> import qualified Streamly.Data.Parser as Parser
20+>>> import qualified Streamly.Data.Stream as Stream
21+>>> import qualified Streamly.Data.StreamK as StreamK
22+>>> import qualified Streamly.Data.Unfold as Unfold
23+
24+For APIs that have not been released yet.
25+
26+>>> import qualified Streamly.Internal.Data.Fold as Fold
27+-}
core/src/DocTestDataMutArray.hsnew file+10
@@ -0,0 +1,10 @@
1+{- $setup
2+>>> :m
3+>>> import qualified Streamly.Data.Fold as Fold
4+>>> import qualified Streamly.Data.MutArray as MutArray
5+>>> import qualified Streamly.Data.Stream as Stream
6+
7+For APIs that have not been released yet.
8+
9+>>> import Streamly.Internal.Data.MutArray as MutArray
10+-}
core/src/DocTestDataMutArrayGeneric.hsnew file+10
@@ -0,0 +1,10 @@
1+{- $setup
2+>>> :m
3+>>> import qualified Streamly.Data.Fold as Fold
4+>>> import qualified Streamly.Data.MutArray.Generic as MutArray
5+>>> import qualified Streamly.Data.Stream as Stream
6+
7+For APIs that have not been released yet.
8+
9+>>> import Streamly.Internal.Data.MutArray.Generic as MutArray
10+-}
core/src/DocTestDataParser.hsnew file+20
@@ -0,0 +1,20 @@
1+{- $setup
2+>>> :m
3+>>> import Control.Applicative ((<|>))
4+>>> import Data.Bifunctor (second)
5+>>> import Data.Char (isSpace)
6+>>> import qualified Data.Foldable as Foldable
7+>>> import qualified Data.Maybe as Maybe
8+
9+>>> import Streamly.Data.Fold (Fold)
10+>>> import Streamly.Data.Parser (Parser)
11+
12+>>> import qualified Streamly.Data.Fold as Fold
13+>>> import qualified Streamly.Data.Parser as Parser
14+>>> import qualified Streamly.Data.Stream as Stream
15+
16+For APIs that have not been released yet.
17+
18+>>> import qualified Streamly.Internal.Data.Fold as Fold
19+>>> import qualified Streamly.Internal.Data.Parser as Parser
20+-}
core/src/DocTestDataParserK.hsnew file+15
@@ -0,0 +1,15 @@
1+{- $setup
2+>>> :m
3+>>> import Control.Applicative ((<|>))
4+>>> import Data.Char (isDigit, isAlpha)
5+
6+>>> import Streamly.Data.Parser (Parser)
7+>>> import Streamly.Data.ParserK (ParserK)
8+
9+>>> import qualified Streamly.Data.Parser as Parser
10+>>> import qualified Streamly.Data.ParserK as ParserK
11+
12+For APIs that have not been released yet.
13+
14+>>> import qualified Streamly.Internal.Data.ParserK as ParserK
15+-}
core/src/DocTestDataStream.hsnew file+39
@@ -0,0 +1,39 @@
1+{- $setup
2+
3+>>> :m
4+>>> import Control.Concurrent (threadDelay)
5+>>> import Control.Monad (void)
6+>>> import Control.Monad.IO.Class (MonadIO (liftIO))
7+>>> import Control.Monad.Trans.Class (lift)
8+>>> import Control.Monad.Trans.Identity (runIdentityT)
9+>>> import Data.Char (isSpace)
10+>>> import Data.Either (fromLeft, fromRight, isLeft, isRight, either)
11+>>> import Data.Maybe (fromJust, isJust)
12+>>> import Data.Function (fix, (&))
13+>>> import Data.Functor.Identity (runIdentity)
14+>>> import Data.IORef
15+>>> import Data.Semigroup (cycle1)
16+>>> import GHC.Exts (Ptr (Ptr))
17+>>> import System.IO (stdout, hSetBuffering, BufferMode(LineBuffering))
18+
19+>>> hSetBuffering stdout LineBuffering
20+>>> effect n = print n >> return n
21+
22+>>> import Streamly.Data.Stream (Stream)
23+>>> import qualified Streamly.Data.Array as Array
24+>>> import qualified Streamly.Data.Fold as Fold
25+>>> import qualified Streamly.Data.Stream as Stream
26+>>> import qualified Streamly.Data.StreamK as StreamK
27+>>> import qualified Streamly.Data.Unfold as Unfold
28+>>> import qualified Streamly.Data.Parser as Parser
29+>>> import qualified Streamly.FileSystem.Dir as Dir
30+
31+For APIs that have not been released yet.
32+
33+>>> import qualified Streamly.Internal.Data.Fold as Fold
34+>>> import qualified Streamly.Internal.Data.Parser as Parser
35+>>> import qualified Streamly.Internal.Data.Stream as Stream
36+>>> import qualified Streamly.Internal.Data.StreamK as StreamK
37+>>> import qualified Streamly.Internal.Data.Unfold as Unfold
38+>>> import qualified Streamly.Internal.FileSystem.Dir as Dir
39+-}
core/src/DocTestDataStreamK.hsnew file+21
@@ -0,0 +1,21 @@
1+{- $setup
2+
3+>>> :m
4+>>> import Control.Concurrent (threadDelay)
5+>>> import Data.Function (fix, (&))
6+>>> import Data.Semigroup (cycle1)
7+
8+>>> effect n = print n >> return n
9+
10+>>> import Streamly.Data.StreamK (StreamK)
11+>>> import qualified Streamly.Data.Fold as Fold
12+>>> import qualified Streamly.Data.Parser as Parser
13+>>> import qualified Streamly.Data.Stream as Stream
14+>>> import qualified Streamly.Data.StreamK as StreamK
15+>>> import qualified Streamly.FileSystem.Dir as Dir
16+
17+For APIs that have not been released yet.
18+
19+>>> import qualified Streamly.Internal.Data.StreamK as StreamK
20+>>> import qualified Streamly.Internal.FileSystem.Dir as Dir
21+-}
core/src/DocTestDataUnfold.hsnew file+12
@@ -0,0 +1,12 @@
1+{- $setup
2+
3+>>> :m
4+>>> import Streamly.Data.Unfold (Unfold)
5+>>> import qualified Streamly.Data.Fold as Fold
6+>>> import qualified Streamly.Data.Stream as Stream
7+>>> import qualified Streamly.Data.Unfold as Unfold
8+
9+For APIs that have not been released yet.
10+
11+>>> import qualified Streamly.Internal.Data.Unfold as Unfold
12+-}
core/src/DocTestFileSystemHandle.hsnew file+15
@@ -0,0 +1,15 @@
1+{- $setup
2+>>> :m
3+>>> import qualified Streamly.Data.Array as Array
4+>>> import qualified Streamly.FileSystem.Handle as Handle hiding (readChunks)
5+>>> import qualified Streamly.Data.Fold as Fold
6+>>> import qualified Streamly.Data.Stream as Stream
7+>>> import qualified Streamly.Data.Unfold as Unfold
8+
9+For APIs that have not been released yet.
10+
11+>>> import qualified Streamly.Internal.Data.Array as Array (unsafeCreateOf)
12+>>> import qualified Streamly.Internal.Data.Unfold as Unfold (first)
13+>>> import qualified Streamly.Internal.FileSystem.Handle as Handle
14+>>> import qualified Streamly.Internal.System.IO as IO (defaultChunkSize)
15+-}
core/src/DocTestUnicodeParser.hsnew file+9
@@ -0,0 +1,9 @@
1+{- $setup
2+>>> :m
3+>>> import qualified Streamly.Data.Stream as Stream
4+>>> import qualified Streamly.Unicode.Parser as Unicode
5+
6+For APIs that have not been released yet.
7+
8+>>> import qualified Streamly.Internal.Unicode.Parser as Unicode (number, mkDouble)
9+-}
core/src/DocTestUnicodeStream.hsnew file+12
@@ -0,0 +1,12 @@
1+{- $setup
2+>>> :m
3+
4+>>> import qualified Streamly.Data.Fold as Fold
5+>>> import qualified Streamly.Data.Stream as Stream
6+>>> import qualified Streamly.Unicode.Stream as Unicode
7+
8+For APIs that have not been released yet.
9+
10+>>> :set -XMagicHash
11+>>> import qualified Streamly.Internal.Unicode.Stream as Unicode
12+-}
core/src/DocTestUnicodeString.hsnew file+5
@@ -0,0 +1,5 @@
1+{- $setup
2+>>> :m
3+>>> :set -XQuasiQuotes
4+>>> import Streamly.Internal.Unicode.String
5+-}
src/Streamly/Console/Stdio.hs → core/src/Streamly/Console/Stdio.hsrenamed+3−4
@@ -13,9 +13,9 @@
1313
1414module Streamly.Console.Stdio
1515 (
16− -- * Read (stdin)
17− read
18− , readChunks
16+ -- * Unfolds (stdin)
17+ reader
18+ , chunkReader
1919
2020 -- * Write (stdout)
2121 , write
@@ -28,4 +28,3 @@ module Streamly.Console.Stdio
2828where
2929
3030import Streamly.Internal.Console.Stdio
31−import Prelude hiding (read)
core/src/Streamly/Data/Array.hsnew file+167
@@ -0,0 +1,167 @@
1+{-# LANGUAGE CPP #-}
2+-- |
3+-- Module : Streamly.Data.Array
4+-- Copyright : (c) 2019 Composewell Technologies
5+--
6+-- License : BSD3
7+-- Maintainer : streamly@composewell.com
8+-- Stability : released
9+-- Portability : GHC
10+--
11+-- Unboxed immutable arrays with streaming interfaces.
12+--
13+-- Please refer to "Streamly.Internal.Data.Array" for functions that have not
14+-- yet been released.
15+--
16+-- For arrays that work on boxed types, not requiring the 'Unbox' constraint,
17+-- please refer to "Streamly.Data.Array.Generic". For arrays that can be
18+-- mutated in-place, please see "Streamly.Data.MutArray".
19+
20+module Streamly.Data.Array
21+ (
22+ -- * Setup
23+ -- | To execute the code examples provided in this module in ghci, please
24+ -- run the following commands first.
25+ --
26+ -- $setup
27+
28+ -- * Overview
29+ -- $overview
30+
31+ -- * The Array Type
32+ Array
33+
34+ -- * Pinning & Unpinning
35+ -- | Arrays are created unpinned by default unless pinned versions of
36+ -- creation APIs are used. Look for APIs with @pinned@ prefix in
37+ -- "Streamly.Internal.Data.Array" for some unreleased pinned creation APIs.
38+ -- If an array is to be sent to the OS without any further modification
39+ -- then it should be created pinned in the first place instead of pinning
40+ -- it later. Pinning an unpinned array has a copy overhead. OS interfacing
41+ -- APIs create a pinned array directly or convert an unpinned array to
42+ -- pinned array before sending it to the OS.
43+ , pin
44+ , unpin
45+ , isPinned
46+
47+ -- * Construction
48+ -- | When performance matters, the fastest way to generate an array is
49+ -- 'createOf'. 'IsList' and 'IsString' instances can be
50+ -- used to conveniently construct arrays from literal values.
51+ -- 'OverloadedLists' extension or 'fromList' can be used to construct an
52+ -- array from a list literal. Similarly, 'OverloadedStrings' extension or
53+ -- 'fromList' can be used to construct an array from a string literal.
54+
55+ -- ** From Stream
56+ , createOf
57+ , create
58+ , writeLastN -- drop old (ring buffer)
59+
60+ -- ** From List
61+ , fromListN
62+ , fromList
63+
64+ -- * To List
65+ -- 'GHC.Exts.toList' from "GHC.Exts" can be used to convert an array to a
66+ -- list.
67+ , toList
68+
69+ -- * To Stream
70+ , read
71+ , readRev
72+
73+ -- * Unfolds
74+ , reader
75+ , readerRev
76+
77+ -- * Casting
78+ , cast
79+ , asBytes
80+
81+ -- * Random Access
82+ , length
83+ -- , (!!)
84+ , getIndex
85+
86+ -- * Serialization
87+ , pinnedSerialize
88+ , deserialize
89+
90+ -- * Re-exports
91+ , Unbox (..)
92+ , Serialize(..)
93+
94+ -- * Deprecated
95+ , writeN -- drop new
96+ , write -- full buffer
97+ )
98+where
99+
100+#include "inline.hs"
101+
102+import Streamly.Internal.Data.Array
103+import Streamly.Internal.Data.MutByteArray (Unbox(..), Serialize(..))
104+
105+import Prelude hiding (read, length)
106+
107+#include "DocTestDataArray.hs"
108+
109+-- $overview
110+--
111+-- This module provides APIs to create and use unboxed immutable arrays. Once
112+-- created, their contents cannot be modified. Only types that are unboxable
113+-- via the 'Unbox' type class can be stored in these arrays. Note that the
114+-- array memory grows automatically when creating a new array, therefore, an
115+-- array can be created from a variable length stream.
116+--
117+-- == Folding Arrays
118+--
119+-- Convert array to stream, and fold the stream:
120+--
121+-- >>> fold f arr = Array.read arr & Stream.fold f
122+-- >>> fold Fold.sum (Array.fromList [1,2,3::Int])
123+-- 6
124+--
125+-- == Transforming Arrays
126+--
127+-- Convert array to stream, transform, and fold back to array:
128+--
129+-- >>> amap f arr = Array.read arr & fmap f & Stream.fold (Array.createOf (Array.length arr))
130+-- >>> amap (+1) (Array.fromList [1,2,3::Int])
131+-- fromList [2,3,4]
132+--
133+-- == Pinned and Unpinned Arrays
134+--
135+-- The array type can use both pinned and unpinned memory under the hood. The
136+-- default array creation operations create unpinned arrays. IO operations
137+-- automatically copy an array to pinned memory if the array passed to it is
138+-- unpinned. Programmers can use appropriate pinned array generation APIs to
139+-- reduce the copying if it happens.
140+--
141+-- Unpinned arrays have the advantage of allowing automatic defragmentation of
142+-- the memory by GC. Whereas pinned arrays have the advantage of not requiring
143+-- a copy by GC. Normally you would want to use unpinned arrays. However, in
144+-- some cases, for example, for long lived large data storage, and for
145+-- interfacing with the operating system or foreign (non-Haskell) consumers you
146+-- may want to use pinned arrays.
147+--
148+-- == Creating Arrays from Non-IO Streams
149+--
150+-- Array creation folds require 'MonadIO' otherwise the compiler may
151+-- incorrectly share the array memory thinking it is pure.
152+--
153+-- See the 'fromPureStream' unreleased API to generate an array from an
154+-- Identity stream safely without using MonadIO constraint.
155+--
156+-- Note that 'Identity' streams can be generalized to IO streams:
157+--
158+-- >>> stream = Stream.fromList [1,2,3] :: Stream Identity Int
159+-- >>> pure2IO s = Stream.morphInner (return . runIdentity) s :: Stream IO Int
160+-- >>> Stream.fold Array.create (pure2IO stream)
161+-- fromList [1,2,3]
162+--
163+-- == Programming Tips
164+--
165+-- This module is designed to be imported qualified:
166+--
167+-- >>> import qualified Streamly.Data.Array as Array
core/src/Streamly/Data/Array/Generic.hsnew file+51
@@ -0,0 +1,51 @@
1+-- |
2+-- Module : Streamly.Data.Array.Generic
3+-- Copyright : (c) 2019 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+-- Stability : experimental
8+-- Portability : GHC
9+--
10+-- Unconstrained version of "Streamly.Data.Array" module.
11+--
12+-- See the "Streamly.Data.Array" module for documentation.
13+--
14+module Streamly.Data.Array.Generic
15+ ( Array
16+
17+ -- * Construction
18+ , fromListN
19+ , fromList
20+
21+ -- MonadicAPIs
22+ , createOf
23+ , create
24+
25+ -- * Conversion
26+ , toList
27+
28+ -- * Streams
29+ , read
30+ , readRev
31+
32+ -- * Unfolds
33+ , reader
34+ -- , A.readerRev
35+
36+ -- * Random Access
37+ , length
38+ , getIndex
39+
40+ -- -- * Folding Arrays
41+ -- , A.streamFold
42+ -- , A.fold
43+
44+ -- * Deprecated
45+ , writeN
46+ , write
47+ )
48+where
49+
50+import Streamly.Internal.Data.Array.Generic
51+import Prelude hiding (length, read)
core/src/Streamly/Data/Array/Unboxed.hsdeleted−104
@@ -1,104 +0,0 @@
1−#include "inline.hs"
2−
3−-- |
4−-- Module : Streamly.Data.Array.Unboxed
5−-- Copyright : (c) 2019 Composewell Technologies
6−--
7−-- License : BSD3
8−-- Maintainer : streamly@composewell.com
9−-- Stability : released
10−-- Portability : GHC
11−--
12−-- This module provides immutable arrays in pinned memory (non GC memory)
13−-- suitable for long lived data storage, random access and for interfacing with
14−-- the operating system.
15−--
16−-- Arrays in this module are chunks of pinned memory that hold a sequence of
17−-- 'Storable' values of a given type, they cannot store non-serializable data
18−-- like functions. Once created an array cannot be modified. Pinned memory
19−-- allows efficient buffering of long lived data without adding any impact to
20−-- GC. One array is just one pointer visible to GC and it does not have to be
21−-- copied across generations. Moreover, pinned memory allows communication
22−-- with foreign consumers and producers (e.g. file or network IO) without
23−-- copying the data.
24−--
25−-- = Programmer Notes
26−--
27−-- Array creation APIs require a 'MonadIO' Monad, except 'fromList' which is a
28−-- pure API. To operate on streams in pure Monads like 'Identity' you can hoist
29−-- it to IO monad as follows:
30−--
31−-- >>> import Data.Functor.Identity (Identity, runIdentity)
32−-- >>> s = Stream.fromList [1..10] :: Stream Identity Int
33−-- >>> s1 = Stream.hoist (return . runIdentity) s :: Stream IO Int
34−-- >>> Stream.fold Array.write s1 :: IO (Array Int)
35−-- [1,2,3,4,5,6,7,8,9,10]
36−--
37−-- 'unsafePerformIO' can be used to get a pure API from IO, as long as you know
38−-- it is safe to do so:
39−--
40−-- >>> import System.IO.Unsafe (unsafePerformIO)
41−-- >>> unsafePerformIO $ Stream.fold Array.write s1 :: Array Int
42−-- [1,2,3,4,5,6,7,8,9,10]
43−--
44−-- To apply a transformation to an array use 'read' to unfold the array into a
45−-- stream, apply a transformation on the stream and then use 'write' to fold it
46−-- back to an array.
47−--
48−-- This module is designed to be imported qualified:
49−--
50−-- > import qualified Streamly.Data.Array.Unboxed as Array
51−--
52−-- For experimental APIs see "Streamly.Internal.Data.Array.Unboxed".
53−
54−module Streamly.Data.Array.Unboxed
55− (
56− A.Array
57−
58− -- * Arrays
59− -- ** Construction
60− -- | When performance matters, the fastest way to generate an array is
61− -- 'writeN'. 'IsList' and 'IsString' instances can be
62− -- used to conveniently construct arrays from literal values.
63− -- 'OverloadedLists' extension or 'fromList' can be used to construct an
64− -- array from a list literal. Similarly, 'OverloadedStrings' extension or
65− -- 'fromList' can be used to construct an array from a string literal.
66−
67− -- Pure List APIs
68− , A.fromListN
69− , A.fromList
70−
71− -- Monadic APIs
72− , A.writeN -- drop new
73− , A.write -- full buffer
74− , writeLastN -- drop old (ring buffer)
75−
76− -- ** Elimination
77− -- 'GHC.Exts.toList' from "GHC.Exts" can be used to convert an array to a
78− -- list.
79−
80− , A.toList
81− , A.read
82− , A.readRev
83−
84− -- ** Casting
85− , cast
86− , asBytes
87−
88− -- ** Random Access
89− , A.length
90− -- , (!!)
91− , A.getIndex
92− )
93−where
94−
95−import Streamly.Internal.Data.Array.Unboxed as A
96−
97−-- $setup
98−-- >>> :m
99−-- >>> :set -XFlexibleContexts
100−-- >>> :set -package streamly
101−-- >>> import Streamly.Internal.Data.Stream (Stream)
102−-- >>> import Streamly.Data.Array.Unboxed (Array)
103−-- >>> import qualified Streamly.Internal.Data.Stream as Stream
104−-- >>> import qualified Streamly.Data.Array.Unboxed as Array
core/src/Streamly/Data/Array/Unboxed/Mut.hsdeleted−59
@@ -1,59 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Array.Unboxed.Mut
3−-- Copyright : (c) 2022 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−-- Stability : released
8−-- Portability : GHC
9−--
10−-- This module provides mutable arrays suitable for long lived data storage,
11−-- random access, and mutation.
12−--
13−
14−module Streamly.Data.Array.Unboxed.Mut
15− (
16− Array
17−
18− -- * Arrays
19− -- ** Construction
20−
21− -- Uninitialized Arrays
22− , newArray
23−
24− -- From containers
25− , fromListN
26− , fromList
27− , writeN -- drop new
28− , write -- full buffer
29− -- writeLastN
30−
31− -- ** Appending elements
32− , snoc
33−
34− -- ** Appending streams
35− , appendN
36− , append
37−
38− -- ** Inplace mutation
39− , putIndex
40−
41− -- ** Random access
42− , getIndex
43−
44− -- ** Elimination
45− , toList
46− , read
47− , readRev
48−
49− -- ** Casting
50− , cast
51− , asBytes
52−
53− -- ** Size
54− , length
55− )
56−where
57−
58−import Prelude hiding (length, read)
59−import Streamly.Internal.Data.Array.Unboxed.Mut
core/src/Streamly/Data/Fold.hs+189−63
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
12-- |
23-- Module : Streamly.Data.Fold
34-- Copyright : (c) 2019 Composewell Technologies
@@ -6,33 +7,47 @@
67-- Stability : released
78-- Portability : GHC
89--
9−-- A 'Fold' is a sink or a consumer of a stream of values. The 'Fold' type
10−-- consists of an accumulator and an effectful action that absorbs a value into
11−-- the accumulator.
10+-- Fast, composable stream consumers with ability to terminate, supporting
11+-- stream fusion.
1212--
13−-- >>> import Data.Function ((&))
14−-- >>> import qualified Streamly.Data.Fold as Fold
15−-- >>> import qualified Streamly.Data.Stream as Stream
13+-- == Using Folds
1614--
17−-- For example, a 'sum' Fold represents adding the input to the accumulated
18−-- sum. A fold driver e.g. 'Streamly.Prelude.fold' pushes values from a stream
19−-- to the 'Fold' one at a time, reducing the stream to a single value.
15+-- This module provides elementary folds and fold combinators that can be used
16+-- to consume a stream of data and reduce it to a final value, or transform it
17+-- in a stateful manner using scans. A data stream can be reduced into a stream
18+-- of folded data elements by folding segments of the stream. Fold combinators
19+-- can be used to compose multiple folds in parallel or to create a pipeline of
20+-- folds such that the next fold consumes the result of the previous fold. To
21+-- run these folds on a stream see 'Streamly.Data.Stream.fold',
22+-- 'Streamly.Data.Stream.scan', 'Streamly.Data.Stream.postscan',
23+-- 'Streamly.Data.Stream.scanMaybe', 'Streamly.Data.Stream.foldMany' and other
24+-- operations accepting 'Fold' type as argument "Streamly.Data.Stream".
25+--
26+-- == Reducing a Stream
27+--
28+-- A 'Fold' is a consumer of a stream of values. A fold driver (such as
29+-- 'Streamly.Data.Stream.fold') initializes the fold @accumulator@, runs the
30+-- fold @step@ function in a loop, processing the input stream one element at a
31+-- time and accumulating the result. The loop continues until the fold
32+-- terminates, at which point the accumulated result is returned.
33+--
34+-- For example, a 'sum' Fold represents a stream consumer that adds the values
35+-- in the input stream:
2036--
2137-- >>> Stream.fold Fold.sum $ Stream.fromList [1..100]
2238-- 5050
2339--
24−-- Conceptually, a 'Fold' is a data type that can mimic a strict left fold
25−-- ('Data.List.foldl') as well as lazy right fold ('Prelude.foldr'). The above
26−-- example is similar to a left fold using @(+)@ as the step and @0@ as the
27−-- initial value of the accumulator:
40+-- Conceptually, a 'Fold' is a data type that mimics a strict left fold
41+-- ('Data.List.foldl'). The above example is similar to a left fold using
42+-- @(+)@ as the step and @0@ as the initial value of the accumulator:
2843--
2944-- >>> Data.List.foldl' (+) 0 [1..100]
3045-- 5050
3146--
32−-- 'Fold's have an early termination capability e.g. the 'head' fold would
33−-- terminate on an infinite stream:
47+-- 'Fold's have an early termination capability e.g. the 'one' fold terminates
48+-- after consuming one element:
3449--
35−-- >>> Stream.fold Fold.head $ Stream.fromList [1..]
50+-- >>> Stream.fold Fold.one $ Stream.fromList [1..]
3651-- Just 1
3752--
3853-- The above example is similar to the following right fold:
@@ -47,6 +62,8 @@
4762-- >>> Stream.fold sumTwo $ Stream.fromList [1..100]
4863-- 3
4964--
65+-- == Parallel Composition
66+--
5067-- Folds can be combined to run in parallel on the same input. For example, to
5168-- compute the average of numbers in a stream without going through the stream
5269-- twice:
@@ -66,14 +83,18 @@
6683-- >>> Stream.fold f stream
6784-- ("Even 50","Odd 50")
6885--
86+-- == Sequential Composition
87+--
6988-- Terminating folds can be combined to parse the stream serially such that the
7089-- first fold consumes the input until it terminates and the second fold
7190-- consumes the rest of the input until it terminates:
7291--
73−-- >>> f = Fold.serialWith (,) (Fold.take 8 Fold.toList) (Fold.takeEndBy (== '\n') Fold.toList)
92+-- >>> f = Fold.splitWith (,) (Fold.take 8 Fold.toList) (Fold.takeEndBy (== '\n') Fold.toList)
7493-- >>> Stream.fold f $ Stream.fromList "header: hello\n"
7594-- ("header: ","hello\n")
7695--
96+-- == Splitting a Stream
97+--
7798-- A 'Fold' can be applied repeatedly on a stream to transform it to a stream
7899-- of fold results. To split a stream on newlines:
79100--
@@ -86,15 +107,12 @@
86107-- >>> Stream.fold (Fold.many f Fold.toList) $ Stream.fromList "Hello there!\nHow are you\n"
87108-- ["Hello there!\n","How are you\n"]
88109--
89−-- Please see "Streamly.Internal.Data.Fold" for additional @Pre-release@
90−-- functions.
91−--
92−-- = Folds vs. Streams
110+-- == Folds vs. Streams
93111--
94112-- We can often use streams or folds to achieve the same goal. However, streams
95113-- are more efficient in composition of producers (e.g.
96−-- 'Streamly.Prelude.serial' or 'Streamly.Prelude.mergeBy') whereas folds are
97−-- more efficient in composition of consumers (e.g. 'serialWith', 'partition'
114+-- 'Data.Stream.append' or 'Data.Stream.mergeBy') whereas folds are
115+-- more efficient in composition of consumers (e.g. 'splitWith', 'partition'
98116-- or 'teeWith').
99117--
100118-- Streams are producers, transformations on streams happen on the output side:
@@ -125,17 +143,50 @@
125143-- Notice the similiarity in the definition of @f@ in both cases, the only
126144-- difference is the composition by @&@ vs @$@ and the use @lmap@ vs @map@, the
127145-- difference is due to output vs input side transformations.
146+--
147+-- == Fusion Limitations
148+--
149+-- Folds support stream fusion for generating loops comparable to the speed of
150+-- C. However, it has some limitations. For fusion to work, the folds must be
151+-- inlined, folds must be statically known and not generated dynamically, folds
152+-- should not be passed recursively.
153+--
154+-- Another limitation is due to the quadratic complexity causing slowdown when
155+-- too many nested compositions are used. Especially, the performance of the
156+-- Applicative instance and splitting operations (e.g. 'splitWith') degrades
157+-- quadratically (O(n^2)) when combined @n@ times, roughly 8 or less sequenced
158+-- operations are fine. For these cases folds can be converted to parsers and
159+-- then used as ParserK.
160+--
161+-- == Experimental APIs
162+--
163+-- Please refer to "Streamly.Internal.Data.Fold" for more functions that have
164+-- not yet been released.
128165
129166module Streamly.Data.Fold
130167 (
168+ -- * Setup
169+ -- | To execute the code examples provided in this module in ghci, please
170+ -- run the following commands first.
171+ --
172+ -- $setup
173+
174+ -- * Running A Fold
175+ drive
176+ -- XXX Should we have a stream returning function in fold module?
177+ -- , breakStream
178+
131179 -- * Fold Type
132180
133− Fold -- (..)
181+ , Fold -- (..)
182+ , Tee (..)
134183
135184 -- * Constructors
136185 , foldl'
137186 , foldlM'
138− , foldr
187+ , foldl1'
188+ , foldlM1'
189+ , foldr'
139190
140191 -- * Folds
141192 -- ** Accumulators
@@ -152,15 +203,13 @@ module Streamly.Data.Fold
152203
153204 -- Reducers
154205 , drain
155− , drainBy
156− , last
206+ , drainMapM
157207 , length
208+ , countDistinct
209+ , countDistinctInt
210+ , frequency
158211 , sum
159212 , product
160− , maximumBy
161− , maximum
162− , minimumBy
163− , minimum
164213 , mean
165214 , rollingHash
166215 , rollingHashWithSalt
@@ -168,17 +217,43 @@ module Streamly.Data.Fold
168217 -- Collectors
169218 , toList
170219 , toListRev
220+ , toSet
221+ , toIntSet
222+ , topBy
223+
224+ -- ** Non-Empty Accumulators
225+ -- | Accumulators that do not have a default value, therefore, return
226+ -- 'Nothing' on an empty stream.
227+ , latest
228+ , maximumBy
229+ , maximum
230+ , minimumBy
231+ , minimum
232+
233+ -- ** Filtering Scanners
234+ -- | Accumulators that are usually run as a scan using the 'scanMaybe'
235+ -- combinator.
236+ , findIndices
237+ , elemIndices
238+ , deleteBy
239+ -- , uniq
240+ , uniqBy
241+ , nub
242+ , nubInt
171243
172244 -- ** Terminating Folds
173− -- | These are much like lazy right folds.
245+ , one
246+ , null
247+ -- , satisfy
248+ -- , maybe
174249
175250 , index
176− , head
251+ , the
177252 , find
253+ , findM
178254 , lookup
179255 , findIndex
180256 , elemIndex
181− , null
182257 , elem
183258 , notElem
184259 , all
@@ -186,24 +261,44 @@ module Streamly.Data.Fold
186261 , and
187262 , or
188263
264+ -- * Incremental builders
265+ -- | Mutable arrays ("Streamly.Data.MutArray") are basic builders. You can
266+ -- use the 'Streamly.Data.MutArray.snoc' or
267+ -- 'Streamly.Data.MutArray.writeAppend' operations to incrementally build
268+ -- mutable arrays. The 'addOne' and 'addStream' combinators can be used to
269+ -- incrementally build any type of structure using a fold, including arrays
270+ -- or a stream of arrays.
271+ --
272+ -- Use pinned arrays if you are going to use the data for IO.
273+
274+ -- XXX should rename to "extract". can use "Fold.drive Stream.nil" instead,
275+ -- for now.
276+ -- , extractM
277+ -- , reduce
278+ , addOne
279+ -- , snocl
280+ -- XXX Can we use something like concatEffect to implement snocM?
281+ -- , snocM
282+ -- , snoclM
283+ , addStream
284+ , duplicate
285+ -- , isClosed
286+
189287 -- * Combinators
190288 -- | Combinators are modifiers of folds. In the type @Fold m a b@, @a@ is
191289 -- the input type and @b@ is the output type. Transformations can be
192− -- applied either on the input side or on the output side. Therefore,
193− -- combinators are of one of the following general shapes:
290+ -- applied either on the input side (contravariant) or on the output side
291+ -- (covariant). Therefore, combinators are of one of the following general
292+ -- shapes:
194293 --
195294 -- * @... -> Fold m a b -> Fold m c b@ (input transformation)
196295 -- * @... -> Fold m a b -> Fold m a c@ (output transformation)
197296 --
198− -- Output transformations are also known as covariant transformations, and
199− -- input transformations are also known as contravariant transformations.
200297 -- The input side transformations are more interesting for folds. Most of
201298 -- the following sections describe the input transformation operations on a
202− -- fold. The names and signatures of the operations are consistent with
203− -- corresponding operations in "Streamly.Prelude". When an operation makes
204− -- sense on both input and output side we use the prefix @l@ (for left) for
205− -- input side operations and the prefix @r@ (for right) for output side
206− -- operations.
299+ -- fold. When an operation makes sense on both input and output side we use
300+ -- the prefix @l@ (for left) for input side operations and the prefix @r@
301+ -- (for right) for output side operations.
207302
208303 -- ** Mapping on output
209304 -- | The 'Functor' instance of a fold maps on the output of the fold:
@@ -217,22 +312,31 @@ module Streamly.Data.Fold
217312 , lmap
218313 , lmapM
219314
220− -- ** Filtering
315+ -- ** Scanning and Filtering
316+ , scan
317+ , postscan
318+ , scanMaybe
221319 , filter
222320 , filterM
223321
224322 -- -- ** Mapping Filters
225− , catMaybes
226323 , mapMaybe
324+ , catMaybes
325+ , catLefts
326+ , catRights
327+ , catEithers
227328
228329 -- ** Trimming
229330 , take
230331 -- , takeInterval
231− , takeEndBy_
232332 , takeEndBy
333+ , takeEndBy_
233334
234− -- ** Serial Append
235− , serialWith
335+ -- ** Splitting
336+ , splitWith
337+ , many
338+ , groupsOf
339+ -- , intervalsOf
236340
237341 -- ** Parallel Distribution
238342 -- | For applicative composition using distribution see
@@ -254,36 +358,58 @@ module Streamly.Data.Fold
254358 --, partitionByMinM
255359 --, partitionBy
256360
361+ -- ** Key-value Collectors
362+ , toMap
363+ , toMapIO
364+ , demuxToMap
365+ , demuxToMapIO
366+
367+ -- ** Key-value Scanners
368+ , classify
369+ , classifyIO
370+ , demux
371+ , demuxIO
372+
257373 -- ** Unzipping
258374 , unzip
259375
260− -- ** Splitting
261− , many
262− , chunksOf
263− -- , intervalsOf
264−
265376 -- ** Nesting
266377 , concatMap
267378
379+ -- * Transforming the Monad
380+ , morphInner
381+
268382 -- * Deprecated
383+ , chunksOf
384+ , foldr
385+ , drainBy
386+ , last
387+ , head
269388 , sequence
270389 , mapM
271390 , variance
272391 , stdDev
392+ , serialWith
273393 )
274394where
275395
276396import Prelude
277− hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
278− foldl, map, mapM_, sequence, all, any, sum, product, elem,
279− notElem, maximum, minimum, head, last, tail, length, null,
280− reverse, iterate, init, and, or, lookup, foldr1, (!!),
281− scanl, scanl1, replicate, concatMap, mconcat, foldMap, unzip,
282− span, splitAt, break, mapM)
397+ hiding (Foldable(..), filter, drop, dropWhile, take, takeWhile, zipWith,
398+ map, mapM_, sequence, all, any,
399+ notElem, head, last, tail,
400+ reverse, iterate, init, and, or, lookup, (!!),
401+ scanl, scanl1, replicate, concatMap, mconcat, unzip,
402+ span, splitAt, break, mapM, maybe)
283403
284404import Streamly.Internal.Data.Fold
285405
286−-- $setup
287−-- >>> import Data.Function ((&))
288−-- >>> import qualified Streamly.Data.Fold as Fold
289−-- >>> import qualified Streamly.Data.Stream as Stream
406+#include "DocTestDataFold.hs"
407+
408+--------------------------------------------------------------------------------
409+-- Deprecated
410+--------------------------------------------------------------------------------
411+
412+{-# DEPRECATED chunksOf "Please use 'groupsOf' instead" #-}
413+{-# INLINE chunksOf #-}
414+chunksOf :: Monad m => Int -> Fold m a b -> Fold m b c -> Fold m a c
415+chunksOf = groupsOf
core/src/Streamly/Data/Fold/Tee.hsdeleted−41
@@ -1,41 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Fold.Tee
3−-- Copyright : (c) 2021 Composewell Technologies
4−-- License : BSD-3-Clause
5−-- Maintainer : streamly@composewell.com
6−-- Stability : released
7−-- Portability : GHC
8−--
9−-- The 'Tee' type is a newtype wrapper over the 'Streamly.Data.Fold.Fold' type providing
10−-- distributive 'Applicative', 'Semigroup', 'Monoid', 'Num', 'Floating' and
11−-- 'Fractional' instances. The input received by the composed 'Tee' is
12−-- replicated and distributed to both the constituent Tees.
13−--
14−-- For example, to compute the average of numbers in a stream without going
15−-- through the stream twice:
16−--
17−-- >>> import Streamly.Data.Fold.Tee (Tee(..))
18−-- >>> import qualified Streamly.Data.Stream as Stream
19−-- >>> import qualified Streamly.Data.Fold as Fold
20−--
21−-- >>> avg = (/) <$> (Tee Fold.sum) <*> (Tee $ fmap fromIntegral Fold.length)
22−-- >>> Stream.fold (toFold avg) $ Stream.fromList [1.0..100.0]
23−-- 50.5
24−--
25−-- Similarly, the 'Semigroup' and 'Monoid' instances of 'Tee' distribute the
26−-- input to both the folds and combine the outputs using Monoid or Semigroup
27−-- instances of the output types:
28−--
29−-- >>> import Data.Monoid (Sum(..))
30−-- >>> t = Tee Fold.head <> Tee Fold.last
31−-- >>> Stream.fold (toFold t) (fmap Sum $ Stream.enumerateFromTo 1.0 100.0)
32−-- Just (Sum {getSum = 101.0})
33−--
34−-- The 'Num', 'Floating', and 'Fractional' instances work in the same way.
35−--
36−module Streamly.Data.Fold.Tee
37− ( Tee(..)
38− )
39−where
40−
41−import Streamly.Internal.Data.Fold.Tee
core/src/Streamly/Data/MutArray.hsnew file+110
@@ -0,0 +1,110 @@
1+{-# LANGUAGE CPP #-}
2+-- |
3+-- Module : Streamly.Data.MutArray
4+-- Copyright : (c) 2022 Composewell Technologies
5+--
6+-- License : BSD3
7+-- Maintainer : streamly@composewell.com
8+-- Stability : released
9+-- Portability : GHC
10+--
11+-- This module provides a mutable version of "Streamly.Data.Array". The
12+-- contents of a mutable array can be modified in-place. For general
13+-- documentation, please refer to the original module.
14+--
15+-- Please refer to "Streamly.Internal.Data.MutArray" for functions that have
16+-- not yet been released.
17+--
18+-- For mutable arrays that work on boxed types, not requiring the 'Unbox'
19+-- constraint, please refer to "Streamly.Data.MutArray.Generic".
20+
21+module Streamly.Data.MutArray
22+ (
23+ -- * Setup
24+ -- | To execute the code examples provided in this module in ghci, please
25+ -- run the following commands first.
26+ --
27+ -- $setup
28+
29+ -- * Mutable Array Type
30+ MutArray
31+
32+ -- * Construction
33+
34+ -- Uninitialized Arrays
35+ , emptyOf
36+ , pinnedEmptyOf
37+
38+ -- From containers
39+ , fromListN
40+ , fromList
41+ , createOf
42+ , create
43+ -- writeLastN
44+
45+ -- * Pinning & Unpinning
46+ , pin
47+ , unpin
48+ , isPinned
49+
50+ -- * Appending elements
51+ , snoc
52+
53+ -- * Appending streams
54+ , appendN
55+ , append
56+
57+ -- * Inplace mutation
58+ , putIndex
59+ , putIndexUnsafe
60+ , modifyIndex
61+ , modifyIndexUnsafe
62+ , modify
63+
64+ -- * Random access
65+ , getIndex
66+ , getIndexUnsafe
67+
68+ -- * Conversion
69+ , toList
70+
71+ -- * Streams
72+ , read
73+ , readRev
74+
75+ -- * Unfolds
76+ , reader
77+ , readerRev
78+
79+ -- * Casting
80+ , cast
81+ , asBytes
82+
83+ -- * Size
84+ , length
85+
86+ -- * Re-exports
87+ , Unbox (..)
88+
89+ -- * Deprecated
90+ , newPinned
91+ , new
92+ , pinnedNew
93+ , writeN
94+ , write
95+ , writeAppendN
96+ , writeAppend
97+ )
98+where
99+
100+import Prelude hiding (length, read)
101+import Streamly.Internal.Data.MutArray
102+import Streamly.Internal.Data.Unbox (Unbox (..))
103+import Control.Monad.IO.Class (MonadIO)
104+
105+#include "DocTestDataMutArray.hs"
106+
107+{-# DEPRECATED newPinned "Please use pinnedNew instead." #-}
108+{-# INLINE newPinned #-}
109+newPinned :: forall m a. (MonadIO m, Unbox a) => Int -> m (MutArray a)
110+newPinned = pinnedNew
core/src/Streamly/Data/MutArray/Generic.hsnew file+70
@@ -0,0 +1,70 @@
1+{-# LANGUAGE CPP #-}
2+-- |
3+-- Module : Streamly.Data.MutArray.Generic
4+-- Copyright : (c) 2020 Composewell Technologies
5+-- License : BSD3-3-Clause
6+-- Maintainer : streamly@composewell.com
7+-- Stability : experimental
8+-- Portability : GHC
9+--
10+-- Unconstrained version of "Streamly.Data.MutArray" module.
11+--
12+-- See the "Streamly.Data.MutArray" module for documentation.
13+--
14+module Streamly.Data.MutArray.Generic
15+(
16+ -- * Setup
17+ -- | To execute the code examples provided in this module in ghci, please
18+ -- run the following commands first.
19+ --
20+ -- $setup
21+
22+ -- * Type
23+ MutArray
24+
25+ -- * Construction
26+ , emptyOf
27+ , fromListN
28+ , fromList
29+ , createOf
30+ , create
31+
32+ -- * Appending elements
33+ , snoc
34+
35+ -- * Inplace mutation
36+ , putIndex
37+ , putIndexUnsafe
38+ , modifyIndex
39+ , modifyIndexUnsafe
40+ -- , modify
41+
42+ -- * Random reads
43+ , getIndex
44+ , getIndexUnsafe
45+
46+ -- * Conversion
47+ , toList
48+
49+ -- * Streams
50+ , read
51+ , readRev
52+
53+ -- * Unfolds
54+ , reader
55+ -- , readerRev
56+
57+ -- * Size
58+ , length
59+
60+ -- * Deprecated
61+ , new
62+ , writeN
63+ , write
64+ )
65+where
66+
67+import Streamly.Internal.Data.MutArray.Generic
68+import Prelude hiding (read, length)
69+
70+#include "DocTestDataMutArrayGeneric.hs"
core/src/Streamly/Data/MutByteArray.hsnew file+106
@@ -0,0 +1,106 @@
1+-- |
2+-- Module : Streamly.Data.MutByteArray
3+-- Copyright : (c) 2023 Composewell Technologies
4+-- License : BSD3-3-Clause
5+-- Maintainer : streamly@composewell.com
6+-- Portability : GHC
7+--
8+-- A low level byte Array type 'MutByteArray', along with type classes 'Unbox'
9+-- and 'Serialize' for fast binary serialization and deserialization of Haskell
10+-- values. Serialization, deserialization performance is similar to, and in
11+-- some cases many times better than the store package. Conceptually, the
12+-- 'Serialize' type class works in the same way as store.
13+--
14+-- Serialize instances are configurable to use constructor names (see
15+-- 'Streamly.Internal.Data.MutByteArray.encodeConstrNames'), record field names (see
16+-- 'Streamly.Internal.Data.MutByteArray.encodeRecordFields') instead of binary
17+-- encoded values. This is an experimental feature which allows JSON like
18+-- properties with faster speed. For example, you can change the order of
19+-- constructors or record fields without affecting serialized value.
20+--
21+-- Higher level unboxed array modules "Streamly.Data.Array" and
22+-- "Streamly.Data.MutArray" are built on top of this module. Unboxed arrays are
23+-- essentially serialized Haskell values. Array modules provide higher level
24+-- serialization routines like 'Streamly.Internal.Data.Array.pinnedSerialize'
25+-- and 'Streamly.Internal.Data.Array.deserialize' from the
26+-- "Streamly.Internal.Data.Array" module.
27+--
28+-- == Mutable Byte Array
29+--
30+-- 'MutByteArray' is a primitive mutable array in the IO monad. 'Unbox' and
31+-- 'Serialize' type classes use this primitive array to serialize data to and
32+-- deserialize it from. This array is used to build higher level unboxed
33+-- array types 'Streamly.Data.MutArray.MutArray' and 'Streamly.Data.Array.Array'.
34+--
35+-- == Using Unbox
36+--
37+-- The 'Unbox' type class is simple and used to serialize non-recursive fixed
38+-- size data types. This type class is primarily used to implement unboxed
39+-- arrays. Unboxed arrays are just a sequence of serialized fixed length
40+-- Haskell data types. Instances of this type class can be derived using
41+-- 'Generic' or template haskell based deriving functions provided in this
42+-- module.
43+--
44+-- Writing a data type to an array using the array creation routines in
45+-- "Streamly.Data.Array" or "Streamly.Data.MutArray" (e.g. @writeN@ or
46+-- @fromListN@), serializes the type to the array. Similarly, reading the data
47+-- type from the array deserializes it. You can also serialize and deserialize
48+-- directly to and from a 'MutByteArray', using the type class methods.
49+--
50+-- == Using Serialize
51+--
52+-- The 'Serialize' type class is a superset of the 'Unbox' type class, it can
53+-- serialize variable length data types as well e.g. Haskell lists. Use
54+-- 'deriveSerialize' to derive the instances of the type class automatically
55+-- and then use the type class methods to serialize and deserialize to and from
56+-- a 'MutByteArray'.
57+--
58+-- See 'Streamly.Internal.Data.Array.pinnedSerialize' and
59+-- 'Streamly.Internal.Data.Array.deserialize' for 'Array' type based
60+-- serialization.
61+--
62+-- == Comparing serialized values
63+--
64+-- When using the `Unbox` type class the same value may result in differing
65+-- serialized bytes because of unused uninitialized data in case of sum types.
66+-- Therefore, byte comparison of serialized values is not reliable.
67+--
68+-- However, the 'Serialize' type class guarantees that the serialized values
69+-- are always exactly the same and byte comparison of serialized is reliable.
70+--
71+module Streamly.Data.MutByteArray
72+ (
73+
74+ -- * Mutable Byte Array
75+ -- | The standard way to read from or write to a 'MutByteArray' is by using
76+ -- the 'Unbox' or 'Serialize' type class methods.
77+ MutByteArray
78+ , isPinned
79+ , pin
80+ , unpin
81+ , new
82+ , pinnedNew
83+
84+ -- * Unbox
85+ , Unbox(..)
86+ , deriveUnbox
87+
88+ -- * Serialize
89+ , Serialize(..)
90+
91+ -- ** Instance Config
92+ , SerializeConfig
93+ , inlineAddSizeTo
94+ , inlineSerializeAt
95+ , inlineDeserializeAt
96+
97+ -- ** Instance Deriving
98+ , deriveSerialize
99+ , deriveSerializeWith
100+ ) where
101+
102+--------------------------------------------------------------------------------
103+-- Imports
104+--------------------------------------------------------------------------------
105+
106+import Streamly.Internal.Data.MutByteArray
core/src/Streamly/Data/Parser.hs+158−16
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
12-- |
23-- Module : Streamly.Data.Parser
34-- Copyright : (c) 2020 Composewell Technologies
@@ -6,19 +7,149 @@
67-- Stability : pre-release
78-- Portability : GHC
89--
9−-- Fast backtracking parsers with stream fusion and native streaming
10−-- capability. Parsers are just more powerful folds, folds and parsers can be
11−-- interconverted.
10+-- Parsers are stream consumers like folds with the following differences:
1211--
13−-- Note that these parsers do not report the error context (e.g. line number or
14−-- column). Though this can be supported in future.
12+-- * folds cannot fail but parsers can fail and backtrack.
13+-- * folds can be composed as a Tee but parsers cannot.
14+-- * folds can be used for scanning but parsers cannot.
15+-- * folds can be converted to parsers.
16+--
17+-- This module implements parsers with stream fusion which compile to efficient
18+-- loops comparable to the speed of C.
19+--
20+-- == Using Parsers
21+--
22+-- This module provides elementary parsers and parser combinators that can be
23+-- used to parse a stream of data. Additionally, all the folds from the
24+-- "Streamly.Data.Fold" module can be converted to parsers using 'fromFold'.
25+-- All the parsing functionality provided by popular parsing libraries, and
26+-- more is available. Also see "Streamly.Unicode.Parser" module for Char stream
27+-- parsers.
28+--
29+-- A data stream can be transformed to a stream of parsed data elements. Parser
30+-- combinators can be used to create a pipeline of folds or parsers such that
31+-- the next fold or parser consumes the result of the previous parser. See
32+-- 'Streamly.Data.Stream.parse' and 'Streamly.Data.Stream.parseMany' to run
33+-- these parsers on a stream.
34+--
35+-- == Parser vs ParserK
36+--
37+-- There are two functionally equivalent parsing modules,
38+-- "Streamly.Data.Parser" (this module) and "Streamly.Data.ParserK". The latter
39+-- is a CPS based wrapper over the former, and can be used for parsing in
40+-- general. "Streamly.Data.Parser" enables stream fusion and should be
41+-- preferred over "Streamly.Data.ParserK" for high performance stream parsing
42+-- use cases. However, there are a few cases where this module is not
43+-- suitable and ParserK should be used instead.
44+--
45+-- For static fusion, parser combinators have to use strict pattern matching on
46+-- arguments of type Parser. This leads to infinte loop when a parser is
47+-- defined recursively, due to strict evaluation of the recursive call. For
48+-- example, the following implementation loops infinitely because of the
49+-- recursive use of parser @p@ in the @*>@ combinator:
50+--
51+-- >>> import Streamly.Data.Parser (Parser)
52+-- >>> import qualified Streamly.Data.Fold as Fold
53+-- >>> import qualified Streamly.Data.Parser as Parser
54+-- >>> import qualified Streamly.Data.Stream as Stream
55+-- >>> import Control.Applicative ((<|>))
56+--
57+-- >>> :{
58+-- >>> p :: Monad m => Parser Char m String
59+-- >>> p = Parser.satisfy (== '(') *> p <|> Parser.fromFold Fold.toList
60+-- >>> :}
61+--
62+-- Use ParserK when recursive use is required:
63+--
64+-- >>> import Streamly.Data.ParserK (ParserK)
65+-- >>> import qualified Streamly.Data.StreamK as StreamK
66+-- >>> import qualified Streamly.Internal.Data.StreamK as StreamK (parse)
67+-- >>> import qualified Streamly.Internal.Data.ParserK as ParserK (adapt)
68+--
69+-- >>> :{
70+-- >>> p :: Monad m => ParserK Char m String
71+-- >>> p = ParserK.adapt (Parser.satisfy (== '(')) *> p <|> ParserK.adapt (Parser.fromFold Fold.toList)
72+-- >>> :}
73+--
74+-- >>> StreamK.parse p $ StreamK.fromStream $ Stream.fromList "hello"
75+-- Right "hello"
76+--
77+-- For this reason Applicative, Alternative or Monad compositions with
78+-- recursion cannot be used with the 'Parser' type. Alternative type class based
79+-- operations like 'asum' and Alternative based generic parser combinators use
80+-- recursion. Similarly, Applicative type class based operations like
81+-- 'Prelude.sequence' use recursion. Custom implementations of many such
82+-- operations are provided in this module (e.g. 'some', 'many'), and those
83+-- should be used instead.
84+--
85+-- Another limitation of Parser type is due to the quadratic complexity causing
86+-- slowdown when too many nested compositions are used. Especially Applicative,
87+-- Monad, Alternative instances, and sequenced parsing operations (e.g. nested
88+-- 'one', and 'splitWith') degrade the performance quadratically (O(n^2)) when
89+-- combined @n@ times, roughly 8 or less sequenced parsers are fine. READ THE
90+-- DOCS OF APPLICATIVE, MONAD AND ALTERNATIVE INSTANCES.
91+--
92+-- == Streaming Parsers
93+--
94+-- With 'Streamly.Data.ParserK.ParserK' you can use the generic Alternative
95+-- type class based parsers from the
96+-- <https://hackage.haskell.org/package/parser-combinators parser-combinators>
97+-- library or similar. However, we recommend that you use the equivalent
98+-- functionality from this module for better performance and for streaming
99+-- behavior.
100+--
101+-- Firstly, the combinators in this module are faster due to stream fusion.
102+-- Secondly, these are streaming in nature as the results can be passed
103+-- directly to other stream consumers (folds or parsers). The Alternative type
104+-- class based parsers would end up buffering all the results in lists before
105+-- they can be consumed.
106+--
107+-- When recursion or heavy nesting is needed use ParserK.
108+--
109+-- == Error Reporting
110+--
111+-- These parsers do not report the error context (e.g. line number or column).
112+-- This may be supported in future.
113+--
114+-- == Monad Transformer Stack
115+--
116+-- 'MonadTrans' instance is not provided. If the 'Parser' type is the top most
117+-- layer (which should be the case almost always) you can just use 'fromEffect'
118+-- to execute the lower layer monad effects.
119+--
120+-- == Parser vs ParserK Implementation
121+--
122+-- The 'Parser' type represents a stream consumer by composing state as data
123+-- which enables stream fusion. Stream fusion generates a tight loop without
124+-- any constructor allocations between the stages, providing C like performance
125+-- for the loop. Stream fusion works when multiple functions are combined in a
126+-- pipeline statically. Therefore, the operations in this module must be
127+-- inlined and must not be used recursively to allow for stream fusion.
128+--
129+-- The 'ParserK' type represents a stream consumer by composing function calls,
130+-- therefore, a function call overhead is incurred at each composition. It is
131+-- quite fast in general but may be a few times slower than a fused parser.
132+-- However, it allows for scalable dynamic composition especially parsers can
133+-- be used in recursive calls. Using the 'ParserK' type operations like
134+-- 'splitWith' provide linear (O(n)) performance with respect to the number of
135+-- compositions.
136+--
137+-- == Experimental APIs
138+--
139+-- Please refer to "Streamly.Internal.Data.Parser" for functions that have not
140+-- yet been released.
15141--
16142module Streamly.Data.Parser
17143 (
144+ -- * Setup
145+ -- | To execute the code examples provided in this module in ghci, please
146+ -- run the following commands first.
147+ --
148+ -- $setup
149+
18150 -- * Parser Type
19151 Parser
20152
21− -- XXX Should we use Fold.fromParser instead?
22153 -- -- * Downgrade to Fold
23154 -- , toFold
24155
@@ -32,24 +163,25 @@ module Streamly.Data.Parser
32163 , fromEffect
33164 , die
34165 -- , dieM
166+ , peek
167+ , eof
35168
36169 -- ** Element parsers
37− , peek
38170
39171 -- All of these can be expressed in terms of either
40172 , one
41− , element
42− , except
173+ -- , oneEq
174+ -- , oneNotEq
43175 , oneOf
44176 , noneOf
45177 , satisfy
46178 -- , maybe
47179 -- , either
48− , eof
49180
50181 -- ** Sequences
51− , eqBy
52− , list
182+ , streamEqBy
183+ , listEqBy
184+ , listEq
53185
54186 -- * Combinators
55187 -- Mapping on output
@@ -59,6 +191,9 @@ module Streamly.Data.Parser
59191 , lmap
60192 , lmapM
61193
194+ -- * Map on output
195+ , rmapM
196+
62197 -- ** Filtering
63198 , filter
64199
@@ -83,12 +218,17 @@ module Streamly.Data.Parser
83218
84219 -- ** Grouping
85220 , groupBy
86− -- , groupByRolling
87− -- , groupByRollingEither
221+ , groupByRolling
222+ , groupByRollingEither
88223
89224 -- ** Framing
90− , wordFramedBy
91− , wordQuotedBy
225+ -- , wordFramedBy
226+ , wordWithQuotes
227+ -- , wordProcessQuotes
228+ -- , wordKeepQuotes
229+
230+ -- -- * Alternative
231+ -- , alt
92232
93233 -- ** Splitting
94234 , many
@@ -103,3 +243,5 @@ where
103243
104244import Streamly.Internal.Data.Parser
105245import Prelude hiding (dropWhile, takeWhile, filter)
246+
247+#include "DocTestDataParser.hs"
core/src/Streamly/Data/ParserK.hsnew file+139
@@ -0,0 +1,139 @@
1+{-# LANGUAGE CPP #-}
2+-- |
3+-- Module : Streamly.Data.ParserK
4+-- Copyright : (c) 2023 Composewell Technologies
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+-- Stability : pre-release
8+-- Portability : GHC
9+--
10+-- See the general notes about parsing in the "Streamly.Data.Parser" module.
11+-- This module implements a using Continuation Passing Style (CPS) wrapper over
12+-- the "Streamly.Data.Parser" module. It is as fast or faster than attoparsec.
13+--
14+-- == Parser vs ParserK
15+--
16+-- 'ParserK' is preferred over 'Streamly.Data.Parser.Parser' when extensive
17+-- applicative, alternative and monadic composition is required, or when
18+-- recursive or dynamic composition of parsers is required. The
19+-- 'Streamly.Data.Parser.Parser' type fuses statically and creates efficient
20+-- loops whereas 'ParserK' uses function call based composition and has
21+-- comparatively larger runtime overhead but it is better suited to the
22+-- specific use cases mentioned above. 'ParserK' also allows to efficient parse
23+-- a stream of arrays, it can also break the input stream into a parse result
24+-- and remaining stream so that the stream can be parsed independently in
25+-- segments.
26+--
27+-- == Using ParserK
28+--
29+-- All the parsers from the "Streamly.Data.Parser" module can be adapted to
30+-- ParserK using the 'Streamly.Data.ParserK.adaptC',
31+-- 'Streamly.Internal.Data.ParserK.adapt', and
32+-- 'Streamly.Internal.Data.ParserK.adaptCG' combinators.
33+--
34+-- 'Streamly.Data.StreamK.parseChunks' runs a parser on a stream of unboxed
35+-- arrays, this is the preferred and most efficient way to parse chunked input.
36+-- The more general 'Streamly.Data.StreamK.parseBreakChunks' function returns
37+-- the remaining stream as well along with the parse result. There are
38+-- 'Streamly.Internal.Data.StreamK.parseChunksGeneric',
39+-- 'Streamly.Internal.Data.StreamK.parseBreakChunksGeneric' as well to run
40+-- parsers on boxed arrays. 'Streamly.Internal.Data.StreamK.parse',
41+-- 'Streamly.Internal.Data.StreamK.parseBreak' run parsers on a stream of
42+-- individual elements instead of stream of arrays.
43+--
44+-- == Monadic Composition
45+--
46+-- Monad composition can be used for lookbehind parsers, we can dynamically
47+-- compose new parsers based on the results of the previously parsed values.
48+--
49+-- If we have to parse "a9" or "9a" but not "99" or "aa" we can use the
50+-- following non-monadic, backtracking parser:
51+--
52+-- >>> digits p1 p2 = ((:) <$> p1 <*> ((:) <$> p2 <*> pure []))
53+-- >>> :{
54+-- backtracking :: Monad m => ParserK Char m String
55+-- backtracking = ParserK.adapt $
56+-- digits (Parser.satisfy isDigit) (Parser.satisfy isAlpha)
57+-- <|>
58+-- digits (Parser.satisfy isAlpha) (Parser.satisfy isDigit)
59+-- :}
60+--
61+-- We know that if the first parse resulted in a digit at the first place then
62+-- the second parse is going to fail. However, we waste that information and
63+-- parse the first character again in the second parse only to know that it is
64+-- not an alphabetic char. By using lookbehind in a 'Monad' composition we can
65+-- avoid redundant work:
66+--
67+-- >>> data DigitOrAlpha = Digit Char | Alpha Char
68+--
69+-- >>> :{
70+-- lookbehind :: Monad m => ParserK Char m String
71+-- lookbehind = do
72+-- x1 <- ParserK.adapt $
73+-- Digit <$> Parser.satisfy isDigit
74+-- <|> Alpha <$> Parser.satisfy isAlpha
75+-- -- Note: the parse depends on what we parsed already
76+-- x2 <- ParserK.adapt $
77+-- case x1 of
78+-- Digit _ -> Parser.satisfy isAlpha
79+-- Alpha _ -> Parser.satisfy isDigit
80+-- return $ case x1 of
81+-- Digit x -> [x,x2]
82+-- Alpha x -> [x,x2]
83+-- :}
84+--
85+-- == Experimental APIs
86+--
87+-- Please refer to "Streamly.Internal.Data.ParserK" for functions that have
88+-- not yet been released.
89+--
90+module Streamly.Data.ParserK
91+ (
92+ -- * Setup
93+ -- | To execute the code examples provided in this module in ghci, please
94+ -- run the following commands first.
95+ --
96+ -- $setup
97+
98+ -- * Parser Type
99+ ParserK
100+
101+ -- * Parsers
102+ -- ** Conversions
103+ , adapt
104+ , adaptC
105+ , adaptCG
106+ -- , toParser
107+
108+ -- ** Without Input
109+ , fromPure
110+ , fromEffect
111+ , die
112+
113+ -- * Deprecated
114+ , fromFold
115+ , fromParser
116+ )
117+
118+where
119+
120+import Control.Monad.IO.Class (MonadIO)
121+import Streamly.Internal.Data.Fold (Fold)
122+import Streamly.Internal.Data.Unbox (Unbox)
123+import Streamly.Internal.Data.Array (Array)
124+import qualified Streamly.Internal.Data.Parser as ParserD
125+
126+import Streamly.Internal.Data.ParserK.Type
127+
128+#include "DocTestDataParserK.hs"
129+
130+{-# DEPRECATED fromFold "Please use \"ParserK.adaptC . Parser.fromFold\" instead." #-}
131+{-# INLINE fromFold #-}
132+fromFold :: (MonadIO m, Unbox a) => Fold m a b -> ParserK (Array a) m b
133+fromFold = adaptC . ParserD.fromFold
134+
135+{-# DEPRECATED fromParser "Please use \"adaptC\" instead." #-}
136+{-# INLINE fromParser #-}
137+fromParser ::
138+ (MonadIO m, Unbox a) => ParserD.Parser a m b -> ParserK (Array a) m b
139+fromParser = adaptC
core/src/Streamly/Data/Stream.hs+429−147
@@ -1,7 +1,4 @@
1−{-# OPTIONS_GHC -Wno-orphans #-}
2−
3−#include "inline.hs"
4−
1+{-# LANGUAGE CPP #-}
52-- |
63-- Module : Streamly.Data.Stream
74-- Copyright : (c) 2017 Composewell Technologies
@@ -11,102 +8,59 @@
118-- Stability : released
129-- Portability : GHC
1310--
14−-- To run examples in this module:
15−--
16−-- >>> import qualified Streamly.Data.Fold as Fold
17−-- >>> import qualified Streamly.Data.Stream as Stream
18−--
19−-- We will add some more imports in the examples as needed.
20−--
21−-- For effectful streams we will use the following IO action:
22−--
23−-- >>> effect n = print n >> return n
24−--
25−-- = Overview
26−--
27−-- Streamly is a framework for modular data flow based programming and
28−-- declarative concurrency. Powerful stream fusion framework in streamly
29−-- allows high performance combinatorial programming even when using byte level
30−-- streams. Streamly API is similar to Haskell lists.
31−--
32−-- Streams can be constructed
33−-- like lists, except that they use 'nil' instead of '[]' and 'cons' instead of
34−-- ':'.
35−--
36−-- `cons` constructs a pure stream which is more or less the same as a list:
37−--
38−-- >>> import Streamly.Data.Stream (Stream, cons, consM, nil)
39−-- >>> stream = 1 `cons` 2 `cons` nil :: Stream IO Int
40−-- >>> Stream.fold Fold.toList stream -- IO [Int]
41−-- [1,2]
42−--
43−-- 'consM' constructs a stream from effectful actions:
44−--
45−-- >>> stream = effect 1 `consM` effect 2 `consM` nil
46−-- >>> Stream.fold Fold.toList stream
47−-- 1
48−-- 2
49−-- [1,2]
50−--
51−-- == Console Echo Example
52−--
53−-- In the following example, 'repeatM' generates an infinite stream of 'String'
54−-- by repeatedly performing the 'getLine' IO action. 'mapM' then applies
55−-- 'putStrLn' on each element in the stream converting it to stream of '()'.
56−-- Finally, 'drain' folds the stream to IO discarding the () values, thus
57−-- producing only effects.
58−--
59−-- >>> import Data.Function ((&))
60−--
61−-- >>> :{
62−-- echo =
63−-- Stream.repeat getLine -- Stream IO (IO String)
64−-- & Stream.sequence -- Stream IO String
65−-- & Stream.mapM putStrLn -- Stream IO ()
66−-- & Stream.fold Fold.drain -- IO ()
67−-- :}
68−--
69−-- This is a console echo program. It is an example of a declarative loop
70−-- written using streaming combinators. Compare it with an imperative @while@
71−-- loop.
72−--
73−-- Hopefully, this gives you an idea how we can program declaratively by
74−-- representing loops using streams. In this module, you can find all
75−-- "Data.List" like functions and many more powerful combinators to perform
76−-- common programming tasks.
11+-- Streams represented as state machines, that fuse together when composed
12+-- statically, eliminating function calls or intermediate constructor
13+-- allocations - generating tight, efficient loops. Suitable for high
14+-- performance looping operations.
7715--
78−-- Some common idioms:
16+-- If you need to call these operations recursively in a loop (i.e. composed
17+-- dynamically) then it is recommended to use the continuation passing style
18+-- (CPS) stream operations from the "Streamly.Data.StreamK" module. 'Stream'
19+-- and 'StreamK' types are interconvertible. See more details in the
20+-- documentation below regarding 'Stream' vs 'StreamK'.
7921--
80−-- >>> repeatM = Stream.sequence . Stream.repeat
81−-- >>> replicateM n = Stream.sequence . Stream.replicate n
82−-- >>> fromListM = Stream.sequence . Stream.fromList
83−-- >>> fromFoldableM = Stream.sequence . Stream.fromFoldable
84−-- >>> fromIndices f = fmap f $ Stream.enumerateFrom 0
22+-- Please refer to "Streamly.Internal.Data.Stream" for more functions that have
23+-- not yet been released.
8524--
86−-- Also see "Streamly.Internal.Data.Stream" module for many more @Pre-release@
87−-- combinators. See the <https://github.com/composewell/streamly-examples>
25+-- Checkout the <https://github.com/composewell/streamly-examples>
8826-- repository for many more real world examples of stream programming.
89−--
27+
9028module Streamly.Data.Stream
9129 (
30+ -- * Setup
31+ -- | To execute the code examples provided in this module in ghci, please
32+ -- run the following commands first.
33+ --
34+ -- $setup
35+
36+ -- * Overview
37+ -- $overview
38+
39+ -- * The Stream Type
9240 Stream
41+
9342 -- * Construction
9443 -- | Functions ending in the general shape @b -> Stream m a@.
9544 --
96− -- See also: "Streamly.Internal.Data.Stream.Generate" for
97− -- @Pre-release@ functions.
45+ -- Useful Idioms:
46+ --
47+ -- >>> fromIndices f = fmap f $ Stream.enumerateFrom 0
48+ -- >>> fromIndicesM f = Stream.mapM f $ Stream.enumerateFrom 0
49+ -- >>> fromListM = Stream.sequence . Stream.fromList
50+ -- >>> fromFoldable = StreamK.toStream . StreamK.fromFoldable
51+ -- >>> fromFoldableM = Stream.sequence . fromFoldable
9852
9953 -- ** Primitives
100− -- | Primitives to construct a stream from pure values or monadic actions.
101− -- All other stream construction and generation combinators described later
102− -- can be expressed in terms of these primitives. However, the special
103− -- versions provided in this module can be much more efficient in most
104− -- cases. Users can create custom combinators using these primitives.
54+ -- | A fused 'Stream' is never constructed using these primitives, they are
55+ -- typically generated by converting containers like list into streams, or
56+ -- generated using custom functions provided in this module. The 'cons'
57+ -- primitive in this module has a rare use in fusing a small number of
58+ -- elements. On the other hand, it is common to construct 'StreamK' stream
59+ -- using the StreamK.'StreamK.cons' primitive.
10560 , nil
61+ , nilM
10662 , cons
10763 , consM
108− -- , cons2 -- fused version
109− -- , consM2 -- fused version
11064
11165 -- ** Unfolding
11266 -- | 'unfoldrM' is the most general way of generating a stream efficiently.
@@ -116,10 +70,21 @@ module Streamly.Data.Stream
11670
11771 -- ** From Values
11872 -- | Generate a monadic stream from a seed value or values.
73+ --
74+ -- Non-empty pure streams can be cycled using repeat and unfold:
75+ --
76+ -- >>> cycle = Stream.unfoldMany Unfold.fromList . Stream.repeat
77+ --
78+ -- Non-empty StreamK can be cycled using append:
79+ --
80+ -- >>> cycle xs = let ys = xs `StreamK.append` ys in ys
81+ --
11982 , fromPure
12083 , fromEffect
12184 , repeat
85+ , repeatM
12286 , replicate
87+ , replicateM
12388
12489 -- Note: Using enumeration functions e.g. 'Prelude.enumFromThen' turns out
12590 -- to be slightly faster than the idioms like @[from, then..]@.
@@ -148,7 +113,6 @@ module Streamly.Data.Stream
148113 -- | Convert an input structure, container or source into a stream. All of
149114 -- these can be expressed in terms of primitives.
150115 , fromList
151− , fromFoldable
152116
153117 -- ** From Unfolds
154118 -- | Most of the above stream generation operations can also be expressed
@@ -159,8 +123,6 @@ module Streamly.Data.Stream
159123 -- | Functions ending in the general shape @Stream m a -> m b@ or @Stream m
160124 -- a -> m (b, Stream m a)@
161125 --
162− -- See also: "Streamly.Internal.Data.Stream.Eliminate" for @Pre-release@
163− -- functions.
164126
165127-- EXPLANATION: In imperative terms a fold can be considered as a loop over the stream
166128-- that reduces the stream to a single value.
@@ -234,27 +196,83 @@ module Streamly.Data.Stream
234196 -- ending in the general shape @Stream m a -> m (b, Stream m a)@
235197 , uncons
236198
237− -- ** Folding
199+ -- ** Strict Left Folds
238200 -- XXX Need to have a general parse operation here which can be used to
239201 -- express all others.
240202 , fold -- XXX rename to run? We can have a Stream.run and Fold.run.
241203 -- XXX fold1 can be achieved using Monoids or Refolds.
204+ -- XXX We can call this just "break" and parseBreak as "munch"
242205 , foldBreak
243− , foldContinue
206+
207+ -- XXX should we have a Fold returning function in stream module?
208+ -- , foldAdd
209+ -- , buildl
244210
245211 -- ** Parsing
246212 , parse
247− , parseBreak
213+ -- , parseBreak
248214
249− -- -- ** Lazy Right Folds
250− -- Consuming a stream to build a right associated expression, suitable
215+ -- ** Lazy Right Folds
216+ -- | Consuming a stream to build a right associated expression, suitable
251217 -- for lazy evaluation. Evaluation of the input happens when the output of
252218 -- the fold is evaluated, the fold output is a lazy thunk.
253219 --
254220 -- This is suitable for stream transformation operations, for example,
255221 -- operations like mapping a function over the stream.
256− -- , foldrM
257− -- , foldr
222+ , foldrM
223+ , foldr
224+ -- foldr1
225+
226+ -- ** Specific Folds
227+ -- | Streams are folded using folds in "Streamly.Data.Fold". Here are some
228+ -- idioms and equivalents of Data.List APIs using folds:
229+ --
230+ -- >>> foldlM' f a = Stream.fold (Fold.foldlM' f a)
231+ -- >>> foldl1' f = Stream.fold (Fold.foldl1' f)
232+ -- >>> foldl' f a = Stream.fold (Fold.foldl' f a)
233+ -- >>> drain = Stream.fold Fold.drain
234+ -- >>> mapM_ f = Stream.fold (Fold.drainMapM f)
235+ -- >>> length = Stream.fold Fold.length
236+ -- >>> genericLength = Stream.fold Fold.lengthGeneric
237+ -- >>> head = Stream.fold Fold.one
238+ -- >>> last = Stream.fold Fold.latest
239+ -- >>> null = Stream.fold Fold.null
240+ -- >>> and = Stream.fold Fold.and
241+ -- >>> or = Stream.fold Fold.or
242+ -- >>> any p = Stream.fold (Fold.any p)
243+ -- >>> all p = Stream.fold (Fold.all p)
244+ -- >>> sum = Stream.fold Fold.sum
245+ -- >>> product = Stream.fold Fold.product
246+ -- >>> maximum = Stream.fold Fold.maximum
247+ -- >>> maximumBy cmp = Stream.fold (Fold.maximumBy cmp)
248+ -- >>> minimum = Stream.fold Fold.minimum
249+ -- >>> minimumBy cmp = Stream.fold (Fold.minimumBy cmp)
250+ -- >>> elem x = Stream.fold (Fold.elem x)
251+ -- >>> notElem x = Stream.fold (Fold.notElem x)
252+ -- >>> lookup x = Stream.fold (Fold.lookup x)
253+ -- >>> find p = Stream.fold (Fold.find p)
254+ -- >>> (!?) i = Stream.fold (Fold.index i)
255+ -- >>> genericIndex i = Stream.fold (Fold.indexGeneric i)
256+ -- >>> elemIndex x = Stream.fold (Fold.elemIndex x)
257+ -- >>> findIndex p = Stream.fold (Fold.findIndex p)
258+ --
259+ -- Some equivalents of Data.List APIs from the Stream module:
260+ --
261+ -- >>> head = fmap (fmap fst) . Stream.uncons
262+ -- >>> tail = fmap (fmap snd) . Stream.uncons
263+ -- >>> tail = Stream.tail -- unreleased API
264+ -- >>> init = Stream.init -- unreleased API
265+ --
266+ -- A Stream based toList fold implementation is provided below because it
267+ -- has a better performance compared to the fold.
268+
269+ -- Functions in Data.List, missing here:
270+ -- unsnoc = Stream.parseBreak (Parser.init Fold.toList)
271+ -- genericTake
272+ -- genericDrop
273+ -- genericSplitAt
274+ -- genericReplicate
275+ , toList
258276
259277 -- * Mapping
260278 -- | Stateless one-to-one transformations. Use 'fmap' for mapping a pure
@@ -274,29 +292,63 @@ module Streamly.Data.Stream
274292 -- the stream, it can merely transform them.
275293 , sequence
276294 , mapM
277− -- , trace -- XXX Use "tracing" map instead?
295+ , trace
278296 , tap
279297 , delay
280298
281299 -- * Scanning
282300 -- | Stateful one-to-one transformations.
283301 --
284− -- See also: "Streamly.Internal.Data.Stream.Transform" for
285− -- @Pre-release@ functions.
302+
303+ {-
304+ -- ** Left scans
305+ -- | We can perform scans using folds with the 'scan' combinator in the
306+ -- next section. However, the combinators supplied in this section are
307+ -- better amenable to stream fusion when combined with other operations.
308+ -- Note that 'postscan' using folds fuses well and does not require custom
309+ -- combinators like these.
310+ , scanl'
311+ , scanlM'
312+ , scanl1'
313+ , scanl1M'
314+ -}
315+
316+ -- ** Scanning By 'Fold'
317+ -- | Useful idioms:
318+ --
319+ -- >>> scanl' f z = Stream.scan (Fold.foldl' f z)
320+ -- >>> scanlM' f z = Stream.scan (Fold.foldlM' f z)
321+ -- >>> postscanl' f z = Stream.postscan (Fold.foldl' f z)
322+ -- >>> postscanlM' f z = Stream.postscan (Fold.foldlM' f z)
323+ -- >>> scanl1' f = Stream.catMaybes . Stream.scan (Fold.foldl1' f)
324+ -- >>> scanl1M' f = Stream.catMaybes . Stream.scan (Fold.foldlM1' f)
286325 , scan
287326 , postscan
288327 -- XXX postscan1 can be implemented using Monoids or Refolds.
328+ -- The following scans from Data.List are not provided.
329+ -- XXX scanl
330+ -- XXX scanl1
331+ -- XXX scanr
332+ -- XXX scanr1
333+ -- XXX mapAccumL
334+ -- XXX mapAccumR
335+ -- XXX inits
336+ -- XXX tails
337+
338+ -- ** Specific scans
289339 -- Indexing can be considered as a special type of zipping where we zip a
290340 -- stream with an index stream.
291341 , indexed
292− , indexedR
293342
294343 -- * Insertion
295344 -- | Add elements to the stream.
345+ --
346+ -- >>> insert = Stream.insertBy compare
296347
297348 -- Inserting elements is a special case of interleaving/merging streams.
298349 , insertBy
299350 , intersperseM
351+ , intersperseM_
300352 , intersperse
301353
302354 -- * Filtering
@@ -305,6 +357,7 @@ module Streamly.Data.Stream
305357 -- ** Stateless Filters
306358 -- | 'mapMaybeM' is the most general stateless filtering operation. All
307359 -- other filtering operations can be expressed using it.
360+
308361 -- EXPLANATION:
309362 -- In imperative terms a filter over a stream corresponds to a loop with a
310363 -- @continue@ clause for the cases when the predicate fails.
@@ -314,11 +367,27 @@ module Streamly.Data.Stream
314367 , filter
315368 , filterM
316369
370+ -- Filter and concat
371+ , catMaybes
372+ , catLefts
373+ , catRights
374+ , catEithers
375+
317376 -- ** Stateful Filters
318377 -- | 'scanMaybe' is the most general stateful filtering operation. The
319378 -- filtering folds (folds returning a 'Maybe' type) in
320379 -- "Streamly.Internal.Data.Fold" can be used along with 'scanMaybe' to
321380 -- perform stateful filtering operations in general.
381+ --
382+ -- Idioms and equivalents of Data.List APIs:
383+ --
384+ -- >>> deleteBy cmp x = Stream.scanMaybe (Fold.deleteBy cmp x)
385+ -- >>> deleteBy = Stream.deleteBy -- unreleased API
386+ -- >>> delete = deleteBy (==)
387+ -- >>> findIndices p = Stream.scanMaybe (Fold.findIndices p)
388+ -- >>> elemIndices a = findIndices (== a)
389+ -- >>> uniq = Stream.scanMaybe (Fold.uniqBy (==))
390+ -- >>> partition p = Stream.fold (Fold.partition Fold.toList Fold.toList) . fmap (if p then Left else Right)
322391 , scanMaybe
323392 , take
324393 , takeWhile
@@ -326,48 +395,78 @@ module Streamly.Data.Stream
326395 , drop
327396 , dropWhile
328397 , dropWhileM
329− , deleteBy
330− , uniq
398+ -- XXX write to an array in reverse and then read in reverse
399+ -- > dropWhileEnd = reverse . dropWhile p . reverse
400+
401+ -- XXX These are available as scans in folds. We need to check the
402+ -- performance though. If these are common and we need convenient stream
403+ -- ops then we can expose these.
404+
405+ -- , deleteBy
406+ -- , uniq
407+ -- , uniqBy
331408
332− -- ** Searching
409+ -- -- ** Sampling
410+ -- , strideFromThen
411+
412+ -- -- ** Searching
333413 -- Finding the presence or location of an element, a sequence of elements
334414 -- or another stream within a stream.
335415
336416 -- -- ** Searching Elements
337− , findIndices
338− , elemIndices
417+ -- , findIndices
418+ -- , elemIndices
339419
340420 -- * Combining Two Streams
421+ -- | Note that these operations are suitable for statically fusing a few
422+ -- streams, they have a quadratic O(n^2) time complexity wrt to the number
423+ -- of streams. If you want to compose many streams dynamically using binary
424+ -- combining operations see the corresponding operations in
425+ -- "Streamly.Data.StreamK".
426+ --
427+ -- When fusing more than two streams it is more efficient if the binary
428+ -- operations are composed as a balanced tree rather than a right
429+ -- associative or left associative one e.g.:
430+ --
431+ -- >>> s1 = Stream.fromList [1,2] `Stream.append` Stream.fromList [3,4]
432+ -- >>> s2 = Stream.fromList [4,5] `Stream.append` Stream.fromList [6,7]
433+ -- >>> s = s1 `Stream.append` s2
434+
341435 -- ** Appending
436+ -- | Equivalent of Data.List append:
437+ --
438+ -- >>> (++) = Stream.append
342439 , append
343− , append2
344440
345441 -- ** Interleaving
346442 , interleave
347− -- , interleave2
348443
349444 -- ** Merging
350− -- | Merging of @n@ streams can be performed by combining the streams pair
351− -- wise using
352− -- 'Streamly.Internal.Data.Stream.IsStream.Expand.concatPairsWith' to give
353− -- O(n * log n) time complexity.
354− -- If used with 'concatMapWith' it will have O(n^2) performance.
355−
356445 , mergeBy
357446 , mergeByM
358− -- , mergeBy2
359− -- , mergeByM2
360447
361448 -- ** Zipping
362− -- | Zipping of @n@ streams can be performed by combining the streams pair
363− -- wise using
364− -- 'Streamly.Internal.Data.Stream.IsStream.Expand.concatPairsWith' with
365− -- O(n * log n) time complexity.
366− -- If used with 'concatMapWith' it will have O(n^2) performance.
449+ -- | Idioms and equivalents of Data.List APIs:
450+ --
451+ -- >>> zip = Stream.zipWith (,)
452+ -- >>> unzip = Stream.fold (Fold.unzip Fold.toList Fold.toList)
367453 , zipWith
368454 , zipWithM
369− -- , zipWith2
370− -- , zipWithM2
455+ -- XXX zipWith3,4,5,6,7
456+ -- XXX unzip3,4,5,6,7
457+ -- , ZipStream (..)
458+
459+ -- ** Cross Product
460+ -- XXX The argument order in this operation is such that it seems we are
461+ -- transforming the first stream using the second stream because the second
462+ -- stream is evaluated many times or buffered and better be finite, first
463+ -- stream could potentially be infinite. In the tradition of using the
464+ -- transformed stream at the end we can have a flipped version called
465+ -- "crossMap" or "nestWith".
466+ , crossWith
467+ -- , cross
468+ -- , joinInner
469+ -- , CrossStream (..)
371470
372471 -- * Unfold Each
373472 , unfoldMany
@@ -383,82 +482,265 @@ module Streamly.Data.Stream
383482 -- element of the input stream generates another stream and then loops over
384483 -- that inner stream as well producing effects and generating a single
385484 -- output stream.
386− -- The 'Monad' instances of different stream types provide a more
387− -- convenient way of writing nested loops. Note that the monad bind
388− -- operation is just @flip concatMap@.
389485 --
390486 -- One dimension loops are just a special case of nested loops. For
391487 -- example, 'concatMap' can degenerate to a simple map operation:
392488 --
393− -- > map f m = S.concatMap (\x -> S.fromPure (f x)) m
489+ -- >>> map f m = Stream.concatMap (\x -> Stream.fromPure (f x)) m
394490 --
395491 -- Similarly, 'concatMap' can perform filtering by mapping an element to a
396492 -- 'nil' stream:
397493 --
398− -- > filter p m = S.concatMap (\x -> if p x then S.fromPure x else S.nil) m
494+ -- >>> filter p m = Stream.concatMap (\x -> if p x then Stream.fromPure x else Stream.nil) m
495+ --
496+ -- Idioms and equivalents of Data.List APIs:
399497 --
498+ -- >>> concat = Stream.concatMap id
499+ -- >>> unlines = Stream.interposeSuffix '\n'
500+ -- >>> unlines = Stream.intercalateSuffix Unfold.fromList "\n"
501+ -- >>> unwords = Stream.interpose ' '
502+ -- >>> unwords = Stream.intercalate Unfold.fromList " "
400503
401− , concatMapWith
504+ , concatEffect
402505 , concatMap
403506 , concatMapM
404507
405508 -- * Repeated Fold
509+ -- | Idioms and equivalents of Data.List APIs:
510+ --
511+ -- >>> groupsOf n = Stream.foldMany (Fold.take n Fold.toList)
512+ -- >>> groupBy eq = Stream.groupsWhile eq Fold.toList
513+ -- >>> groupBy eq = Stream.parseMany (Parser.groupBy eq Fold.toList)
514+ -- >>> groupsByRolling eq = Stream.parseMany (Parser.groupByRolling eq Fold.toList)
515+ -- >>> groups = groupBy (==)
406516 , foldMany -- XXX Rename to foldRepeat
517+ , groupsOf
518+ , parseMany
519+
520+ -- * Splitting
521+ -- | Idioms and equivalents of Data.List APIs:
522+ --
523+ -- >>> splitWithSuffix p f = Stream.foldMany (Fold.takeEndBy p f)
524+ -- >>> splitOnSuffix p f = Stream.foldMany (Fold.takeEndBy_ p f)
525+ -- >>> lines = splitOnSuffix (== '\n')
526+ -- >>> words = Stream.wordsBy isSpace
527+ -- >>> splitAt n = Stream.fold (Fold.splitAt n Fold.toList Fold.toList)
528+ -- >>> span p = Parser.splitWith (,) (Parser.takeWhile p Fold.toList) (Parser.fromFold Fold.toList)
529+ -- >>> break p = span (not . p)
530+ , splitOn
531+ , wordsBy
407532
408533 -- * Buffered Operations
409534 -- | Operations that require buffering of the stream.
410535 -- Reverse is essentially a left fold followed by an unfold.
536+ --
537+ -- Idioms and equivalents of Data.List APIs:
538+ --
539+ -- >>> nub = Stream.fold Fold.toList . Stream.scanMaybe Fold.nub
540+ -- >>> nub = Stream.ordNub -- unreleased API
541+ -- >>> sortBy = StreamK.sortBy
542+ -- >>> sortOn f = StreamK.sortOn -- unreleased API
543+ -- >>> deleteFirstsBy = Stream.deleteFirstsBy -- unreleased
544+ -- >>> (\\) = Stream.deleteFirstsBy (==) -- unreleased
545+ -- >>> intersectBy = Stream.intersectBy -- unreleased
546+ -- >>> intersect = Stream.intersectBy (==) -- unreleased
547+ -- >>> unionBy = Stream.unionBy -- unreleased
548+ -- >>> union = Stream.unionBy (==) -- unreleased
549+ --
411550 , reverse
551+ -- XXX transpose: write the streams to arrays and then stream transposed.
552+ -- XXX subsequences
553+ -- XXX permutations
554+ -- , nub
555+ -- , ordNub
556+ -- , nubBy
412557
413558 -- * Multi-Stream folds
414559 -- | Operations that consume multiple streams at the same time.
415560 , eqBy
416561 , cmpBy
417562 , isPrefixOf
563+ , isInfixOf
564+ -- , isSuffixOf
565+ -- , isSuffixOfUnbox
418566 , isSubsequenceOf
419567
420568 -- trimming sequences
421− , stripPrefix
569+ -- , stripPrefix
570+ -- , stripSuffix
571+ -- , stripSuffixUnbox
572+
573+ -- Exceptions and resource management depend on the "exceptions" package
574+ -- XXX We can have IO Stream operations not depending on "exceptions"
575+ -- in Exception.Base
422576
423577 -- * Exceptions
424− -- | Most of these combinators inhibit stream fusion, therefore, when
578+ -- | Note that the stream exception handling routines catch and handle
579+ -- exceptions only in the stream generation steps and not in the consumer
580+ -- of the stream. For example, if we are folding or parsing a stream - any
581+ -- exceptions in the fold or parse steps won't be observed by the stream
582+ -- exception handlers. Exceptions in the fold or parse steps can be handled
583+ -- using the fold or parse exception handling routines. You can wrap the
584+ -- stream elimination function in the monad exception handler to observe
585+ -- exceptions in the stream as well as the consumer.
586+ --
587+ -- Most of these combinators inhibit stream fusion, therefore, when
425588 -- possible, they should be called in an outer loop to mitigate the cost.
426589 -- For example, instead of calling them on a stream of chars call them on a
427590 -- stream of arrays before flattening it to a stream of chars.
428591 --
429− -- See also: "Streamly.Internal.Data.Stream.Exception" for
430− -- @Pre-release@ functions.
431−
432592 , onException
433593 , handle
434594
435595 -- * Resource Management
436596 -- | 'bracket' is the most general resource management operation, all other
437− -- operations can be expressed using it.
597+ -- operations can be expressed using it. These functions have IO suffix
598+ -- because the allocation and cleanup functions are IO actions. For
599+ -- generalized allocation and cleanup functions, see the functions without
600+ -- the IO suffix in the "streamly" package.
601+ --
602+ -- Note that these operations bracket the stream generation only, they do
603+ -- not cover the stream consumer. This means if an exception occurs in
604+ -- the consumer of the stream (e.g. in a fold or parse step) then the
605+ -- exception won't be observed by the stream resource handlers, in that
606+ -- case the resource cleanup handler runs when the stream is garbage
607+ -- collected.
608+ --
609+ -- Monad level resource management can always be used around the stream
610+ -- elimination functions, such a function can observe exceptions in both
611+ -- the stream and its consumer.
438612 , before
439− , after
440− , finally
441− , bracket
613+ , afterIO
614+ , finallyIO
615+ , bracketIO
616+ , bracketIO3
442617
443− -- * Lifting Inner Monad
444− -- | See also: "Streamly.Internal.Data.Stream.Lift" for
445− -- @Pre-release@ functions.
618+ -- * Transforming Inner Monad
446619
620+ , morphInner
447621 , liftInner
448622 , runReaderT
449623 , runStateT
450624
451− -- -- * Stream Types
452− -- $serial
453− -- , Interleave
454− -- , Zip
625+ -- XXX Arrays could be different types, therefore, this should be in
626+ -- specific array module. Or maybe we should abstract over array types.
627+ -- * Stream of Arrays
628+ , Array.chunksOf
455629 )
456630where
457631
458632import Streamly.Internal.Data.Stream
459633import Prelude
460634 hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
461− foldl, map, mapM, mapM_, sequence, all, any, sum, product, elem,
462− notElem, maximum, minimum, head, last, tail, length, null,
463− reverse, iterate, init, and, or, lookup, foldr1, (!!),
464− scanl, scanl1, repeat, replicate, concatMap, span)
635+ mapM, sequence, reverse, iterate, foldr1, repeat, replicate,
636+ concatMap)
637+
638+import qualified Streamly.Internal.Data.Array.Type as Array
639+
640+#include "DocTestDataStream.hs"
641+
642+-- $overview
643+--
644+-- Streamly is a framework for modular data flow based programming and
645+-- declarative concurrency. Powerful stream fusion framework in streamly
646+-- allows high performance combinatorial programming even when using byte level
647+-- streams. Streamly API is similar to Haskell lists.
648+--
649+-- == Console Echo Example
650+--
651+-- In the following example, 'repeatM' generates an infinite stream of 'String'
652+-- by repeatedly performing the 'getLine' IO action. 'mapM' then applies
653+-- 'putStrLn' on each element in the stream converting it to stream of '()'.
654+-- Finally, 'drain' folds the stream to IO discarding the () values, thus
655+-- producing only effects.
656+--
657+-- >>> import Data.Function ((&))
658+--
659+-- >>> :{
660+-- echo =
661+-- Stream.repeatM getLine -- Stream IO String
662+-- & Stream.mapM putStrLn -- Stream IO ()
663+-- & Stream.fold Fold.drain -- IO ()
664+-- :}
665+--
666+-- This is a console echo program. It is an example of a declarative loop
667+-- written using streaming combinators. Compare it with an imperative @while@
668+-- loop.
669+--
670+-- Hopefully, this gives you an idea how we can program declaratively by
671+-- representing loops using streams. In this module, you can find all
672+-- "Data.List" like functions and many more powerful combinators to perform
673+-- common programming tasks.
674+--
675+-- == Stream Fusion
676+--
677+-- The fused 'Stream' type in this module employs stream fusion for C-like
678+-- performance when looping over data. It represents the stream as a state
679+-- machine using an explicit state, and a step function working on the state. A
680+-- typical stream operation consumes elements from the previous state machine
681+-- in a stream pipeline, transforms the elements and yields new values for the
682+-- next stage to consume. The stream operations are modular and represent a
683+-- single task, they have no knowledge of previous or next operation on the
684+-- elements.
685+--
686+-- A typical stream pipeline consists of a stream producer, several stream
687+-- transformation operations and a stream consumer. All these operations taken
688+-- together form a closed loop processing the stream elements. Elements are
689+-- transferred between stages using a boxed data constructor. However, all the
690+-- stages of the pipeline are fused together by GHC, eliminating the boxing of
691+-- intermediate constructors, and thus forming a tight C like loop without any
692+-- boxed data being used in the loop.
693+--
694+-- Stream fusion works effectively when:
695+--
696+-- * the stream pipeline is composed statically (known at compile time)
697+-- * all the operations forming the loop are inlined
698+-- * the loop is not recursively defined, recursion breaks inlining
699+--
700+-- If these conditions cannot be met, the CPS style stream type 'StreamK' may
701+-- turn out to be a better choice than the fused stream type 'Stream'.
702+--
703+-- == Stream vs StreamK
704+--
705+-- The fused stream model avoids constructor allocations and function call
706+-- overheads. However, the stream is represented as a state machine, and to
707+-- generate stream elements it has to navigate the decision tree of the state
708+-- machine. Moreover, the state machine is cranked for each element in the
709+-- stream. This performs extremely well when the number of states are limited.
710+-- The state machine starts getting expensive as the number of states increase.
711+-- For example, generating a stream from a list requires a single state and is
712+-- very efficient, even if it has millions of elements. However, using 'cons'
713+-- to construct a million element stream would be a disaster.
714+--
715+-- A typical worst case scenario for fused stream model is a large number of
716+-- `cons` or `append` operations. A few static `cons` or `append` operations
717+-- are very fast and much faster than a CPS style stream because CPS involves a
718+-- function call for each element whereas fused stream involves a few
719+-- conditional branches in the state machine. However, constructing a large
720+-- stream using `cons` introduces as many states in the state machine as the
721+-- number of elements. If we compose `cons` as a balanced binary tree it will
722+-- take @n * log n@ time to navigate the tree, and @n * n@ if it is a right
723+-- associative composition.
724+--
725+-- Operations like 'cons' or 'append'; are typically recursively called to
726+-- construct a lazy infinite stream. For such use cases the CPS style 'StreamK'
727+-- should be used. CPS streams do not have a state machine that needs to be
728+-- cranked for each element, past state has no effect on the future element
729+-- processing. However, CPS incurs a function call overhead for each element
730+-- processed, the overhead could be large compared to a fused state machine
731+-- even if it has many states. However, because of its linear performance
732+-- characterstics, after a certain threshold of stream compositions the CPS
733+-- stream would perform much better than the quadratic fused stream operations.
734+--
735+-- As a general guideline, you need to use 'StreamK' when you have to use
736+-- 'cons', 'append' or other operations having quadratic complexity at a large
737+-- scale. Typically, in such cases you need to compose the stream recursively,
738+-- by calling an operation in a loop. The decision to compose the stream is
739+-- taken at run time rather than statically at compile time.
740+--
741+-- Typically you would compose a 'StreamK' of chunks of data so that the
742+-- StreamK overhead is not high, and then process the chunks using 'Stream' by
743+-- using statically fused stream pipeline operations on the chunks.
744+--
745+-- 'Stream' and 'StreamK' types can be interconverted. See
746+-- "Streamly.Data.StreamK" module for conversion operations.
core/src/Streamly/Data/StreamK.hsnew file+194
@@ -0,0 +1,194 @@
1+{-# LANGUAGE CPP #-}
2+-- |
3+-- Module : Streamly.Data.StreamK
4+-- Copyright : (c) 2017 Composewell Technologies
5+--
6+-- License : BSD3
7+-- Maintainer : streamly@composewell.com
8+-- Stability : released
9+-- Portability : GHC
10+--
11+-- Streams represented as chains of functions calls using Continuation Passing
12+-- Style (CPS), suitable for dynamically composing potentially large number of
13+-- streams.
14+--
15+-- Unlike the statically fused operations in "Streamly.Data.Stream", StreamK
16+-- operations are less efficient, involving a function call overhead for each
17+-- element, but they exhibit linear O(n) time complexity wrt to the number of
18+-- stream compositions. Therefore, they are suitable for dynamically composing
19+-- streams e.g. appending potentially infinite streams in recursive loops.
20+-- While fused streams can be used to efficiently process elements as small as
21+-- a single byte, CPS streams are typically used on bigger chunks of data to
22+-- avoid the larger overhead per element. For more details See the @Stream vs
23+-- StreamK@ section in the "Streamly.Data.Stream" module.
24+--
25+-- In addition to the combinators in this module, you can use operations from
26+-- "Streamly.Data.Stream" for StreamK as well by converting StreamK to Stream
27+-- ('toStream'), and vice-versa ('fromStream'). Please refer to
28+-- "Streamly.Internal.Data.StreamK" for more functions that have not yet been
29+-- released.
30+--
31+-- For documentation see the corresponding combinators in
32+-- "Streamly.Data.Stream". Documentation has been omitted in this module unless
33+-- there is a difference worth mentioning or if the combinator does not exist
34+-- in "Streamly.Data.Stream".
35+
36+-- Notes:
37+--
38+-- primitive/open loop operations that can be used recursively e.g. uncons,
39+-- foldBreak, parseBreak should not be converted from StreamD for use in
40+-- StreamK, instead native StreamK impl should be used.
41+--
42+-- Closed loop operations like repeat, replicate, iterate etc can be converted
43+-- from StreamD.
44+--
45+-- In the last phase any operation like (toStreamK . f . toStreamD) should be
46+-- rewritten to a K version of f.
47+-- XXX Need to add rewrite rules for all missing StreamD operations.
48+--
49+module Streamly.Data.StreamK
50+ (
51+ -- * Setup
52+ -- | To execute the code examples provided in this module in ghci, please
53+ -- run the following commands first.
54+ --
55+ -- $setup
56+
57+ -- * Overview
58+ -- $overview
59+
60+ -- * Type
61+ StreamK
62+
63+ -- * Construction
64+ -- ** Primitives
65+ -- | Primitives to construct a stream from pure values or monadic actions.
66+ -- All other stream construction and generation combinators described later
67+ -- can be expressed in terms of these primitives. However, the special
68+ -- versions provided in this module can be much more efficient in some
69+ -- cases. Users can create custom combinators using these primitives.
70+ , nil
71+ , nilM
72+ , cons
73+ , consM
74+
75+ -- ** From Values
76+ , fromPure
77+ , fromEffect
78+
79+ -- ** From Stream
80+ -- | Please note that 'Stream' type does not observe any exceptions from
81+ -- the consumer of the stream whereas 'StreamK' does.
82+ , fromStream
83+ , toStream
84+
85+ -- ** From Containers
86+ , fromFoldable
87+
88+ -- * Elimination
89+
90+ -- ** Primitives
91+ , uncons
92+ , drain
93+
94+ -- -- ** Folding
95+ -- , foldBreak
96+
97+ -- ** Parsing
98+ , parse
99+ , parseBreak
100+ , parseBreakChunks
101+ , parseChunks
102+
103+ -- * Transformation
104+ , mapM
105+ , dropWhile
106+ , take
107+
108+ -- * Combining Two Streams
109+ -- | Unlike the operations in "Streamly.Data.Stream", these operations can
110+ -- be used to dynamically compose large number of streams e.g. using the
111+ -- 'concatMapWith' and 'mergeMapWith' operations. They have a linear O(n)
112+ -- time complexity wrt to the number of streams being composed.
113+
114+ -- ** Appending
115+ , append
116+
117+ -- ** Interleaving
118+ , interleave
119+
120+ -- ** Merging
121+ , mergeBy
122+ , mergeByM
123+
124+ -- ** Zipping
125+ , zipWith
126+ , zipWithM
127+
128+ -- ** Cross Product
129+ -- XXX is "bind/concatFor" better to have than crossWith?
130+ -- crossWith f xs1 xs2 = concatFor xs1 (\x -> fmap (f x) xs2)
131+ , crossWith
132+ -- , cross
133+ -- , joinInner
134+ -- , CrossStreamK (..)
135+
136+ -- * Stream of streams
137+ -- | Some useful idioms:
138+ --
139+ -- >>> concatFoldableWith f = Prelude.foldr f StreamK.nil
140+ -- >>> concatMapFoldableWith f g = Prelude.foldr (f . g) StreamK.nil
141+ -- >>> concatForFoldableWith f xs g = Prelude.foldr (f . g) StreamK.nil xs
142+ --
143+ , concatEffect
144+ -- , concatMap
145+ , concatMapWith
146+ , mergeMapWith
147+
148+ -- * Buffered Operations
149+ , reverse
150+ , sortBy
151+
152+ -- * Exceptions
153+ -- | Please note that 'Stream' type does not observe any exceptions from
154+ -- the consumer of the stream whereas 'StreamK' does.
155+ , handle
156+
157+ -- * Resource Management
158+ -- | Please note that 'Stream' type does not observe any exceptions from
159+ -- the consumer of the stream whereas 'StreamK' does.
160+ , bracketIO
161+ )
162+where
163+
164+import Streamly.Internal.Data.StreamK
165+import Prelude hiding (reverse, zipWith, mapM, dropWhile, take)
166+
167+#include "DocTestDataStreamK.hs"
168+
169+-- $overview
170+--
171+-- Continuation passing style (CPS) stream implementation. The 'K' in 'StreamK'
172+-- stands for Kontinuation.
173+--
174+-- StreamK can be constructed like lists, except that they use 'nil' instead of
175+-- '[]' and 'cons' instead of ':'.
176+--
177+-- `cons` adds a pure value at the head of the stream:
178+--
179+-- >>> import Streamly.Data.StreamK (StreamK, cons, consM, nil)
180+-- >>> stream = 1 `cons` 2 `cons` nil :: StreamK IO Int
181+--
182+-- You can use operations from "Streamly.Data.Stream" for StreamK as well by
183+-- converting StreamK to Stream ('toStream'), and vice-versa ('fromStream').
184+--
185+-- >>> Stream.fold Fold.toList $ StreamK.toStream stream -- IO [Int]
186+-- [1,2]
187+--
188+-- `consM` adds an effect at the head of the stream:
189+--
190+-- >>> stream = effect 1 `consM` effect 2 `consM` nil
191+-- >>> Stream.fold Fold.toList $ StreamK.toStream stream
192+-- 1
193+-- 2
194+-- [1,2]
core/src/Streamly/Data/Unbox.hsdeleted−28
@@ -1,28 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Unbox
3−-- Copyright : (c) 2022 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−-- Stability : released
8−-- Portability : GHC
9−--
10−-- This module provides the 'Unbox' type class for converting Haskell values to
11−-- unboxed representation in a 'MutableByteArray' and boxing values from
12−-- 'MutableByteArray' to create Haskell representation.
13−--
14−
15−module Streamly.Data.Unbox
16− (
17− Unbox(..)
18− , MutableByteArray(..)
19− )
20−where
21−
22−import Streamly.Internal.Data.Unboxed (Unbox(..), MutableByteArray(..))
23−
24−-- $setup
25−-- >>> :m
26−-- >>> :set -XFlexibleContexts
27−-- >>> :set -package streamly
28−-- >>> import Streamly.Internal.Data.Unboxed (Unbox(..), MutableByteArray(..))
core/src/Streamly/Data/Unfold.hs+98−80
@@ -1,4 +1,4 @@
1−#include "inline.hs"
1+{-# LANGUAGE CPP #-}
22
33-- |
44-- Module : Streamly.Data.Unfold
@@ -8,13 +8,104 @@
88-- Stability : released
99-- Portability : GHC
1010--
11+-- Fast, composable stream producers with ability to terminate, supporting
12+-- nested stream fusion. Nested stream operations like
13+-- 'Streamly.Data.Stream.concatMap' in the "Streamly.Data.Stream" module do not
14+-- fuse, however, the 'Streamly.Data.Stream.unfoldMany' operation, using the
15+-- 'Unfold' type, is a fully fusible alternative to
16+-- 'Streamly.Data.Stream.concatMap'.
17+--
18+-- Please refer to "Streamly.Internal.Data.Unfold" for more functions that have
19+-- not yet been released.
20+--
21+-- Exception combinators are not exposed, we would like to encourage the use of
22+-- 'Stream' type instead whenever exception handling is required. We can
23+-- consider exposing the unfold exception functions if there is a compelling
24+-- use case to use unfolds instead of stream.
25+
26+module Streamly.Data.Unfold
27+ (
28+ -- * Setup
29+ -- | To execute the code examples provided in this module in ghci, please
30+ -- run the following commands first.
31+ --
32+ -- $setup
33+
34+ -- * Overview
35+ -- $overview
36+
37+ -- * Unfold Type
38+ Unfold
39+
40+ -- * Unfolds
41+ -- One to one correspondence with
42+ -- "Streamly.Internal.Data.Stream.Generate"
43+
44+ -- ** Basic Constructors
45+ , unfoldrM
46+ , unfoldr
47+ , function
48+ , functionM
49+
50+ -- ** Generators
51+ -- | Generate a monadic stream from a seed.
52+ , repeatM
53+ , replicateM
54+ , iterateM
55+
56+ -- ** Enumeration
57+ , Enumerable (..)
58+
59+ -- ** From Containers
60+ , fromList
61+ , fromListM
62+ , fromStream
63+
64+ -- * Combinators
65+ -- ** Mapping on Input
66+ , lmap
67+ , lmapM
68+ , first
69+ , second
70+
71+ -- ** Mapping on Output
72+ , mapM
73+
74+ -- ** Filtering
75+ , takeWhileM
76+ , takeWhile
77+ , take
78+ , filter
79+ , filterM
80+ , drop
81+ , dropWhile
82+ , dropWhileM
83+
84+ -- ** Zipping
85+ , zipWith
86+
87+ -- ** Cross Product
88+ , crossWith
89+
90+ -- ** Nesting
91+ , many
92+
93+ )
94+where
95+
96+import Prelude hiding
97+ ( concat, map, mapM, takeWhile, take, filter, const, drop, dropWhile
98+ , zipWith
99+ )
100+import Streamly.Internal.Data.Unfold
101+
102+#include "DocTestDataUnfold.hs"
103+
104+-- $overview
105+--
11106-- An 'Unfold' is a source or a producer of a stream of values. It takes a
12107-- seed value as an input and unfolds it into a sequence of values.
13108--
14−-- >>> import qualified Streamly.Data.Fold as Fold
15−-- >>> import qualified Streamly.Data.Unfold as Unfold
16−-- >>> import qualified Streamly.Internal.Data.Stream as Stream
17−--
18109-- For example, the 'fromList' Unfold generates a stream of values from a
19110-- supplied list. Unfolds can be converted to 'Streamly.Internal.Data.Stream'
20111-- using the 'Stream.unfold' operation.
@@ -58,7 +149,7 @@
58149-- Please see "Streamly.Internal.Data.Unfold" for additional @Pre-release@
59150-- functions.
60151--
61−-- = Creating New Unfolds
152+-- == Creating New Unfolds
62153--
63154-- There are many commonly used unfolds provided in this module. However, you
64155-- can always create your own as well. An 'Unfold' is just a data
@@ -95,7 +186,7 @@
95186-- >>> Data.List.unfoldr f [1,2,3]
96187-- [1,2,3]
97188--
98−-- = Unfolds vs. Streams
189+-- == Unfolds vs. Streams
99190--
100191-- The 'Unfold' abstraction for representing streams was introduced in Streamly
101192-- to provide C like performance for nested looping of streams. 'Unfold' and
@@ -140,76 +231,3 @@
140231-- streams are written, it is easy to adapt a stream to an unfold. If you are
141232-- writing an unfold you can convert it to stream for free using
142233-- 'Stream.unfold'.
143−
144−-- What makes streams less efficient is also what makes them more conveient to
145−-- use and powerful. The stream data type (Stream m a) bundles the state along
146−-- with the stream generator function making it opaque, whereas an unfold
147−-- exposes the state (Unfold m s a) to the user. This allows the Unfold to be
148−-- unfolded (inlined) inside a nested loop without having to bundle the state
149−-- and the generator together, the stream state can be saved and passed
150−-- independent of the generator function. On the other hand in a stream type we
151−-- have to bundle the stream state and the generator function together to save
152−-- the stream. This makes it inefficient because it requires boxing and
153−-- constructor allocation. However, this makes streams more convenient as we do
154−-- not need to pass around the state/seed separately.
155−--
156−module Streamly.Data.Unfold
157− (
158− -- * Unfold Type
159− Unfold
160−
161− -- * Unfolds
162− -- One to one correspondence with
163− -- "Streamly.Internal.Data.Stream.Generate"
164−
165− -- ** Basic Constructors
166− , unfoldrM
167− , unfoldr
168− , function
169− , functionM
170−
171− -- ** Generators
172− -- | Generate a monadic stream from a seed.
173− , repeatM
174− , replicateM
175− , iterateM
176−
177− -- ** From Containers
178− , fromList
179− , fromListM
180− , fromStream
181−
182− -- * Combinators
183− -- ** Mapping on Input
184− , lmap
185− , lmapM
186−
187− -- ** Mapping on Output
188− , mapM
189−
190− -- ** Filtering
191− , takeWhileM
192− , takeWhile
193− , take
194− , filter
195− , filterM
196− , drop
197− , dropWhile
198− , dropWhileM
199−
200− -- ** Zipping
201− , zipWith
202−
203− -- ** Cross Product
204− , crossWith
205−
206− -- ** Nesting
207− , many
208− )
209−where
210−
211−import Prelude hiding
212− ( concat, map, mapM, takeWhile, take, filter, const, drop, dropWhile
213− , zipWith
214− )
215−import Streamly.Internal.Data.Unfold
core/src/Streamly/FileSystem/Dir.hsnew file+23
@@ -0,0 +1,23 @@
1+-- |
2+-- Module : Streamly.FileSystem.Dir
3+-- Copyright : (c) 2018 Composewell Technologies
4+--
5+-- License : BSD3
6+-- Maintainer : streamly@composewell.com
7+-- Stability : pre-release
8+-- Portability : GHC
9+--
10+-- Warning\: The API of this module is subject to change in future releases.
11+-- Especially the type for representing paths may change from 'FilePath' to
12+-- something else.
13+
14+module Streamly.FileSystem.Dir
15+ (
16+ -- * Streams
17+ read
18+ , readEither
19+ )
20+where
21+
22+import Streamly.Internal.FileSystem.Dir
23+import Prelude hiding (read)
core/src/Streamly/FileSystem/File.hsnew file+60
@@ -0,0 +1,60 @@
1+-- |
2+-- Module : Streamly.FileSystem.File
3+-- Copyright : (c) 2019 Composewell Technologies
4+--
5+-- License : BSD3
6+-- Maintainer : streamly@composewell.com
7+-- Stability : pre-release
8+-- Portability : GHC
9+--
10+-- Warning\: The API of this module is subject to change in future releases.
11+-- Especially the type for representing paths may change from 'FilePath' to
12+-- something else.
13+--
14+-- Read and write streams and arrays to and from files specified by their paths
15+-- in the file system. Unlike the handle based APIs which can have a read/write
16+-- session consisting of multiple reads and writes to the handle, these APIs
17+-- are one shot read or write APIs. These APIs open the file handle, perform
18+-- the requested operation and close the handle. These are safer compared to
19+-- the handle based APIs as there is no possibility of a file descriptor
20+-- leakage.
21+--
22+-- >>> import qualified Streamly.FileSystem.File as File
23+--
24+module Streamly.FileSystem.File
25+ (
26+ -- * Streaming IO
27+ -- | Stream data to or from a file or device sequentially. When reading,
28+ -- the stream is lazy and generated on-demand as the consumer consumes it.
29+ -- Read IO requests to the IO device are performed in chunks limited to a
30+ -- maximum size of 32KiB, this is referred to as @defaultChunkSize@ in the
31+ -- documentation. One IO request may or may not read the full
32+ -- chunk. If the whole stream is not consumed, it is possible that we may
33+ -- read slightly more from the IO device than what the consumer needed.
34+ -- Unless specified otherwise in the API, writes are collected into chunks
35+ -- of @defaultChunkSize@ before they are written to the IO device.
36+
37+ -- Streaming APIs work for all kind of devices, seekable or non-seekable;
38+ -- including disks, files, memory devices, terminals, pipes, sockets and
39+ -- fifos. While random access APIs work only for files or devices that have
40+ -- random access or seek capability for example disks, memory devices.
41+ -- Devices like terminals, pipes, sockets and fifos do not have random
42+ -- access capability.
43+
44+ -- ** File IO Using Handle
45+ withFile
46+
47+ -- ** Streams
48+ , read
49+ , readChunksWith
50+ , readChunks
51+
52+ -- ** Folds
53+ , write
54+ , writeWith
55+ , writeChunks
56+ )
57+where
58+
59+import Streamly.Internal.FileSystem.File
60+import Prelude hiding (read)
src/Streamly/FileSystem/Handle.hs → core/src/Streamly/FileSystem/Handle.hsrenamed+26−11
@@ -1,4 +1,4 @@
1−#include "inline.hs"
1+{-# LANGUAGE CPP #-}
22
33-- |
44-- Module : Streamly.FileSystem.Handle
@@ -15,15 +15,15 @@
1515-- ('Handle').
1616--
1717-- The 'TextEncoding', 'NewLineMode', and 'Buffering' options of the underlying
18−-- GHC 'Handle' are ignored by these APIs. Please use @Streamly.Unicode.*@
19−-- modules for encoding and decoding a byte stream, use stream splitting
20−-- operations in "Streamly.Prelude" to create a stream of lines or to split the
21−-- input stream on any other type of boundaries.
18+-- GHC 'Handle' are ignored by these APIs. Please use "Streamly.Unicode.Stream"
19+-- module for encoding and decoding a byte stream, use stream splitting
20+-- operations in "Streamly.Data.Stream" to create a stream of lines or to split
21+-- the input stream on any other type of boundaries.
2222--
2323-- To set the read or write start position use 'hSeek' on the 'Handle', the
24−-- 'Streamly.Prelude.before' combinator may be used to do that on a streaming
25−-- combinator. To restrict the length of read or write use the stream trimming
26−-- operations like 'Streamly.Prelude.take'.
24+-- 'Streamly.Data.Stream.before' combinator may be used to do that on a
25+-- streaming combinator. To restrict the length of read or write use the stream
26+-- trimming operations like 'Streamly.Data.Stream.take'.
2727--
2828-- Note that a 'Handle' is inherently stateful, therefore, we cannot use these
2929-- APIs from multiple threads without serialization; reading or writing in one
@@ -35,11 +35,17 @@
3535-- Design notes:
3636--
3737-- By design, file handle IO APIs are quite similar to
38−-- "Streamly.Data.Array.Foreign" read write APIs. In that regard, arrays can be
38+-- "Streamly.Data.Array" read write APIs. In that regard, arrays can be
3939-- considered as in-memory files or files can be considered as on-disk arrays.
4040--
4141module Streamly.FileSystem.Handle
4242 (
43+ -- * Setup
44+ -- | To execute the code examples provided in this module in ghci, please
45+ -- run the following commands first.
46+ --
47+ -- $setup
48+
4349 -- * Singleton IO
4450 -- | Read or write a single buffer.
4551 getChunk
@@ -75,12 +81,19 @@ module Streamly.FileSystem.Handle
7581 -- position of the file handle. The stream ends as soon as EOF is
7682 -- encountered.
7783
84+ -- *** Streams
7885 , read
7986 , readWith
8087 , readChunks
8188 , readChunksWith
8289
83− -- ** Writing
90+ -- *** Unfolds
91+ , reader
92+ , readerWith
93+ , chunkReader
94+ , chunkReaderWith
95+
96+ -- ** Folds
8497 -- | 'TextEncoding', 'NewLineMode', and 'Buffering' options of the
8598 -- underlying handle are ignored. The write occurs from the current seek
8699 -- position of the file handle. The write behavior depends on the 'IOMode'
@@ -91,8 +104,8 @@ module Streamly.FileSystem.Handle
91104 , writeChunks
92105
93106 -- * Deprecated
94− , readChunksWithBufferOf
95107 , readWithBufferOf
108+ , readChunksWithBufferOf
96109 , writeChunksWithBufferOf
97110 , writeWithBufferOf
98111 )
@@ -100,3 +113,5 @@ where
100113
101114import Streamly.Internal.FileSystem.Handle
102115import Prelude hiding (read)
116+
117+#include "DocTestFileSystemHandle.hs"
src/Streamly/Internal/Console/Stdio.hs → core/src/Streamly/Internal/Console/Stdio.hsrenamed+37−38
@@ -9,25 +9,29 @@
99
1010module Streamly.Internal.Console.Stdio
1111 (
12− -- * Read
12+ -- * Streams
1313 read
14− , getBytes
15− , getChars
14+ , readChars
1615 , readChunks
17− , getChunks
1816 -- , getChunksLn
1917 -- , getStringsWith -- get strings using the supplied decoding
2018 -- , getStrings -- get strings of complete chars,
2119 -- leave any partial chars for next string
2220 -- , getStringsLn -- get lines decoded as char strings
2321
24− -- * Write
22+ -- * Unfolds
23+ , reader
24+ , chunkReader
25+
26+ -- * Folds
2527 , write
28+ , writeChunks
2629 , writeErr
30+ , writeErrChunks
31+
32+ -- * Stream writes
2733 , putBytes -- Buffered (32K)
2834 , putChars
29− , writeChunks
30− , writeErrChunks
3135 , putChunks -- Unbuffered
3236 , putStringsWith
3337 , putStrings
@@ -42,14 +46,15 @@ import Data.Word (Word8)
4246import System.IO (stdin, stdout, stderr)
4347import Prelude hiding (read)
4448
45−import Streamly.Internal.Data.Array.Unboxed.Type (Array(..))
49+import Streamly.Internal.Data.Array.Type (Array(..))
4650import Streamly.Internal.Data.Stream (Stream)
4751import Streamly.Internal.Data.Unfold (Unfold)
4852import Streamly.Internal.Data.Fold (Fold)
4953
50−import qualified Streamly.Data.Array.Unboxed as Array (fromList)
51−import qualified Streamly.Data.Unfold as Unfold (lmap)
52−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
54+import qualified Streamly.Internal.Data.Array as Array
55+import qualified Streamly.Internal.Data.Stream as Stream
56+ (intersperseMSuffix)
57+import qualified Streamly.Internal.Data.Unfold as Unfold
5358import qualified Streamly.Internal.FileSystem.Handle as Handle
5459import qualified Streamly.Internal.Unicode.Stream as Unicode
5560
@@ -59,51 +64,49 @@ import qualified Streamly.Internal.Unicode.Stream as Unicode
5964
6065-- | Unfold standard input into a stream of 'Word8'.
6166--
62−-- @since 0.8.0
63−{-# INLINE read #-}
64−read :: MonadIO m => Unfold m () Word8
65−read = Unfold.lmap (\() -> stdin) Handle.read
67+{-# INLINE reader #-}
68+reader :: MonadIO m => Unfold m () Word8
69+reader = Unfold.lmap (\() -> stdin) Handle.reader
6670
6771-- | Read a byte stream from standard input.
6872--
69−-- > getBytes = Handle.getBytes stdin
70−-- > getBytes = Stream.unfold Stdio.read ()
73+-- > read = Handle.read stdin
74+-- > read = Stream.unfold Stdio.reader ()
7175--
7276-- /Pre-release/
7377--
74−{-# INLINE getBytes #-}
75−getBytes :: MonadIO m => Stream m Word8
76−getBytes = Handle.getBytes stdin
78+{-# INLINE read #-}
79+read :: MonadIO m => Stream m Word8
80+read = Handle.read stdin
7781
7882-- | Read a character stream from Utf8 encoded standard input.
7983--
80−-- > getChars = Unicode.decodeUtf8 Stdio.getBytes
84+-- > readChars = Unicode.decodeUtf8 Stdio.read
8185--
8286-- /Pre-release/
8387--
84−{-# INLINE getChars #-}
85−getChars :: MonadIO m => Stream m Char
86−getChars = Unicode.decodeUtf8 getBytes
88+{-# INLINE readChars #-}
89+readChars :: MonadIO m => Stream m Char
90+readChars = Unicode.decodeUtf8 read
8791
8892-- | Unfolds standard input into a stream of 'Word8' arrays.
8993--
90−-- @since 0.8.0
91−{-# INLINE readChunks #-}
92−readChunks :: MonadIO m => Unfold m () (Array Word8)
93−readChunks = Unfold.lmap (\() -> stdin) Handle.readChunks
94+{-# INLINE chunkReader #-}
95+chunkReader :: MonadIO m => Unfold m () (Array Word8)
96+chunkReader = Unfold.lmap (\() -> stdin) Handle.chunkReader
9497
9598-- | Read a stream of chunks from standard input. The maximum size of a single
9699-- chunk is limited to @defaultChunkSize@. The actual size read may be less
97100-- than @defaultChunkSize@.
98101--
99−-- > getChunks = Handle.getChunks stdin
100−-- > getChunks = Stream.unfold Stdio.readChunks ()
102+-- > readChunks = Handle.readChunks stdin
103+-- > readChunks = Stream.unfold Stdio.chunkReader ()
101104--
102105-- /Pre-release/
103106--
104−{-# INLINE getChunks #-}
105−getChunks :: MonadIO m => Stream m (Array Word8)
106−getChunks = Handle.getChunks stdin
107+{-# INLINE readChunks #-}
108+readChunks :: MonadIO m => Stream m (Array Word8)
109+readChunks = Handle.readChunks stdin
107110
108111{-
109112-- | Read UTF8 encoded lines from standard input.
@@ -129,14 +132,12 @@ getChunksLn = (Stream.splitWithSuffix (== '\n') f) getChars
129132
130133-- | Fold a stream of 'Word8' to standard output.
131134--
132−-- @since 0.8.0
133135{-# INLINE write #-}
134136write :: MonadIO m => Fold m Word8 ()
135137write = Handle.write stdout
136138
137139-- | Fold a stream of 'Word8' to standard error.
138140--
139−-- @since 0.8.0
140141{-# INLINE writeErr #-}
141142writeErr :: MonadIO m => Fold m Word8 ()
142143writeErr = Handle.write stderr
@@ -164,14 +165,12 @@ putChars = putBytes . Unicode.encodeUtf8
164165
165166-- | Fold a stream of @Array Word8@ to standard output.
166167--
167−-- @since 0.8.0
168168{-# INLINE writeChunks #-}
169169writeChunks :: MonadIO m => Fold m (Array Word8) ()
170170writeChunks = Handle.writeChunks stdout
171171
172172-- | Fold a stream of @Array Word8@ to standard error.
173173--
174−-- @since 0.8.0
175174{-# INLINE writeErrChunks #-}
176175writeErrChunks :: MonadIO m => Fold m (Array Word8) ()
177176writeErrChunks = Handle.writeChunks stderr
@@ -225,5 +224,5 @@ putStrings = putStringsWith Unicode.encodeUtf8
225224putStringsLn :: MonadIO m => Stream m String -> m ()
226225putStringsLn =
227226 putChunks
228− . Stream.intersperseSuffix (return $ Array.fromList [10])
227+ . Stream.intersperseMSuffix (return $ Array.fromList [10])
229228 . Unicode.encodeStrings Unicode.encodeUtf8
core/src/Streamly/Internal/Data/Array.hs+936−295
@@ -1,377 +1,1018 @@
1−{-# OPTIONS_GHC -fno-warn-orphans #-}
2−
3−#include "inline.hs"
4−
1+{-# LANGUAGE CPP #-}
52-- |
63-- Module : Streamly.Internal.Data.Array
74-- Copyright : (c) 2019 Composewell Technologies
8−--
9−-- License : BSD-3-Clause
5+-- License : BSD3
106-- Maintainer : streamly@composewell.com
11−-- Stability : pre-release
7+-- Stability : experimental
128-- Portability : GHC
139--
1410module Streamly.Internal.Data.Array
15− ( Array(..)
11+ (
12+ -- * Setup
13+ -- $setup
1614
17− -- * Construction
18− , nil
19− , writeN
20− , write
21− , writeLastN
22−
23− , fromStreamDN
24− , fromStreamD
25− , fromStreamN
26− , fromStream
15+ -- * Design Notes
16+ -- $design
2717
28− , fromListN
29− , fromList
18+ -- * The Array Type
19+ module Streamly.Internal.Data.Array.Type
3020
31− -- * Elimination
32− , length
33− , read
34−
35− , toList
36− , toStreamD
37− , toStreamDRev
38− , toStream
39− , toStreamRev
21+ -- * Construction
22+ -- Monadic Folds
23+ , writeLastN
4024
41− , foldl'
42− , foldr
25+ -- * Random Access
26+ -- , (!!)
27+ , getIndex
28+ , getIndexRev
29+ , last -- XXX getLastIndex?
30+ -- , getIndicesFrom -- read from a given position to the end of file
31+ -- , getIndicesUpto -- read from beginning up to the given position
32+ -- , getIndicesFromTo
33+ -- , getIndicesFromRev -- read from a given position to the beginning of file
34+ -- , getIndicesUptoRev -- read from end to the given position in file
35+ , indexReader
36+ , indexReaderFromThenTo
37+
38+ -- * Size
39+ , null
40+
41+ -- * Search
42+ , binarySearch
43+ , findIndicesOf
44+ -- getIndicesOf
45+ , indexFinder -- see splitOn
46+ -- , findIndexOf
47+ -- , find
48+
49+ -- * Casting
50+ , cast
51+ , asBytes
52+ , castUnsafe
53+ , asCStringUnsafe
54+
55+ -- * Subarrays
56+ , getSliceUnsafe
57+ -- , getSlice
58+ , sliceIndexerFromLen
59+ , slicerFromLen
60+ , splitOn
61+
62+ -- * Streaming Operations
63+ , streamTransform
64+
65+ -- * Folding
4366 , streamFold
4467 , fold
4568
46− -- * Random Access
47− , getIndexUnsafe
48− , strip
49− , putIndices
69+ -- * Stream of Arrays
70+
71+ -- XXX these are probably not very useful to have in this module as we can
72+ -- express these idiomatically using streams.
73+ , interpose
74+ , interposeSuffix
75+ , intercalateSuffix
76+
77+ , compactLE
78+ , pinnedCompactLE
79+ , compactOnByte
80+ , compactOnByteSuffix
81+
82+ , foldBreakChunks
83+ , foldChunks
84+ , foldBreakChunksK
85+ , parseBreakChunksK
86+
87+ -- * Serialization
88+ , encodeAs
89+ , serialize
90+ , pinnedSerialize
91+ , deserialize
92+
93+ -- * Deprecated
94+ , genSlicesFromLen
95+ , getSlicesFromLen
96+ , getIndices
5097 )
5198where
5299
53−import Control.DeepSeq (NFData(..))
54−import Control.Monad (when, replicateM)
55−import Control.Monad.IO.Class (liftIO, MonadIO)
56−import GHC.Base (MutableArray#, RealWorld)
57−import GHC.IO (unsafePerformIO)
58−import Text.Read (readPrec)
59−
100+#include "assert.hs"
101+#include "inline.hs"
102+#include "ArrayMacros.h"
103+
104+import Control.Monad.IO.Class (MonadIO(..))
105+-- import Data.Bifunctor (first)
106+-- import Data.Either (fromRight)
107+import Data.Functor.Identity (Identity)
108+import Data.Proxy (Proxy(..))
109+import Data.Word (Word8)
110+import Foreign.C.String (CString)
111+import Foreign.Ptr (castPtr)
112+import Foreign.Storable (Storable)
113+import GHC.Types (SPEC(..))
114+import Streamly.Internal.Data.Unbox (Unbox(..))
115+import Prelude hiding (length, null, last, map, (!!), read, concat)
116+
117+import Streamly.Internal.Data.MutByteArray.Type (PinnedState(..), MutByteArray)
118+import Streamly.Internal.Data.Serialize.Type (Serialize)
60119import Streamly.Internal.Data.Fold.Type (Fold(..))
61−import Streamly.Internal.Data.Stream.Type (Stream)
62−import Streamly.Internal.Data.Tuple.Strict (Tuple'(..), Tuple3'(..))
120+import Streamly.Internal.Data.Parser (Parser(..), Initial(..), ParseError(..))
121+import Streamly.Internal.Data.Stream (Stream(..))
122+import Streamly.Internal.Data.StreamK (StreamK)
123+import Streamly.Internal.Data.SVar.Type (adaptState, defState)
124+import Streamly.Internal.Data.Tuple.Strict (Tuple'(..), Tuple3Fused'(..))
63125import Streamly.Internal.Data.Unfold.Type (Unfold(..))
126+import Streamly.Internal.System.IO (unsafeInlineIO)
64127
65−import qualified Streamly.Internal.Data.Array.Mut.Type as MArray
66−import qualified Streamly.Internal.Data.Fold.Type as FL
128+import qualified Streamly.Internal.Data.Fold.Type as Fold
129+import qualified Streamly.Internal.Data.Serialize.Type as Serialize
130+import qualified Streamly.Internal.Data.MutByteArray.Type as MBA
131+import qualified Streamly.Internal.Data.MutArray as MA
132+import qualified Streamly.Internal.Data.Fold as FL
67133import qualified Streamly.Internal.Data.Ring as RB
68−import qualified Streamly.Internal.Data.Stream.StreamD as D
69−import qualified Streamly.Internal.Data.Stream.Type as Stream
134+import qualified Streamly.Internal.Data.Parser as Parser
135+-- import qualified Streamly.Internal.Data.ParserK as ParserK
136+import qualified Streamly.Internal.Data.Stream as D
137+import qualified Streamly.Internal.Data.Stream as Stream
138+import qualified Streamly.Internal.Data.StreamK as StreamK
70139import qualified Streamly.Internal.Data.Unfold as Unfold
71−import qualified Text.ParserCombinators.ReadPrec as ReadPrec
140+import qualified Prelude
72141
73−import Data.IORef
74−import Prelude hiding (foldr, length, read)
142+import Streamly.Internal.Data.Array.Type
143+
144+#include "DocTestDataArray.hs"
145+
146+-- $design
147+--
148+-- To summarize:
149+--
150+-- * Arrays are finite and fixed in size
151+-- * provide /O(1)/ access to elements
152+-- * store only data and not functions
153+-- * provide efficient IO interfacing
154+--
155+-- 'Foldable' instance is not provided because the implementation would be much
156+-- less efficient compared to folding via streams. 'Semigroup' and 'Monoid'
157+-- instances should be used with care; concatenating arrays using binary
158+-- operations can be highly inefficient. Instead, use
159+-- 'Streamly.Internal.Data.Stream.Chunked.toArray' to concatenate N
160+-- arrays at once.
161+--
162+-- Each array is one pointer visible to the GC. Too many small arrays (e.g.
163+-- single byte) are only as good as holding those elements in a Haskell list.
164+-- However, small arrays can be compacted into large ones to reduce the
165+-- overhead. To hold 32GB memory in 32k sized buffers we need 1 million arrays
166+-- if we use one array for each chunk. This is still significant to add
167+-- pressure to GC.
168+
169+-------------------------------------------------------------------------------
170+-- Elimination
171+-------------------------------------------------------------------------------
172+
173+-- |
174+--
175+-- >>> null arr = Array.byteLength arr == 0
176+--
177+-- /Pre-release/
178+{-# INLINE null #-}
179+null :: Array a -> Bool
180+null arr = byteLength arr == 0
181+
182+-- | Like 'getIndex' but indexes the array in reverse from the end.
183+--
184+-- /Pre-release/
185+{-# INLINE getIndexRev #-}
186+getIndexRev :: forall a. Unbox a => Int -> Array a -> Maybe a
187+getIndexRev i arr =
188+ unsafeInlineIO
189+ $ do
190+ let elemPtr = RINDEX_OF(arrEnd arr, i, a)
191+ if i >= 0 && elemPtr >= arrStart arr
192+ then Just <$> peekAt elemPtr (arrContents arr)
193+ else return Nothing
194+
195+-- |
196+--
197+-- >>> last arr = Array.getIndexRev arr 0
198+--
199+-- /Pre-release/
200+{-# INLINE last #-}
201+last :: Unbox a => Array a -> Maybe a
202+last = getIndexRev 0
75203
76204-------------------------------------------------------------------------------
77−-- Array Data Type
205+-- Folds with Array as the container
78206-------------------------------------------------------------------------------
79207
80−data Array a =
81− Array
82− { arrContents# :: MutableArray# RealWorld a
83− -- ^ The internal contents of the array representing the entire array.
208+-- XXX We should generate this from Ring.
84209
85− , arrStart :: {-# UNPACK #-}!Int
86− -- ^ The starting index of this slice.
210+-- | @writeLastN n@ folds a maximum of @n@ elements from the end of the input
211+-- stream to an 'Array'.
212+--
213+{-# INLINE writeLastN #-}
214+writeLastN ::
215+ (Storable a, Unbox a, MonadIO m) => Int -> Fold m a (Array a)
216+writeLastN n
217+ | n <= 0 = fmap (const mempty) FL.drain
218+ | otherwise = unsafeFreeze <$> Fold step initial done done
87219
88− , arrLen :: {-# UNPACK #-}!Int
89− -- ^ The length of this slice.
90− }
220+ where
91221
92−unsafeFreeze :: MArray.Array a -> Array a
93−unsafeFreeze (MArray.Array cont# arrS arrL _) = Array cont# arrS arrL
222+ step (Tuple3Fused' rb rh i) a = do
223+ rh1 <- liftIO $ RB.unsafeInsert rb rh a
224+ return $ FL.Partial $ Tuple3Fused' rb rh1 (i + 1)
94225
95−unsafeThaw :: Array a -> MArray.Array a
96−unsafeThaw (Array cont# arrS arrL) = MArray.Array cont# arrS arrL arrL
226+ initial =
227+ let f (a, b) = FL.Partial $ Tuple3Fused' a b (0 :: Int)
228+ in fmap f $ liftIO $ RB.new n
97229
98−{-# NOINLINE nil #-}
99−nil :: Array a
100−nil = unsafePerformIO $ do
101− marr <- MArray.newArray 0
102− return $ unsafeFreeze marr
230+ done (Tuple3Fused' rb rh i) = do
231+ arr <- MA.new n
232+ -- XXX We should write a read unfold for ring.
233+ foldFunc i rh MA.snocUnsafe arr rb
234+
235+ foldFunc i
236+ | i < n = RB.unsafeFoldRingM
237+ | otherwise = RB.unsafeFoldRingFullM
103238
104239-------------------------------------------------------------------------------
105−-- Construction - Folds
240+-- Random Access
106241-------------------------------------------------------------------------------
107242
108−{-# INLINE_NORMAL writeN #-}
109−writeN :: MonadIO m => Int -> Fold m a (Array a)
110−writeN = fmap unsafeFreeze <$> MArray.writeN
111−
112−{-# INLINE_NORMAL write #-}
113−write :: MonadIO m => Fold m a (Array a)
114−write = Fold step initial extract
115− where
116− initial = do
117− marr <- liftIO $ MArray.newArray 0
118− return $ FL.Partial (Tuple3' marr 0 0)
119− step (Tuple3' marr i capacity) x
120− | i == capacity =
121− let newCapacity = max (capacity * 2) 1
122− in do newMarr <- liftIO $ MArray.realloc newCapacity marr
123− marr1 <- liftIO $ MArray.snocUnsafe newMarr x
124− return $ FL.Partial $ Tuple3' marr1 (i + 1) newCapacity
125− | otherwise = do
126− marr1 <- liftIO $ MArray.snocUnsafe marr x
127− return $ FL.Partial $ Tuple3' marr1 (i + 1) capacity
128− extract (Tuple3' marr _ _) =
129− return $ unsafeFreeze marr
130−
131243-------------------------------------------------------------------------------
132−-- Construction - from streams
244+-- Searching
133245-------------------------------------------------------------------------------
134246
135−{-# INLINE_NORMAL fromStreamDN #-}
136−fromStreamDN :: MonadIO m => Int -> D.Stream m a -> m (Array a)
137−fromStreamDN limit str = do
138− marr <- liftIO $ MArray.newArray (max limit 0)
139− i <-
140− D.foldlM'
141− (\i x -> i `seq` liftIO $ MArray.putIndexUnsafe marr i x >> return (i + 1))
142− (return 0) $
143− D.take limit str
144− return $ unsafeFreeze $ marr { MArray.arrLen = i }
145−
146−{-# INLINE fromStreamD #-}
147−fromStreamD :: MonadIO m => D.Stream m a -> m (Array a)
148−fromStreamD = D.fold write
149−
150−{-# INLINE fromStreamN #-}
151−fromStreamN :: MonadIO m => Int -> Stream m a -> m (Array a)
152−fromStreamN n m = do
153− when (n < 0) $ error "fromStreamN: negative write count specified"
154− fromStreamDN n $ Stream.toStreamD m
155−
156−{-# INLINE fromStream #-}
157−fromStream :: MonadIO m => Stream m a -> m (Array a)
158−fromStream = fromStreamD . Stream.toStreamD
159−
160−{-# INLINABLE fromListN #-}
161−fromListN :: Int -> [a] -> Array a
162−fromListN n xs = unsafePerformIO $ fromStreamDN n $ D.fromList xs
163−
164−{-# INLINABLE fromList #-}
165−fromList :: [a] -> Array a
166−fromList xs = unsafePerformIO $ fromStreamD $ D.fromList xs
247+-- | Given a sorted array, perform a binary search to find the given element.
248+-- Returns the index of the element if found.
249+--
250+-- /Unimplemented/
251+{-# INLINE binarySearch #-}
252+binarySearch :: a -> Array a -> Maybe Int
253+binarySearch = undefined
167254
168−-------------------------------------------------------------------------------
169−-- Elimination - Unfolds
170−-------------------------------------------------------------------------------
255+-- find/findIndex etc can potentially be implemented more efficiently on arrays
256+-- compared to streams by using SIMD instructions.
257+-- We can also return a bit array instead.
258+
259+-- Can use SIMD.
171260
172−{-# INLINE length #-}
173−length :: Array a -> Int
174−length = arrLen
261+-- | Perform a linear search to find all the indices where a given element is
262+-- present in an array.
263+--
264+-- /Unimplemented/
265+indexFinder :: (a -> Bool) -> Unfold Identity (Array a) Int
266+indexFinder = undefined
267+
268+-- |
269+-- /Unimplemented/
270+findIndicesOf :: (a -> Bool) -> Array a -> Stream Identity Int
271+findIndicesOf p = Stream.unfold (indexFinder p)
175272
176−{-# INLINE_NORMAL read #-}
177−read :: MonadIO m => Unfold m (Array a) a
178−read = Unfold.lmap unsafeThaw MArray.read
273+{-
274+findIndexOf :: (a -> Bool) -> Array a -> Maybe Int
275+findIndexOf p = Unfold.fold Fold.one . Stream.unfold (indexFinder p)
276+
277+find :: (a -> Bool) -> Array a -> Bool
278+find = Unfold.fold Fold.null . Stream.unfold (indexFinder p)
279+-}
179280
180281-------------------------------------------------------------------------------
181−-- Elimination - to streams
282+-- Folds
182283-------------------------------------------------------------------------------
183284
184−{-# INLINE_NORMAL toList #-}
185−toList :: Array a -> [a]
186−toList arr = loop 0
285+-- XXX We can potentially use SIMD instructions on arrays to fold faster.
187286
188− where
287+-------------------------------------------------------------------------------
288+-- Slice
289+-------------------------------------------------------------------------------
189290
190− len = length arr
191− loop i | i == len = []
192− loop i = getIndexUnsafe arr i : loop (i + 1)
291+-- | /O(1)/ Slice an array in constant time.
292+--
293+-- Caution: The bounds of the slice are not checked.
294+--
295+-- /Unsafe/
296+--
297+-- /Pre-release/
298+{-# INLINE getSliceUnsafe #-}
299+getSliceUnsafe ::
300+ forall a. Unbox a
301+ => Int -- ^ starting index
302+ -> Int -- ^ length of the slice
303+ -> Array a
304+ -> Array a
305+getSliceUnsafe index len (Array contents start e) =
306+ let size = SIZE_OF(a)
307+ start1 = start + (index * size)
308+ end1 = start1 + (len * size)
309+ in assert (end1 <= e) (Array contents start1 end1)
310+
311+-- | Split the array into a stream of slices using a predicate. The element
312+-- matching the predicate is dropped.
313+--
314+-- /Pre-release/
315+{-# INLINE splitOn #-}
316+splitOn :: (Monad m, Unbox a) =>
317+ (a -> Bool) -> Array a -> Stream m (Array a)
318+splitOn predicate arr =
319+ fmap (\(i, len) -> getSliceUnsafe i len arr)
320+ $ D.indexOnSuffix predicate (read arr)
321+
322+{-# INLINE sliceIndexerFromLen #-}
323+sliceIndexerFromLen :: forall m a. (Monad m, Unbox a)
324+ => Int -- ^ from index
325+ -> Int -- ^ length of the slice
326+ -> Unfold m (Array a) (Int, Int)
327+sliceIndexerFromLen from len =
328+ Unfold.lmap unsafeThaw (MA.sliceIndexerFromLen from len)
329+
330+{-# DEPRECATED genSlicesFromLen "Please use sliceIndexerFromLen instead." #-}
331+{-# INLINE genSlicesFromLen #-}
332+genSlicesFromLen :: forall m a. (Monad m, Unbox a)
333+ => Int -- ^ from index
334+ -> Int -- ^ length of the slice
335+ -> Unfold m (Array a) (Int, Int)
336+genSlicesFromLen = sliceIndexerFromLen
337+
338+-- | Generate a stream of slices of specified length from an array, starting
339+-- from the supplied array index. The last slice may be shorter than the
340+-- requested length.
341+--
342+-- /Pre-release//
343+{-# INLINE slicerFromLen #-}
344+slicerFromLen :: forall m a. (Monad m, Unbox a)
345+ => Int -- ^ from index
346+ -> Int -- ^ length of the slice
347+ -> Unfold m (Array a) (Array a)
348+slicerFromLen from len =
349+ fmap unsafeFreeze
350+ $ Unfold.lmap unsafeThaw (MA.slicerFromLen from len)
351+
352+{-# DEPRECATED getSlicesFromLen "Please use slicerFromLen instead." #-}
353+{-# INLINE getSlicesFromLen #-}
354+getSlicesFromLen :: forall m a. (Monad m, Unbox a)
355+ => Int -- ^ from index
356+ -> Int -- ^ length of the slice
357+ -> Unfold m (Array a) (Array a)
358+getSlicesFromLen = slicerFromLen
193359
194−{-# INLINE_NORMAL toStreamD #-}
195−toStreamD :: MonadIO m => Array a -> D.Stream m a
196−toStreamD = MArray.toStreamD . unsafeThaw
360+-------------------------------------------------------------------------------
361+-- Random reads and writes
362+-------------------------------------------------------------------------------
197363
198−{-# INLINE_NORMAL toStreamDRev #-}
199−toStreamDRev :: Monad m => Array a -> D.Stream m a
200−toStreamDRev arr@Array{..} =
201− D.map (getIndexUnsafe arr)
202− $ D.enumerateFromThenToIntegral (arrLen - 1) (arrLen - 2) 0
364+-- XXX Change this to a partial function instead of a Maybe type? And use
365+-- MA.getIndex instead.
366+--
367+-- | /O(1)/ Lookup the element at the given index. Index starts from 0.
368+--
369+{-# INLINE getIndex #-}
370+getIndex :: forall a. Unbox a => Int -> Array a -> Maybe a
371+getIndex i arr =
372+ unsafeInlineIO
373+ $ do
374+ let elemPtr = INDEX_OF(arrStart arr, i, a)
375+ if i >= 0 && INDEX_VALID(elemPtr, arrEnd arr, a)
376+ then Just <$> peekAt elemPtr (arrContents arr)
377+ else return Nothing
378+
379+-- | Given a stream of array indices, read the elements on those indices from
380+-- the supplied Array. An exception is thrown if an index is out of bounds.
381+--
382+-- This is the most general operation. We can implement other operations in
383+-- terms of this:
384+--
385+-- @
386+-- read =
387+-- let u = lmap (\arr -> (0, length arr - 1)) Unfold.enumerateFromTo
388+-- in Unfold.lmap f (indexReader arr)
389+--
390+-- readRev =
391+-- let i = length arr - 1
392+-- in Unfold.lmap f (indexReaderFromThenTo i (i - 1) 0)
393+-- @
394+--
395+-- /Pre-release/
396+{-# INLINE indexReader #-}
397+indexReader :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
398+indexReader m =
399+ let unf = MA.indexReaderWith (return . unsafeInlineIO) m
400+ in Unfold.lmap unsafeThaw unf
401+
402+-- XXX DO NOT REMOVE, change the signature to use Stream instead of unfold
403+{-# DEPRECATED getIndices "Please use getIndices instead." #-}
404+{-# INLINE getIndices #-}
405+getIndices :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
406+getIndices = indexReader
407+
408+-- | Unfolds @(from, then, to, array)@ generating a finite stream whose first
409+-- element is the array value from the index @from@ and the successive elements
410+-- are from the indices in increments of @then@ up to @to@. Index enumeration
411+-- can occur downwards or upwards depending on whether @then@ comes before or
412+-- after @from@.
413+--
414+-- @
415+-- getIndicesFromThenTo =
416+-- let f (from, next, to, arr) =
417+-- (Stream.enumerateFromThenTo from next to, arr)
418+-- in Unfold.lmap f getIndices
419+-- @
420+--
421+-- /Unimplemented/
422+{-# INLINE indexReaderFromThenTo #-}
423+indexReaderFromThenTo :: Unfold m (Int, Int, Int, Array a) a
424+indexReaderFromThenTo = undefined
425+
426+-------------------------------------------------------------------------------
427+-- Transform via stream operations
428+-------------------------------------------------------------------------------
203429
204−{-# INLINE_EARLY toStream #-}
205−toStream :: MonadIO m => Array a -> Stream m a
206−toStream = Stream.fromStreamD . toStreamD
430+-- for non-length changing operations we can use the original length for
431+-- allocation. If we can predict the length then we can use the prediction for
432+-- new allocation. Otherwise we can use a hint and adjust dynamically.
207433
208−{-# INLINE_EARLY toStreamRev #-}
209−toStreamRev :: Monad m => Array a -> Stream m a
210−toStreamRev = Stream.fromStreamD . toStreamDRev
434+{-
435+-- | Transform an array into another array using a pipe transformation
436+-- operation.
437+--
438+{-# INLINE runPipe #-}
439+runPipe :: (MonadIO m, Unbox a, Unbox b)
440+ => Pipe m a b -> Array a -> m (Array b)
441+runPipe f arr = P.runPipe (toArrayMinChunk (length arr)) $ f (read arr)
442+-}
443+
444+-- XXX For transformations that cannot change the number of elements e.g. "map"
445+-- we can use a predetermined array length.
446+--
447+-- | Transform an array into another array using a stream transformation
448+-- operation.
449+--
450+-- /Pre-release/
451+{-# INLINE streamTransform #-}
452+streamTransform :: forall m a b. (MonadIO m, Unbox a, Unbox b)
453+ => (Stream m a -> Stream m b) -> Array a -> m (Array b)
454+streamTransform f arr =
455+ Stream.fold (createWith (length arr)) $ f (read arr)
211456
212457-------------------------------------------------------------------------------
213−-- Elimination - using Folds
458+-- Casts
214459-------------------------------------------------------------------------------
215460
216−{-# INLINE_NORMAL foldl' #-}
217−foldl' :: (b -> a -> b) -> b -> Array a -> b
218−foldl' f z arr = unsafePerformIO $ D.foldl' f z $ toStreamD arr
461+-- | Cast an array having elements of type @a@ into an array having elements of
462+-- type @b@. The array size must be a multiple of the size of type @b@
463+-- otherwise accessing the last element of the array may result into a crash or
464+-- a random value.
465+--
466+-- /Pre-release/
467+--
468+castUnsafe ::
469+#ifdef DEVBUILD
470+ Unbox b =>
471+#endif
472+ Array a -> Array b
473+castUnsafe (Array contents start end) =
474+ Array contents start end
475+
476+-- | Cast an @Array a@ into an @Array Word8@.
477+--
478+--
479+asBytes :: Array a -> Array Word8
480+asBytes = castUnsafe
219481
220−{-# INLINE_NORMAL foldr #-}
221−foldr :: (a -> b -> b) -> b -> Array a -> b
222−foldr f z arr = unsafePerformIO $ D.foldr f z $ toStreamD arr
482+-- | Cast an array having elements of type @a@ into an array having elements of
483+-- type @b@. The length of the array should be a multiple of the size of the
484+-- target element otherwise 'Nothing' is returned.
485+--
486+--
487+cast :: forall a b. (Unbox b) => Array a -> Maybe (Array b)
488+cast arr =
489+ let len = byteLength arr
490+ r = len `mod` SIZE_OF(b)
491+ in if r /= 0
492+ then Nothing
493+ else Just $ castUnsafe arr
494+
495+-- | Convert an array of any type into a null terminated CString Ptr. If the
496+-- array is unpinned it is first converted to a pinned array which requires a
497+-- copy.
498+--
499+-- /Unsafe/
500+--
501+-- /O(n) Time: (creates a copy of the array)/
502+--
503+-- /Pre-release/
504+--
505+asCStringUnsafe :: Array a -> (CString -> IO b) -> IO b
506+asCStringUnsafe arr act = do
507+ let arr1 = asBytes arr <> fromList [0]
508+ -- unsafePinnedAsPtr makes sure the array is pinned
509+ unsafePinnedAsPtr arr1 $ \ptr -> act (castPtr ptr)
223510
224−instance NFData a => NFData (Array a) where
225− {-# INLINE rnf #-}
226− rnf = foldl' (\_ x -> rnf x) ()
511+-------------------------------------------------------------------------------
512+-- Folds
513+-------------------------------------------------------------------------------
227514
515+-- XXX We can directly use toStreamD and D.fold here.
516+
517+-- | Fold an array using a 'Fold'.
518+--
519+-- /Pre-release/
228520{-# INLINE fold #-}
229−fold :: MonadIO m => Fold m a b -> Array a -> m b
230−fold f arr = D.fold f (toStreamD arr)
521+fold :: forall m a b. (Monad m, Unbox a) => Fold m a b -> Array a -> m b
522+fold f arr = Stream.fold f (read arr)
231523
524+-- | Fold an array using a stream fold operation.
525+--
526+-- /Pre-release/
232527{-# INLINE streamFold #-}
233−streamFold :: MonadIO m => (Stream m a -> m b) -> Array a -> m b
234−streamFold f arr = f (toStream arr)
528+streamFold :: (Monad m, Unbox a) => (Stream m a -> m b) -> Array a -> m b
529+streamFold f arr = f (read arr)
530+
531+--------------------------------------------------------------------------------
532+-- Serialization
533+--------------------------------------------------------------------------------
534+
535+{-# INLINE encodeAs #-}
536+encodeAs :: forall a. Serialize a => PinnedState -> a -> Array Word8
537+encodeAs ps a =
538+ unsafeInlineIO $ do
539+ let len = Serialize.addSizeTo 0 a
540+ mbarr <- MBA.newBytesAs ps len
541+ off <- Serialize.serializeAt 0 mbarr a
542+ assertM(len == off)
543+ pure $ Array mbarr 0 off
544+
545+-- |
546+-- Properties:
547+-- 1. Identity: @deserialize . serialize == id@
548+-- 2. Encoded equivalence: @serialize a == serialize a@
549+{-# INLINE serialize #-}
550+serialize :: Serialize a => a -> Array Word8
551+serialize = encodeAs Unpinned
552+
553+-- | Serialize a Haskell type to a pinned byte array. The array is allocated
554+-- using pinned memory so that it can be used directly in OS APIs for writing
555+-- to file or sending over the network.
556+--
557+-- Properties:
558+-- 1. Identity: @deserialize . pinnedSerialize == id@
559+-- 2. Encoded equivalence: @pinnedSerialize a == pinnedSerialize a@
560+{-# INLINE pinnedSerialize #-}
561+pinnedSerialize :: Serialize a => a -> Array Word8
562+pinnedSerialize = encodeAs Pinned
563+
564+-- | Decode a Haskell type from a byte array containing its serialized
565+-- representation.
566+{-# INLINE deserialize #-}
567+deserialize :: Serialize a => Array Word8 -> a
568+deserialize arr@(Array {..}) = unsafeInlineIO $ do
569+ let lenArr = length arr
570+ (off, val) <-
571+ Serialize.deserializeAt arrStart arrContents (arrStart + lenArr)
572+ assertM(off == arrStart + lenArr)
573+ pure val
235574
236575-------------------------------------------------------------------------------
237−-- Random reads and writes
576+-- Streams of Arrays
238577-------------------------------------------------------------------------------
239578
240−-- | /O(1)/ Lookup the element at the given index. Index starts from 0. Does
241−-- not check the bounds.
579+-- TODO: efficiently compare two streams of arrays. Two streams can have chunks
580+-- of different sizes, we can handle that in the stream comparison abstraction.
581+-- This could be useful e.g. to fast compare whether two files differ.
582+
583+-- | Insert the given element between arrays and flatten.
242584--
243−-- @since 0.8.0
244−{-# INLINE getIndexUnsafe #-}
245−getIndexUnsafe :: Array a -> Int -> a
246−getIndexUnsafe arr i =
247− unsafePerformIO $ MArray.getIndexUnsafe (unsafeThaw arr) i
585+-- >>> interpose x = Stream.interpose x Array.reader
586+--
587+{-# INLINE interpose #-}
588+interpose :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
589+interpose x = D.interpose x reader
248590
249−{-# INLINE writeLastN #-}
250−writeLastN :: MonadIO m => Int -> Fold m a (Array a)
251−writeLastN n
252− | n <= 0 = fmap (const nil) FL.drain
253− | otherwise = Fold step initial done
591+data FlattenState s =
592+ OuterLoop s
593+ | InnerLoop s !MutByteArray !Int !Int
594+
595+-- | Insert the given element after each array and flatten. This is similar to
596+-- unlines.
597+--
598+-- >>> interposeSuffix x = Stream.interposeSuffix x Array.reader
599+--
600+{-# INLINE_NORMAL interposeSuffix #-}
601+interposeSuffix :: forall m a. (Monad m, Unbox a)
602+ => a -> Stream m (Array a) -> Stream m a
603+-- This does not require MonadIO constraint.
604+-- interposeSuffix x = D.interposeSuffix x reader
605+interposeSuffix sep (D.Stream step state) = D.Stream step' (OuterLoop state)
254606
255607 where
256608
257− initial = do
258− rb <- liftIO $ RB.createRing n
259− return $ FL.Partial $ Tuple' rb (0 :: Int)
260−
261− step (Tuple' rb rh) x = do
262− liftIO $ RB.unsafeInsertRing rb rh x
263− return $ FL.Partial $ Tuple' rb (rh + 1)
264−
265− done (Tuple' rb rh) = do
266− arr' <- liftIO $ MArray.newArray (min rh n)
267− ref <- liftIO $ readIORef $ RB.ringHead rb
268− if rh < n
269− then
270− MArray.putSliceUnsafe (RB.arr rb) 0 arr' 0 ref
271− else do
272− MArray.putSliceUnsafe (RB.arr rb) ref arr' 0 (n - ref)
273− MArray.putSliceUnsafe (RB.arr rb) 0 arr' (n - ref) ref
274− return $ unsafeFreeze arr'
275−
276−sliceUnsafe :: Int -> Int -> Array a -> Array a
277−sliceUnsafe offset len (Array cont off1 _) = Array cont (off1 + offset) len
278−
279−-- XXX This is not efficient as it copies the array. We should support array
280−-- slicing so that we can just refer to the underlying array memory instead of
281−-- copying.
282−--
283−-- | Truncate the array at the beginning and end as long as the predicate
284−-- holds true.
285−strip :: (a -> Bool) -> Array a -> Array a
286−strip p arr =
287− let lastIndex = length arr - 1
288− indexR = getIndexR lastIndex -- last predicate failing index
289− in if indexR == -1
290− then nil
291− else
292− let indexL = getIndexL 0 -- first predicate failing index
293− in if indexL == 0 && indexR == lastIndex
294− then arr
295− else unsafeFreeze $ unsafePerformIO $ do
296− let newLen = indexR - indexL + 1
297− arrThawed = unsafeThaw (sliceUnsafe indexL newLen arr)
298− MArray.clone arrThawed
609+ {-# INLINE_LATE step' #-}
610+ step' gst (OuterLoop st) = do
611+ r <- step (adaptState gst) st
612+ return $ case r of
613+ D.Yield Array{..} s ->
614+ D.Skip (InnerLoop s arrContents arrStart arrEnd)
615+ D.Skip s -> D.Skip (OuterLoop s)
616+ D.Stop -> D.Stop
299617
300− where
618+ step' _ (InnerLoop st _ p end) | p == end =
619+ return $ D.Yield sep $ OuterLoop st
301620
302− getIndexR idx
303− | idx < 0 = idx
304− | otherwise =
305− if p (getIndexUnsafe arr idx) then getIndexR (idx - 1) else idx
621+ step' _ (InnerLoop st contents p end) = do
622+ x <- pure $ unsafeInlineIO $ peekAt p contents
623+ return $ D.Yield x (InnerLoop st contents (INDEX_NEXT(p,a)) end)
306624
307− getIndexL idx = if p (getIndexUnsafe arr idx)
308− then getIndexL (idx + 1)
309− else idx
625+-- | Insert the given array after each array and flatten.
626+--
627+-- >>> intercalateSuffix = Stream.intercalateSuffix Array.reader
628+--
629+{-# INLINE intercalateSuffix #-}
630+intercalateSuffix :: (Monad m, Unbox a)
631+ => Array a -> Stream m (Array a) -> Stream m a
632+intercalateSuffix = D.intercalateSuffix reader
310633
311−-- | Write an input stream of (index, value) pairs to an array. Throws an
312−-- error if any index is out of bounds.
634+-- | @compactLE n@ coalesces adjacent arrays in the input stream
635+-- only if the combined size would be less than or equal to n.
313636--
314−-- /Pre-release/
315−{-# INLINE putIndices #-}
316−putIndices :: MonadIO m
317− => Array a -> Fold m (Int, a) ()
318−putIndices arr = FL.rmapM (\ _ -> return ()) (FL.foldlM' step initial)
637+-- Generates unpinned arrays irrespective of the pinning status of input
638+-- arrays.
639+{-# INLINE_NORMAL compactLE #-}
640+compactLE :: (MonadIO m, Unbox a)
641+ => Int -> Stream m (Array a) -> Stream m (Array a)
642+compactLE n stream =
643+ D.map unsafeFreeze $ MA.compactLE n $ D.map unsafeThaw stream
644+
645+-- | Pinned version of 'compactLE'.
646+{-# INLINE_NORMAL pinnedCompactLE #-}
647+pinnedCompactLE :: (MonadIO m, Unbox a)
648+ => Int -> Stream m (Array a) -> Stream m (Array a)
649+pinnedCompactLE n stream =
650+ D.map unsafeFreeze $ MA.pinnedCompactLE n $ D.map unsafeThaw stream
651+
652+-- | Split a stream of arrays on a given separator byte, dropping the separator
653+-- and coalescing all the arrays between two separators into a single array.
654+--
655+{-# INLINE compactOnByte #-}
656+compactOnByte
657+ :: (MonadIO m)
658+ => Word8
659+ -> Stream m (Array Word8)
660+ -> Stream m (Array Word8)
661+compactOnByte byte =
662+ fmap unsafeFreeze . MA.compactOnByte byte . fmap unsafeThaw
663+
664+-- | Like 'compactOnByte' considers the separator in suffix position instead of
665+-- infix position.
666+{-# INLINE compactOnByteSuffix #-}
667+compactOnByteSuffix
668+ :: (MonadIO m)
669+ => Word8
670+ -> Stream m (Array Word8)
671+ -> Stream m (Array Word8)
672+compactOnByteSuffix byte =
673+ fmap unsafeFreeze . MA.compactOnByteSuffix byte . fmap unsafeThaw
674+
675+-------------------------------------------------------------------------------
676+-- Folding Streams of Arrays
677+-------------------------------------------------------------------------------
678+
679+-- XXX This should not be used for breaking a stream as the D.cons used in
680+-- reconstructing the stream could be very bad for performance. This can only
681+-- be useful in folding without breaking.
682+{-# INLINE_NORMAL foldBreakChunks #-}
683+foldBreakChunks :: forall m a b. (MonadIO m, Unbox a) =>
684+ Fold m a b -> Stream m (Array a) -> m (b, Stream m (Array a))
685+foldBreakChunks (Fold fstep initial _ final) stream@(Stream step state) = do
686+ res <- initial
687+ case res of
688+ Fold.Partial fs -> go SPEC state fs
689+ Fold.Done fb -> return $! (fb, stream)
690+
691+ where
692+
693+ {-# INLINE go #-}
694+ go !_ st !fs = do
695+ r <- step defState st
696+ case r of
697+ Stream.Yield (Array contents start end) s ->
698+ let fp = Tuple' end contents
699+ in goArray SPEC s fp start fs
700+ Stream.Skip s -> go SPEC s fs
701+ Stream.Stop -> do
702+ b <- final fs
703+ return (b, D.nil)
704+
705+ goArray !_ s (Tuple' end _) !cur !fs
706+ | cur == end = do
707+ go SPEC s fs
708+ goArray !_ st fp@(Tuple' end contents) !cur !fs = do
709+ x <- liftIO $ peekAt cur contents
710+ res <- fstep fs x
711+ let next = INDEX_NEXT(cur,a)
712+ case res of
713+ Fold.Done b -> do
714+ let arr = Array contents next end
715+ return $! (b, D.cons arr (D.Stream step st))
716+ Fold.Partial fs1 -> goArray SPEC st fp next fs1
717+
718+-- This may be more robust wrt fusion compared to unfoldMany?
719+
720+-- | Fold a stream of arrays using a 'Fold'. This is equivalent to the
721+-- following:
722+--
723+-- >>> foldChunks f = Stream.fold f . Stream.unfoldMany Array.reader
724+--
725+foldChunks :: (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m b
726+foldChunks f s = fmap fst (foldBreakChunks f s)
727+-- foldStream f = Stream.fold f . Stream.unfoldMany reader
728+
729+-- | Fold a stream of arrays using a 'Fold' and return the remaining stream.
730+--
731+-- The following alternative to this function allows composing the fold using
732+-- the parser Monad:
733+--
734+-- @
735+-- foldBreakStreamK f s =
736+-- fmap (first (fromRight undefined))
737+-- $ StreamK.parseBreakChunks (ParserK.adaptC (Parser.fromFold f)) s
738+-- @
739+--
740+-- We can compare perf and remove this one or define it in terms of that.
741+--
742+foldBreakChunksK :: forall m a b. (MonadIO m, Unbox a) =>
743+ Fold m a b -> StreamK m (Array a) -> m (b, StreamK m (Array a))
744+{-
745+foldBreakChunksK f s =
746+ fmap (first (fromRight undefined))
747+ $ StreamK.parseBreakChunks (ParserK.adaptC (Parser.fromFold f)) s
748+-}
749+foldBreakChunksK (Fold fstep initial _ final) stream = do
750+ res <- initial
751+ case res of
752+ Fold.Partial fs -> go fs stream
753+ Fold.Done fb -> return (fb, stream)
319754
320755 where
321756
322− initial = return $ unsafeThaw arr
757+ {-# INLINE go #-}
758+ go !fs st = do
759+ let stop = (, StreamK.nil) <$> final fs
760+ single a = yieldk a StreamK.nil
761+ yieldk (Array contents start end) r =
762+ let fp = Tuple' end contents
763+ in goArray fs r fp start
764+ in StreamK.foldStream defState yieldk single stop st
765+
766+ goArray !fs st (Tuple' end _) !cur
767+ | cur == end = do
768+ go fs st
769+ goArray !fs st fp@(Tuple' end contents) !cur = do
770+ x <- liftIO $ peekAt cur contents
771+ res <- fstep fs x
772+ let next = INDEX_NEXT(cur,a)
773+ case res of
774+ Fold.Done b -> do
775+ let arr = Array contents next end
776+ return $! (b, StreamK.cons arr st)
777+ Fold.Partial fs1 -> goArray fs1 st fp next
778+
779+{-
780+-- This can be generalized to any type provided it can be unfolded to a stream
781+-- and it can be combined using a semigroup operation.
782+--
783+{-# INLINE_NORMAL parseBreakD #-}
784+parseBreakD ::
785+ forall m a b. (MonadIO m, MonadThrow m, Unbox a)
786+ => PRD.Parser a m b
787+ -> D.Stream m (Array.Array a)
788+ -> m (b, D.Stream m (Array.Array a))
789+parseBreakD
790+ (PRD.Parser pstep initial extract) stream@(D.Stream step state) = do
791+
792+ res <- initial
793+ case res of
794+ PRD.IPartial s -> go SPEC state (List []) s
795+ PRD.IDone b -> return (b, stream)
796+ PRD.IError err -> throwM $ ParseError err
323797
324− step marr (i, x) = do
325− MArray.putIndexUnsafe marr i x
326− return marr
798+ where
327799
328−-------------------------------------------------------------------------------
329−-- Instances
330−-------------------------------------------------------------------------------
800+ -- "backBuf" contains last few items in the stream that we may have to
801+ -- backtrack to.
802+ --
803+ -- XXX currently we are using a dumb list based approach for backtracking
804+ -- buffer. This can be replaced by a sliding/ring buffer using Data.Array.
805+ -- That will allow us more efficient random back and forth movement.
806+ go !_ st backBuf !pst = do
807+ r <- step defState st
808+ case r of
809+ D.Yield (Array contents start end) s ->
810+ gobuf SPEC s backBuf
811+ (Tuple' end contents) start pst
812+ D.Skip s -> go SPEC s backBuf pst
813+ D.Stop -> do
814+ b <- extract pst
815+ return (b, D.nil)
816+
817+ -- Use strictness on "cur" to keep it unboxed
818+ gobuf !_ s backBuf (Tuple' end _) !cur !pst
819+ | cur == end = do
820+ go SPEC s backBuf pst
821+ gobuf !_ s backBuf fp@(Tuple' end contents) !cur !pst = do
822+ x <- liftIO $ peekByteIndex contents cur
823+ pRes <- pstep pst x
824+ let next = INDEX_NEXT(cur,a)
825+ case pRes of
826+ PR.Partial 0 pst1 ->
827+ gobuf SPEC s (List []) fp next pst1
828+ PR.Partial n pst1 -> do
829+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
830+ let src0 = Prelude.take n (x:getList backBuf)
831+ arr0 = A.fromListN n (Prelude.reverse src0)
832+ arr1 = Array contents next end
833+ src = arr0 <> arr1
834+ let !(Array cont1 start end1) = src
835+ fp1 = Tuple' end1 cont1
836+ gobuf SPEC s (List []) fp1 start pst1
837+ PR.Continue 0 pst1 ->
838+ gobuf SPEC s (List (x:getList backBuf)) fp next pst1
839+ PR.Continue n pst1 -> do
840+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
841+ let (src0, buf1) = splitAt n (x:getList backBuf)
842+ arr0 = A.fromListN n (Prelude.reverse src0)
843+ arr1 = Array contents next end
844+ src = arr0 <> arr1
845+ let !(Array cont1 start end1) = src
846+ fp1 = Tuple' end1 cont1
847+ gobuf SPEC s (List buf1) fp1 start pst1
848+ PR.Done 0 b -> do
849+ let arr = Array contents next end
850+ return (b, D.cons arr (D.Stream step s))
851+ PR.Done n b -> do
852+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
853+ let src0 = Prelude.take n (x:getList backBuf)
854+ -- XXX create the array in reverse instead
855+ arr0 = A.fromListN n (Prelude.reverse src0)
856+ arr1 = Array contents next end
857+ -- XXX Use StreamK to avoid adding arbitrary layers of
858+ -- constructors every time.
859+ str = D.cons arr0 (D.cons arr1 (D.Stream step s))
860+ return (b, str)
861+ PR.Error err -> throwM $ ParseError err
862+-}
863+
864+-- | Parse an array stream using the supplied 'Parser'. Returns the parse
865+-- result and the unconsumed stream. Throws 'ParseError' if the parse fails.
866+--
867+-- The following alternative to this function allows composing the parser using
868+-- the parser Monad:
869+--
870+-- >>> parseBreakStreamK p = StreamK.parseBreakChunks (ParserK.adaptC p)
871+--
872+-- We can compare perf and remove this one or define it in terms of that.
873+--
874+-- /Internal/
875+--
876+{-# INLINE_NORMAL parseBreakChunksK #-}
877+parseBreakChunksK ::
878+ forall m a b. (MonadIO m, Unbox a)
879+ => Parser a m b
880+ -> StreamK m (Array a)
881+ -> m (Either ParseError b, StreamK m (Array a))
882+-- parseBreakStreamK p = StreamK.parseBreakChunks (ParserK.adaptC p)
883+parseBreakChunksK (Parser pstep initial extract) stream = do
884+ res <- initial
885+ case res of
886+ IPartial s -> go s stream []
887+ IDone b -> return (Right b, stream)
888+ IError err -> return (Left (ParseError err), stream)
889+
890+ where
331891
332−instance Eq a => Eq (Array a) where
333− a1 == a2 = lenA1 == lenA2 && loop (lenA1 - 1)
334−
335− where
336−
337− lenA1 = length a1
338− lenA2 = length a2
339−
340− loop i
341− | i < 0 = True
342− | otherwise =
343− let v1 = getIndexUnsafe a1 i
344− v2 = getIndexUnsafe a2 i
345− in v1 == v2 && loop (i - 1)
346−
347−instance Ord a => Ord (Array a) where
348− compare a1 a2 =
349− case compare lenA1 lenA2 of
350− LT -> LT
351− GT -> GT
352− EQ -> loop 0
353−
354− where
355−
356− lenA1 = length a1
357− lenA2 = length a2
358−
359− loop i
360− | i >= lenA1 = EQ
361− | otherwise =
362− let v1 = getIndexUnsafe a1 i
363− v2 = getIndexUnsafe a2 i
364− in case compare v1 v2 of
365− LT -> LT
366− GT -> GT
367− EQ -> loop (i + 1)
368−
369−instance Show a => Show (Array a) where
370− show arr = "fromList " ++ show (toList arr)
371−
372−instance Read a => Read (Array a) where
373− readPrec = do
374− fromListWord <- replicateM 9 ReadPrec.get
375− if fromListWord == "fromList "
376− then fromList <$> readPrec
377− else ReadPrec.pfail
892+ -- "backBuf" contains last few items in the stream that we may have to
893+ -- backtrack to.
894+ --
895+ -- XXX currently we are using a dumb list based approach for backtracking
896+ -- buffer. This can be replaced by a sliding/ring buffer using Data.Array.
897+ -- That will allow us more efficient random back and forth movement.
898+ go !pst st backBuf = do
899+ let stop = goStop pst backBuf -- (, K.nil) <$> extract pst
900+ single a = yieldk a StreamK.nil
901+ yieldk arr r = goArray pst backBuf r arr
902+ in StreamK.foldStream defState yieldk single stop st
903+
904+ -- Use strictness on "cur" to keep it unboxed
905+ goArray !pst backBuf st (Array _ cur end) | cur == end = go pst st backBuf
906+ goArray !pst backBuf st (Array contents cur end) = do
907+ x <- liftIO $ peekAt cur contents
908+ pRes <- pstep pst x
909+ let next = INDEX_NEXT(cur,a)
910+ case pRes of
911+ Parser.Partial 0 s ->
912+ goArray s [] st (Array contents next end)
913+ Parser.Partial n s -> do
914+ assert (n <= Prelude.length (x:backBuf)) (return ())
915+ let src0 = Prelude.take n (x:backBuf)
916+ arr0 = fromListN n (Prelude.reverse src0)
917+ arr1 = Array contents next end
918+ src = arr0 <> arr1
919+ goArray s [] st src
920+ Parser.Continue 0 s ->
921+ goArray s (x:backBuf) st (Array contents next end)
922+ Parser.Continue n s -> do
923+ assert (n <= Prelude.length (x:backBuf)) (return ())
924+ let (src0, buf1) = Prelude.splitAt n (x:backBuf)
925+ arr0 = fromListN n (Prelude.reverse src0)
926+ arr1 = Array contents next end
927+ src = arr0 <> arr1
928+ goArray s buf1 st src
929+ Parser.Done 0 b -> do
930+ let arr = Array contents next end
931+ return (Right b, StreamK.cons arr st)
932+ Parser.Done n b -> do
933+ assert (n <= Prelude.length (x:backBuf)) (return ())
934+ let src0 = Prelude.take n (x:backBuf)
935+ -- XXX Use fromListRevN once implemented
936+ -- arr0 = A.fromListRevN n src0
937+ arr0 = fromListN n (Prelude.reverse src0)
938+ arr1 = Array contents next end
939+ str = StreamK.cons arr0 (StreamK.cons arr1 st)
940+ return (Right b, str)
941+ Parser.Error err -> do
942+ let n = Prelude.length backBuf
943+ arr0 = fromListN n (Prelude.reverse backBuf)
944+ arr1 = Array contents cur end
945+ str = StreamK.cons arr0 (StreamK.cons arr1 stream)
946+ return (Left (ParseError err), str)
947+
948+ -- This is a simplified goArray
949+ goExtract !pst backBuf (Array _ cur end)
950+ | cur == end = goStop pst backBuf
951+ goExtract !pst backBuf (Array contents cur end) = do
952+ x <- liftIO $ peekAt cur contents
953+ pRes <- pstep pst x
954+ let next = INDEX_NEXT(cur,a)
955+ case pRes of
956+ Parser.Partial 0 s ->
957+ goExtract s [] (Array contents next end)
958+ Parser.Partial n s -> do
959+ assert (n <= Prelude.length (x:backBuf)) (return ())
960+ let src0 = Prelude.take n (x:backBuf)
961+ arr0 = fromListN n (Prelude.reverse src0)
962+ arr1 = Array contents next end
963+ src = arr0 <> arr1
964+ goExtract s [] src
965+ Parser.Continue 0 s ->
966+ goExtract s backBuf (Array contents next end)
967+ Parser.Continue n s -> do
968+ assert (n <= Prelude.length (x:backBuf)) (return ())
969+ let (src0, buf1) = Prelude.splitAt n (x:backBuf)
970+ arr0 = fromListN n (Prelude.reverse src0)
971+ arr1 = Array contents next end
972+ src = arr0 <> arr1
973+ goExtract s buf1 src
974+ Parser.Done 0 b -> do
975+ let arr = Array contents next end
976+ return (Right b, StreamK.fromPure arr)
977+ Parser.Done n b -> do
978+ assert (n <= Prelude.length backBuf) (return ())
979+ let src0 = Prelude.take n backBuf
980+ -- XXX Use fromListRevN once implemented
981+ -- arr0 = A.fromListRevN n src0
982+ arr0 = fromListN n (Prelude.reverse src0)
983+ arr1 = Array contents next end
984+ str = StreamK.cons arr0 (StreamK.fromPure arr1)
985+ return (Right b, str)
986+ Parser.Error err -> do
987+ let n = Prelude.length backBuf
988+ arr0 = fromListN n (Prelude.reverse backBuf)
989+ arr1 = Array contents cur end
990+ str = StreamK.cons arr0 (StreamK.cons arr1 stream)
991+ return (Left (ParseError err), str)
992+
993+ -- This is a simplified goExtract
994+ {-# INLINE goStop #-}
995+ goStop !pst backBuf = do
996+ pRes <- extract pst
997+ case pRes of
998+ Parser.Partial _ _ -> error "Bug: parseBreak: Partial in extract"
999+ Parser.Continue 0 s ->
1000+ goStop s backBuf
1001+ Parser.Continue n s -> do
1002+ assert (n <= Prelude.length backBuf) (return ())
1003+ let (src0, buf1) = Prelude.splitAt n backBuf
1004+ arr = fromListN n (Prelude.reverse src0)
1005+ goExtract s buf1 arr
1006+ Parser.Done 0 b ->
1007+ return (Right b, StreamK.nil)
1008+ Parser.Done n b -> do
1009+ assert (n <= Prelude.length backBuf) (return ())
1010+ let src0 = Prelude.take n backBuf
1011+ -- XXX Use fromListRevN once implemented
1012+ -- arr0 = A.fromListRevN n src0
1013+ arr0 = fromListN n (Prelude.reverse src0)
1014+ return (Right b, StreamK.fromPure arr0)
1015+ Parser.Error err -> do
1016+ let n = Prelude.length backBuf
1017+ arr0 = fromListN n (Prelude.reverse backBuf)
1018+ return (Left (ParseError err), StreamK.fromPure arr0)
core/src/Streamly/Internal/Data/Array/ArrayMacros.h+13−9
@@ -1,5 +1,5 @@
11-------------------------------------------------------------------------------
2−-- Macros to access array pointers
2+-- Macros to access Storable pointers
33-------------------------------------------------------------------------------
44
55-- The Storable instance of () has size 0. We ensure that the size is non-zero
@@ -8,27 +8,31 @@
88--
99-- XXX Check the core to see if max can be statically eliminated. llvm can
1010-- eliminate the comparison, but not sure if GHC NCG can.
11−#define SIZE_OF(a) max 1 (sizeOf (undefined :: a))
11+#define STORABLE_SIZE_OF(a) max 1 (sizeOf (undefined :: a))
1212
1313-- Move the pointer to ith element of specified type. Type is specified as the
1414-- type variable in the signature of the function where this macro is used.
15−#define PTR_NEXT(ptr,a) ptr `plusPtr` SIZE_OF(a)
16−#define PTR_PREV(ptr,a) ptr `plusPtr` negate (SIZE_OF(a))
15+#define PTR_NEXT(ptr,a) ptr `plusPtr` STORABLE_SIZE_OF(a)
16+#define PTR_PREV(ptr,a) ptr `plusPtr` negate (STORABLE_SIZE_OF(a))
1717
18−#define PTR_INDEX(ptr,i,a) ptr `plusPtr` (SIZE_OF(a) * i)
19−#define PTR_RINDEX(ptr,i,a) ptr `plusPtr` negate (SIZE_OF(a) * (i + 1))
18+#define PTR_INDEX(ptr,i,a) ptr `plusPtr` (STORABLE_SIZE_OF(a) * i)
19+#define PTR_RINDEX(ptr,i,a) ptr `plusPtr` negate (STORABLE_SIZE_OF(a) * (i + 1))
2020
2121-- XXX If we know that the array is guaranteed to have size multiples of the
2222-- element size then we can use a simpler check saying "ptr < end". Since we
2323-- always allocate in multiples of elem we can use the simpler check and assert
2424-- the rigorous check.
25−#define PTR_VALID(ptr,end,a) ptr `plusPtr` SIZE_OF(a) <= end
26−#define PTR_INVALID(ptr,end,a) ptr `plusPtr` SIZE_OF(a) > end
25+#define PTR_VALID(ptr,end,a) ptr `plusPtr` STORABLE_SIZE_OF(a) <= end
26+#define PTR_INVALID(ptr,end,a) ptr `plusPtr` STORABLE_SIZE_OF(a) > end
2727
2828-------------------------------------------------------------------------------
29−-- Macros to access array indices
29+-- Macros to access array indices (using Unbox type class)
3030-------------------------------------------------------------------------------
3131
32+-- This macro was originally defined as a wrapper to sizeOf so that we can
33+-- avoid a sizeOf value of 0 and make it 1.
34+#define SIZE_OF(a) sizeOf (Proxy :: Proxy a)
35+
3236#define INDEX_NEXT(i,a) i + SIZE_OF(a)
3337#define INDEX_PREV(i,a) i - SIZE_OF(a)
3438
core/src/Streamly/Internal/Data/Array/Generic.hsnew file+342
@@ -0,0 +1,342 @@
1+-- |
2+-- Module : Streamly.Internal.Data.Array.Generic
3+-- Copyright : (c) 2019 Composewell Technologies
4+--
5+-- License : BSD-3-Clause
6+-- Maintainer : streamly@composewell.com
7+-- Portability : GHC
8+--
9+module Streamly.Internal.Data.Array.Generic
10+ ( Array(..)
11+
12+ -- * Construction
13+ , nil
14+ , createOf
15+ , create
16+ , writeWith
17+ , writeLastN
18+
19+ , fromStreamN
20+ , fromStream
21+ , fromPureStream
22+ , fromByteStr#
23+
24+ , fromListN
25+ , fromList
26+
27+ , chunksOf
28+
29+ -- * Elimination
30+ , length
31+ , reader
32+
33+ , toList
34+ , read
35+ , readRev
36+
37+ , foldl'
38+ , foldr
39+ , streamFold
40+ , fold
41+
42+ -- * Random Access
43+ , getIndexUnsafe
44+ , getIndex
45+ , getSliceUnsafe
46+ , strip
47+
48+ -- * Deprecated
49+ , writeN
50+ , write
51+ )
52+where
53+
54+#include "inline.hs"
55+
56+import Control.Monad (replicateM)
57+import Control.Monad.IO.Class (MonadIO)
58+import Data.Functor.Identity (Identity(..))
59+import Data.Word (Word8)
60+import GHC.Base (MutableArray#, RealWorld)
61+import GHC.Exts (Addr#)
62+import GHC.IO (unsafePerformIO)
63+import Text.Read (readPrec)
64+
65+import Streamly.Internal.Data.Fold.Type (Fold(..))
66+import Streamly.Internal.Data.Stream.Type (Stream)
67+import Streamly.Internal.Data.Unfold.Type (Unfold(..))
68+import Streamly.Internal.System.IO (unsafeInlineIO)
69+
70+import qualified Streamly.Internal.Data.MutArray.Generic as MArray
71+import qualified Streamly.Internal.Data.Fold.Type as FL
72+import qualified Streamly.Internal.Data.Producer.Type as Producer
73+import qualified Streamly.Internal.Data.Producer as Producer
74+import qualified Streamly.Internal.Data.Ring.Generic as RB
75+import qualified Streamly.Internal.Data.Stream.Type as D
76+import qualified Streamly.Internal.Data.Stream.Generate as D
77+import qualified Text.ParserCombinators.ReadPrec as ReadPrec
78+
79+import Prelude hiding (Foldable(..), read)
80+
81+-------------------------------------------------------------------------------
82+-- Array Data Type
83+-------------------------------------------------------------------------------
84+
85+data Array a =
86+ Array
87+ { arrContents# :: MutableArray# RealWorld a
88+ -- ^ The internal contents of the array representing the entire array.
89+
90+ , arrStart :: {-# UNPACK #-}!Int
91+ -- ^ The starting index of this slice.
92+
93+ , arrLen :: {-# UNPACK #-}!Int
94+ -- ^ The length of this slice.
95+ }
96+
97+unsafeFreeze :: MArray.MutArray a -> Array a
98+unsafeFreeze (MArray.MutArray cont# arrS arrL _) = Array cont# arrS arrL
99+
100+unsafeThaw :: Array a -> MArray.MutArray a
101+unsafeThaw (Array cont# arrS arrL) = MArray.MutArray cont# arrS arrL arrL
102+
103+{-# NOINLINE nil #-}
104+nil :: Array a
105+nil = unsafePerformIO $ unsafeFreeze <$> MArray.nil
106+
107+-------------------------------------------------------------------------------
108+-- Construction - Folds
109+-------------------------------------------------------------------------------
110+
111+{-# INLINE_NORMAL createOf #-}
112+createOf :: MonadIO m => Int -> Fold m a (Array a)
113+createOf = fmap unsafeFreeze <$> MArray.createOf
114+
115+-- XXX Deprecate in major
116+-- {-# DEPRECATED writeN "Please use createOf instead." #-}
117+{-# INLINE writeN #-}
118+writeN :: MonadIO m => Int -> Fold m a (Array a)
119+writeN = createOf
120+
121+{-# INLINE_NORMAL writeWith #-}
122+writeWith :: MonadIO m => Int -> Fold m a (Array a)
123+writeWith elemCount = unsafeFreeze <$> MArray.createWith elemCount
124+
125+-- | Fold the whole input to a single array.
126+--
127+-- /Caution! Do not use this on infinite streams./
128+--
129+{-# INLINE create #-}
130+create :: MonadIO m => Fold m a (Array a)
131+create = fmap unsafeFreeze MArray.create
132+
133+-- XXX Deprecate in major
134+-- {-# DEPRECATED write "Please use create instead." #-}
135+{-# INLINE write #-}
136+write :: MonadIO m => Fold m a (Array a)
137+write = create
138+
139+fromPureStream :: Stream Identity a -> Array a
140+fromPureStream x =
141+ unsafePerformIO $ fmap (unsafeFreeze) (MArray.fromPureStream x)
142+-- fromPureStream = runIdentity . D.fold (unsafeMakePure write)
143+-- fromPureStream = fromList . runIdentity . D.toList
144+
145+fromByteStr# :: Addr# -> Array Word8
146+fromByteStr# addr = fromPureStream (D.fromByteStr# addr)
147+
148+-------------------------------------------------------------------------------
149+-- Stream Ops
150+-------------------------------------------------------------------------------
151+
152+{-# INLINE_NORMAL chunksOf #-}
153+chunksOf :: forall m a. MonadIO m
154+ => Int -> Stream m a -> Stream m (Array a)
155+chunksOf n strm = fmap unsafeFreeze $ MArray.chunksOf n strm
156+
157+-------------------------------------------------------------------------------
158+-- Construction - from streams
159+-------------------------------------------------------------------------------
160+
161+{-# INLINE fromStreamN #-}
162+fromStreamN :: MonadIO m => Int -> Stream m a -> m (Array a)
163+fromStreamN n = D.fold (writeN n)
164+
165+{-# INLINE fromStream #-}
166+fromStream :: MonadIO m => Stream m a -> m (Array a)
167+fromStream = D.fold write
168+
169+-- XXX Consider foldr/build fusion in toList/fromList
170+
171+{-# INLINABLE fromListN #-}
172+fromListN :: Int -> [a] -> Array a
173+fromListN n xs = unsafePerformIO $ fromStreamN n $ D.fromList xs
174+
175+{-# INLINABLE fromList #-}
176+fromList :: [a] -> Array a
177+fromList xs = unsafePerformIO $ fromStream $ D.fromList xs
178+
179+-------------------------------------------------------------------------------
180+-- Elimination - Unfolds
181+-------------------------------------------------------------------------------
182+
183+{-# INLINE length #-}
184+length :: Array a -> Int
185+length = arrLen
186+
187+{-# INLINE_NORMAL reader #-}
188+reader :: Monad m => Unfold m (Array a) a
189+reader =
190+ Producer.simplify
191+ $ Producer.translate unsafeThaw unsafeFreeze
192+ $ MArray.producerWith (return . unsafeInlineIO)
193+
194+-------------------------------------------------------------------------------
195+-- Elimination - to streams
196+-------------------------------------------------------------------------------
197+
198+{-# INLINE_NORMAL toList #-}
199+toList :: Array a -> [a]
200+toList arr = loop 0
201+
202+ where
203+
204+ len = length arr
205+ loop i | i == len = []
206+ loop i = getIndexUnsafe i arr : loop (i + 1)
207+
208+{-# INLINE_NORMAL read #-}
209+read :: Monad m => Array a -> Stream m a
210+read arr@Array{..} =
211+ D.map (`getIndexUnsafe` arr) $ D.enumerateFromToIntegral 0 (arrLen - 1)
212+
213+{-# INLINE_NORMAL readRev #-}
214+readRev :: Monad m => Array a -> Stream m a
215+readRev arr@Array{..} =
216+ D.map (`getIndexUnsafe` arr)
217+ $ D.enumerateFromThenToIntegral (arrLen - 1) (arrLen - 2) 0
218+
219+-------------------------------------------------------------------------------
220+-- Elimination - using Folds
221+-------------------------------------------------------------------------------
222+
223+{-# INLINE_NORMAL foldl' #-}
224+foldl' :: (b -> a -> b) -> b -> Array a -> b
225+foldl' f z arr = unsafePerformIO $ D.foldl' f z $ read arr
226+
227+{-# INLINE_NORMAL foldr #-}
228+foldr :: (a -> b -> b) -> b -> Array a -> b
229+foldr f z arr = unsafePerformIO $ D.foldr f z $ read arr
230+
231+{-# INLINE fold #-}
232+fold :: Monad m => Fold m a b -> Array a -> m b
233+fold f arr = D.fold f (read arr)
234+
235+{-# INLINE streamFold #-}
236+streamFold :: Monad m => (Stream m a -> m b) -> Array a -> m b
237+streamFold f arr = f (read arr)
238+
239+-------------------------------------------------------------------------------
240+-- Random reads and writes
241+-------------------------------------------------------------------------------
242+
243+-- | /O(1)/ Lookup the element at the given index. Index starts from 0. Does
244+-- not check the bounds.
245+--
246+-- @since 0.8.0
247+{-# INLINE getIndexUnsafe #-}
248+getIndexUnsafe :: Int -> Array a -> a
249+getIndexUnsafe i arr =
250+ unsafePerformIO $ MArray.getIndexUnsafe i (unsafeThaw arr)
251+
252+-- | Lookup the element at the given index. Index starts from 0.
253+--
254+{-# INLINE getIndex #-}
255+getIndex :: Int -> Array a -> Maybe a
256+getIndex i arr@Array {..} =
257+ if i >= 0 && i < arrLen
258+ then Just $ getIndexUnsafe i arr
259+ else Nothing
260+
261+-- >>> import qualified Streamly.Data.Stream as Stream
262+-- >>> import qualified Streamly.Data.Fold as Fold
263+-- >>> import qualified Streamly.Internal.Data.Array.Generic as Array
264+-- >>> import Data.Function ((&))
265+-- >>> :{
266+-- Stream.fromList [1,2,3,4,5::Int]
267+-- & Stream.scan (Array.writeLastN 2)
268+-- & Stream.fold Fold.toList
269+-- :}
270+-- [fromList [],fromList [1],fromList [1,2],fromList [2,3],fromList [3,4],fromList [4,5]]
271+--
272+{-# INLINE writeLastN #-}
273+writeLastN :: MonadIO m => Int -> Fold m a (Array a)
274+writeLastN n = FL.rmapM f (RB.writeLastN n)
275+
276+ where
277+
278+ f rb = do
279+ arr <- RB.copyToMutArray 0 n rb
280+ return $ unsafeFreeze arr
281+
282+{-# INLINE getSliceUnsafe #-}
283+getSliceUnsafe :: Int -> Int -> Array a -> Array a
284+getSliceUnsafe offset len (Array cont off1 _) = Array cont (off1 + offset) len
285+
286+-- XXX This is not efficient as it copies the array. We should support array
287+-- slicing so that we can just refer to the underlying array memory instead of
288+-- copying.
289+
290+-- | Truncate the array at the beginning and end as long as the predicate
291+-- holds true. Returns a slice of the original array.
292+{-# INLINE strip #-}
293+strip :: (a -> Bool) -> Array a -> Array a
294+strip p arr = unsafeFreeze $ unsafePerformIO $ MArray.strip p (unsafeThaw arr)
295+
296+-------------------------------------------------------------------------------
297+-- Instances
298+-------------------------------------------------------------------------------
299+
300+instance Eq a => Eq (Array a) where
301+ {-# INLINE (==) #-}
302+ arr1 == arr2 =
303+ unsafeInlineIO $! unsafeThaw arr1 `MArray.eq` unsafeThaw arr2
304+
305+instance Ord a => Ord (Array a) where
306+ {-# INLINE compare #-}
307+ compare arr1 arr2 =
308+ unsafeInlineIO $! unsafeThaw arr1 `MArray.cmp` unsafeThaw arr2
309+
310+ -- Default definitions defined in base do not have an INLINE on them, so we
311+ -- replicate them here with an INLINE.
312+ {-# INLINE (<) #-}
313+ x < y = case compare x y of { LT -> True; _ -> False }
314+
315+ {-# INLINE (<=) #-}
316+ x <= y = case compare x y of { GT -> False; _ -> True }
317+
318+ {-# INLINE (>) #-}
319+ x > y = case compare x y of { GT -> True; _ -> False }
320+
321+ {-# INLINE (>=) #-}
322+ x >= y = case compare x y of { LT -> False; _ -> True }
323+
324+ -- These two default methods use '<=' rather than 'compare'
325+ -- because the latter is often more expensive
326+ {-# INLINE max #-}
327+ max x y = if x <= y then y else x
328+
329+ {-# INLINE min #-}
330+ min x y = if x <= y then x else y
331+
332+instance Show a => Show (Array a) where
333+ {-# INLINE show #-}
334+ show arr = "fromList " ++ show (toList arr)
335+
336+instance Read a => Read (Array a) where
337+ {-# INLINE readPrec #-}
338+ readPrec = do
339+ fromListWord <- replicateM 9 ReadPrec.get
340+ if fromListWord == "fromList "
341+ then fromList <$> readPrec
342+ else ReadPrec.pfail
core/src/Streamly/Internal/Data/Array/Mut/Type.hsdeleted−603
@@ -1,603 +0,0 @@
1−{-# LANGUAGE UnboxedTuples #-}
2−
3−-- |
4−-- Module : Streamly.Internal.Data.Array.Mut.Type
5−-- Copyright : (c) 2020 Composewell Technologies
6−-- License : BSD3-3-Clause
7−-- Maintainer : streamly@composewell.com
8−-- Stability : experimental
9−-- Portability : GHC
10−--
11−module Streamly.Internal.Data.Array.Mut.Type
12−(
13− -- * Type
14− -- $arrayNotes
15− Array (..)
16−
17− -- * Constructing and Writing
18− -- ** Construction
19− -- , nil
20−
21− -- *** Uninitialized Arrays
22− , newArray
23− -- , newArrayWith
24−
25− -- *** From streams
26− , writeNUnsafe
27− , writeN
28−
29− -- , writeWith
30− -- , write
31−
32− -- , writeRevN
33− -- , writeRev
34−
35− -- ** From containers
36− -- , fromListN
37− -- , fromList
38− -- , fromStreamDN
39− -- , fromStreamD
40−
41− -- * Random writes
42− , putIndex
43− , putIndexUnsafe
44− -- , putIndices
45− -- , putFromThenTo
46− -- , putFrom -- start writing at the given position
47− -- , putUpto -- write from beginning up to the given position
48− -- , putFromTo
49− -- , putFromRev
50− -- , putUptoRev
51− , modifyIndexUnsafe
52− , modifyIndex
53− -- , modifyIndices
54− -- , modify
55− -- , swapIndices
56−
57− -- * Growing and Shrinking
58− -- Arrays grow only at the end, though it is possible to grow on both sides
59− -- and therefore have a cons as well as snoc. But that will require two
60− -- bounds in the array representation.
61−
62− -- ** Reallocation
63− , realloc
64−
65− -- ** Appending elements
66− , snocWith
67− , snoc
68− -- , snocLinear
69− -- , snocMay
70− , snocUnsafe
71−
72− -- ** Appending streams
73− -- , appendNUnsafe
74− -- , appendN
75− -- , appendWith
76− -- , append
77−
78− -- ** Truncation
79− -- These are not the same as slicing the array at the beginning, they may
80− -- reduce the length as well as the capacity of the array.
81− -- , truncateWith
82− -- , truncate
83− -- , truncateExp
84−
85− -- * Eliminating and Reading
86−
87− -- ** To streams
88− , read
89− -- , readRev
90−
91− -- ** To containers
92− , toStreamD
93− -- , toStreamDRev
94− , toStreamK
95− -- , toStreamKRev
96− , toList
97−
98− -- experimental
99− , producer
100−
101− -- ** Random reads
102− , getIndex
103− , getIndexUnsafe
104− -- , getIndices
105− -- , getFromThenTo
106− -- , getIndexRev
107−
108− -- * In-place Mutation Algorithms
109− -- , reverse
110− -- , permute
111− -- , partitionBy
112− -- , shuffleBy
113− -- , divideBy
114− -- , mergeBy
115−
116− -- * Folding
117− -- , foldl'
118− -- , foldr
119− -- , cmp
120−
121− -- * Arrays of arrays
122− -- We can add dimensionality parameter to the array type to get
123− -- multidimensional arrays. Multidimensional arrays would just be a
124− -- convenience wrapper on top of single dimensional arrays.
125−
126− -- | Operations dealing with multiple arrays, streams of arrays or
127− -- multidimensional array representations.
128−
129− -- ** Construct from streams
130− -- , arraysOf
131− -- , arrayStreamKFromStreamD
132− -- , writeChunks
133−
134− -- ** Eliminate to streams
135− -- , flattenArrays
136− -- , flattenArraysRev
137− -- , fromArrayStreamK
138−
139− -- ** Construct from arrays
140− -- get chunks without copying
141− , getSliceUnsafe
142− , getSlice
143− -- , getSlicesFromLenN
144− -- , splitAt -- XXX should be able to express using getSlice
145− -- , breakOn
146−
147− -- ** Appending arrays
148− -- , spliceCopy
149− -- , spliceWith
150− -- , splice
151− -- , spliceExp
152− , putSliceUnsafe
153− -- , appendSlice
154− -- , appendSliceFrom
155−
156− , clone
157− )
158−where
159−
160−#include "inline.hs"
161−#include "assert.hs"
162−
163−import Control.Monad.IO.Class (MonadIO(..))
164−import GHC.Base
165− ( MutableArray#
166− , RealWorld
167− , copyMutableArray#
168− , newArray#
169− , readArray#
170− , writeArray#
171− )
172−import GHC.IO (IO(..))
173−import GHC.Int (Int(..))
174−import Streamly.Internal.Data.Fold.Type (Fold(..))
175−import Streamly.Internal.Data.Producer.Type (Producer (..))
176−import Streamly.Internal.Data.Unfold.Type (Unfold(..))
177−
178−import qualified Streamly.Internal.Data.Fold.Type as FL
179−import qualified Streamly.Internal.Data.Producer as Producer
180−import qualified Streamly.Internal.Data.Stream.StreamD as D
181−import qualified Streamly.Internal.Data.Stream.StreamK as K
182−
183−import Prelude hiding (read)
184−
185−-- $setup
186−-- >>> :m
187−-- >>> :set -package streamly
188−-- >>> import qualified Streamly.Internal.Data.Array.Mut.Type as Array
189−-- >>> import qualified Streamly.Internal.Data.Stream as Stream
190−-- >>> import qualified Streamly.Internal.Data.Stream.StreamD as StreamD
191−-- >>> import qualified Streamly.Internal.Data.Fold as Fold
192−-- >>> import qualified Streamly.Internal.Data.Fold.Type as Fold
193−
194−-------------------------------------------------------------------------------
195−-- Array Data Type
196−-------------------------------------------------------------------------------
197−
198−data Array a =
199− Array
200− { arrContents# :: MutableArray# RealWorld a
201− -- ^ The internal contents of the array representing the entire array.
202−
203− , arrStart :: {-# UNPACK #-}!Int
204− -- ^ The starting index of this slice.
205−
206− , arrLen :: {-# UNPACK #-}!Int
207− -- ^ The length of this slice.
208−
209− , arrTrueLen :: {-# UNPACK #-}!Int
210− -- ^ This is the true length of the array. Coincidentally, this also
211− -- represents the first index beyond the maximum acceptable index of
212− -- the array. This is specific to the array contents itself and not
213− -- dependent on the slice. This value should not change and is shared
214− -- across all the slices.
215− }
216−
217−{-# INLINE bottomElement #-}
218−bottomElement :: a
219−bottomElement =
220− error
221− $ unwords
222− [ funcName
223− , "This is the bottom element of the array."
224− , "This is a place holder and should never be reached!"
225− ]
226−
227− where
228−
229− funcName = "Streamly.Internal.Data.Array.Mut.Type.bottomElement:"
230−
231−-- XXX Would be nice if GHC can provide something like newUninitializedArray# so
232−-- that we do not have to write undefined or error in the whole array.
233−-- | @newArray count@ allocates an empty array that can hold 'count' items.
234−--
235−-- /Pre-release/
236−{-# INLINE newArray #-}
237−newArray :: forall m a. MonadIO m => Int -> m (Array a)
238−newArray n@(I# n#) =
239− liftIO
240− $ IO
241− $ \s# ->
242− case newArray# n# bottomElement s# of
243− (# s1#, arr# #) ->
244− let ma = Array arr# 0 0 n
245− in (# s1#, ma #)
246−
247−-------------------------------------------------------------------------------
248−-- Random writes
249−-------------------------------------------------------------------------------
250−
251−-- | Write the given element to the given index of the array. Does not check if
252−-- the index is out of bounds of the array.
253−--
254−-- /Pre-release/
255−{-# INLINE putIndexUnsafe #-}
256−putIndexUnsafe :: forall m a. MonadIO m => Array a -> Int -> a -> m ()
257−putIndexUnsafe Array {..} i x =
258− liftIO
259− $ IO
260− $ \s# ->
261− case i + arrStart of
262− I# n# ->
263− let s1# = writeArray# arrContents# n# x s#
264− in (# s1#, () #)
265−
266−invalidIndex :: String -> Int -> a
267−invalidIndex label i =
268− error $ label ++ ": invalid array index " ++ show i
269−
270−-- | /O(1)/ Write the given element at the given index in the array.
271−-- Performs in-place mutation of the array.
272−--
273−-- >>> putIndex arr ix val = Array.modifyIndex arr ix (const (val, ()))
274−--
275−-- /Pre-release/
276−{-# INLINE putIndex #-}
277−putIndex :: MonadIO m => Array a -> Int -> a -> m ()
278−putIndex arr@Array {..} i x =
279− if i >= 0 && i < arrLen
280− then putIndexUnsafe arr i x
281− else invalidIndex "putIndex" i
282−
283−-- | Modify a given index of an array using a modifier function without checking
284−-- the bounds.
285−--
286−-- Unsafe because it does not check the bounds of the array.
287−--
288−-- /Pre-release/
289−modifyIndexUnsafe :: MonadIO m => Array a -> Int -> (a -> (a, b)) -> m b
290−modifyIndexUnsafe Array {..} i f = do
291− liftIO
292− $ IO
293− $ \s# ->
294− case i + arrStart of
295− I# n# ->
296− case readArray# arrContents# n# s# of
297− (# s1#, a #) ->
298− let (a1, b) = f a
299− s2# = writeArray# arrContents# n# a1 s1#
300− in (# s2#, b #)
301−
302−-- | Modify a given index of an array using a modifier function.
303−--
304−-- /Pre-release/
305−modifyIndex :: MonadIO m => Array a -> Int -> (a -> (a, b)) -> m b
306−modifyIndex arr@Array {..} i f = do
307− if i >= 0 && i < arrLen
308− then modifyIndexUnsafe arr i f
309− else invalidIndex "modifyIndex" i
310−
311−-------------------------------------------------------------------------------
312−-- Resizing
313−-------------------------------------------------------------------------------
314−
315−-- | Reallocates the array according to the new size. This is a safe function
316−-- that always creates a new array and copies the old array into the new one. If
317−-- the reallocated size is less than the original array it results in a
318−-- truncated version of the original array.
319−--
320−realloc :: MonadIO m => Int -> Array a -> m (Array a)
321−realloc n arr = do
322− arr1 <- newArray n
323− let !newLen@(I# newLen#) = min n (arrLen arr)
324− !(I# arrS#) = arrStart arr
325− !(I# arr1S#) = arrStart arr1
326− arrC# = arrContents# arr
327− arr1C# = arrContents# arr1
328− liftIO
329− $ IO
330− $ \s# ->
331− let s1# = copyMutableArray# arrC# arrS# arr1C# arr1S# newLen# s#
332− in (# s1#, arr1 {arrLen = newLen, arrTrueLen = n} #)
333−
334−reallocWith ::
335− MonadIO m => String -> (Int -> Int) -> Int -> Array a -> m (Array a)
336−reallocWith label sizer reqSize arr = do
337− let oldSize = arrLen arr
338− newSize = sizer oldSize
339− safeSize = max newSize (oldSize + reqSize)
340− assert (newSize >= oldSize + reqSize || error badSize) (return ())
341− realloc safeSize arr
342−
343− where
344−
345− badSize = concat
346− [ label
347− , ": new array size is less than required size "
348− , show reqSize
349− , ". Please check the sizing function passed."
350− ]
351−
352−-------------------------------------------------------------------------------
353−-- Snoc
354−-------------------------------------------------------------------------------
355−
356−-- XXX Not sure of the behavior of writeArray# if we specify an index which is
357−-- out of bounds. This comment should be rewritten based on that.
358−-- | Really really unsafe, appends the element into the first array, may
359−-- cause silent data corruption or if you are lucky a segfault if the index
360−-- is out of bounds.
361−--
362−-- /Internal/
363−{-# INLINE snocUnsafe #-}
364−snocUnsafe :: MonadIO m => Array a -> a -> m (Array a)
365−snocUnsafe arr@Array {..} a = do
366− assert (arrStart + arrLen < arrTrueLen) (return ())
367− putIndexUnsafe arr arrLen a
368− return $ arr {arrLen = arrLen + 1}
369−
370−-- NOINLINE to move it out of the way and not pollute the instruction cache.
371−{-# NOINLINE snocWithRealloc #-}
372−snocWithRealloc :: MonadIO m => (Int -> Int) -> Array a -> a -> m (Array a)
373−snocWithRealloc sizer arr x = do
374− arr1 <- reallocWith "snocWithRealloc" sizer 1 arr
375− snocUnsafe arr1 x
376−
377−-- | @snocWith sizer arr elem@ mutates @arr@ to append @elem@. The length of
378−-- the array increases by 1.
379−--
380−-- If there is no reserved space available in @arr@ it is reallocated to a size
381−-- in bytes determined by the @sizer oldSize@ function, where @oldSize@ is the
382−-- original size of the array.
383−--
384−-- Note that the returned array may be a mutated version of the original array.
385−--
386−-- /Pre-release/
387−{-# INLINE snocWith #-}
388−snocWith :: MonadIO m => (Int -> Int) -> Array a -> a -> m (Array a)
389−snocWith sizer arr@Array {..} x = do
390− if arrStart + arrLen < arrTrueLen
391− then snocUnsafe arr x
392− else snocWithRealloc sizer arr x
393−
394−-- XXX round it to next power of 2.
395−--
396−-- | The array is mutated to append an additional element to it. If there is no
397−-- reserved space available in the array then it is reallocated to double the
398−-- original size.
399−--
400−-- This is useful to reduce allocations when appending unknown number of
401−-- elements.
402−--
403−-- Note that the returned array may be a mutated version of the original array.
404−--
405−-- >>> snoc = Array.snocWith (* 2)
406−--
407−-- Performs O(n * log n) copies to grow, but is liberal with memory allocation.
408−--
409−-- /Pre-release/
410−{-# INLINE snoc #-}
411−snoc :: MonadIO m => Array a -> a -> m (Array a)
412−snoc = snocWith (* 2)
413−
414−-------------------------------------------------------------------------------
415−-- Random reads
416−-------------------------------------------------------------------------------
417−
418−-- | Return the element at the specified index without checking the bounds.
419−--
420−-- Unsafe because it does not check the bounds of the array.
421−{-# INLINE_NORMAL getIndexUnsafe #-}
422−getIndexUnsafe :: MonadIO m => Array a -> Int -> m a
423−getIndexUnsafe Array {..} n =
424− liftIO
425− $ IO
426− $ \s# ->
427− let !(I# i#) = arrStart + n
428− in readArray# arrContents# i# s#
429−
430−-- | /O(1)/ Lookup the element at the given index. Index starts from 0.
431−--
432−{-# INLINE getIndex #-}
433−getIndex :: MonadIO m => Array a -> Int -> m a
434−getIndex arr@Array {..} i =
435− if i >= 0 && i < arrLen
436− then getIndexUnsafe arr i
437− else invalidIndex "getIndex" i
438−
439−-------------------------------------------------------------------------------
440−-- Subarrays
441−-------------------------------------------------------------------------------
442−
443−-- XXX We can also get immutable slices.
444−
445−-- | /O(1)/ Slice an array in constant time.
446−--
447−-- Unsafe: The bounds of the slice are not checked.
448−--
449−-- /Unsafe/
450−--
451−-- /Pre-release/
452−{-# INLINE getSliceUnsafe #-}
453−getSliceUnsafe
454− :: Int -- ^ from index
455− -> Int -- ^ length of the slice
456− -> Array a
457− -> Array a
458−getSliceUnsafe index len arr@Array {..} =
459− assert (index >= 0 && len >= 0 && index + len <= arrLen)
460− $ arr {arrStart = arrStart + index, arrLen = len}
461−
462−
463−-- | /O(1)/ Slice an array in constant time. Throws an error if the slice
464−-- extends out of the array bounds.
465−--
466−-- /Pre-release/
467−{-# INLINE getSlice #-}
468−getSlice
469− :: Int -- ^ from index
470− -> Int -- ^ length of the slice
471− -> Array a
472− -> Array a
473−getSlice index len arr@Array{..} =
474− if index >= 0 && len >= 0 && index + len <= arrLen
475− then arr {arrStart = arrStart + index, arrLen = len}
476− else error
477− $ "getSlice: invalid slice, index "
478− ++ show index ++ " length " ++ show len
479−
480−-------------------------------------------------------------------------------
481−-- to Lists and streams
482−-------------------------------------------------------------------------------
483−
484−-- | Convert an 'Array' into a list.
485−--
486−-- /Pre-release/
487−{-# INLINE toList #-}
488−toList :: MonadIO m => Array a -> m [a]
489−toList arr@Array{..} = mapM (getIndexUnsafe arr) [0 .. (arrLen - 1)]
490−
491−-- | Use the 'read' unfold instead.
492−--
493−-- @toStreamD = D.unfold read@
494−--
495−-- We can try this if the unfold has any performance issues.
496−{-# INLINE_NORMAL toStreamD #-}
497−toStreamD :: MonadIO m => Array a -> D.Stream m a
498−toStreamD arr@Array{..} =
499− D.mapM (getIndexUnsafe arr) $ D.enumerateFromToIntegral 0 (arrLen - 1)
500−
501−{-# INLINE toStreamK #-}
502−toStreamK :: MonadIO m => Array a -> K.Stream m a
503−toStreamK arr@Array{..} = K.unfoldrM step 0
504−
505− where
506−
507− step i
508− | i == arrLen = return Nothing
509− | otherwise = do
510− x <- getIndexUnsafe arr i
511− return $ Just (x, i + 1)
512−
513−
514−-------------------------------------------------------------------------------
515−-- Folds
516−-------------------------------------------------------------------------------
517−
518−-- | Like 'writeN' but does not check the array bounds when writing. The fold
519−-- driver must not call the step function more than 'n' times otherwise it will
520−-- corrupt the memory and crash. This function exists mainly because any
521−-- conditional in the step function blocks fusion causing 10x performance
522−-- slowdown.
523−--
524−-- /Pre-release/
525−{-# INLINE_NORMAL writeNUnsafe #-}
526−writeNUnsafe :: MonadIO m => Int -> Fold m a (Array a)
527−writeNUnsafe n = Fold step initial return
528−
529− where
530−
531− initial = FL.Partial <$> newArray (max n 0)
532−
533− step arr x = FL.Partial <$> snocUnsafe arr x
534−
535−-- | @writeN n@ folds a maximum of @n@ elements from the input stream to an
536−-- 'Array'.
537−--
538−-- >>> writeN n = Fold.take n (Array.writeNUnsafe n)
539−--
540−-- /Pre-release/
541−{-# INLINE_NORMAL writeN #-}
542−writeN :: MonadIO m => Int -> Fold m a (Array a)
543−writeN n = FL.take n $ writeNUnsafe n
544−
545−-------------------------------------------------------------------------------
546−-- Unfolds
547−-------------------------------------------------------------------------------
548−
549−-- | Resumable unfold of an array.
550−--
551−{-# INLINE_NORMAL producer #-}
552−producer :: MonadIO m => Producer m (Array a) a
553−producer = Producer step inject extract
554−
555− where
556−
557− {-# INLINE inject #-}
558− inject arr = return (arr, 0)
559−
560− {-# INLINE extract #-}
561− extract (arr, i) =
562− return $ arr {arrStart = arrStart arr + i, arrLen = arrLen arr - i}
563−
564− {-# INLINE_LATE step #-}
565− step (arr, i)
566− | assert (arrLen arr >= 0) (i == arrLen arr) = return D.Stop
567− step (arr, i) = do
568− x <- getIndexUnsafe arr i
569− return $ D.Yield x (arr, i + 1)
570−
571−-- | Unfold an array into a stream.
572−--
573−{-# INLINE_NORMAL read #-}
574−read :: MonadIO m => Unfold m (Array a) a
575−read = Producer.simplify producer
576−
577−--------------------------------------------------------------------------------
578−-- Appending arrays
579−--------------------------------------------------------------------------------
580−
581−-- | Put a sub range of a source array into a subrange of a destination array.
582−-- This is not safe as it does not check the bounds.
583−{-# INLINE putSliceUnsafe #-}
584−putSliceUnsafe :: MonadIO m => Array a -> Int -> Array a -> Int -> Int -> m ()
585−putSliceUnsafe src srcStart dst dstStart len = liftIO $ do
586− assertM(len <= arrLen dst)
587− assertM(len <= arrLen src)
588− let !(I# srcStart#) = srcStart + arrStart src
589− !(I# dstStart#) = dstStart + arrStart dst
590− !(I# len#) = len
591− let arrS# = arrContents# src
592− arrD# = arrContents# dst
593− IO $ \s# -> (# copyMutableArray#
594− arrS# srcStart# arrD# dstStart# len# s#
595− , () #)
596−
597−{-# INLINE clone #-}
598−clone :: MonadIO m => Array a -> m (Array a)
599−clone src = liftIO $ do
600− let len = arrLen src
601− dst <- newArray len
602− putSliceUnsafe src 0 dst 0 len
603− return dst
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/Foreign.hsdeleted−1161

This diff is too big to show here.

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

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.

core/src/Streamly/Internal/Data/Array/Unboxed.hsdeleted−559

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Unboxed/Type.hsdeleted−606

This diff is too big to show here.

src/Streamly/Internal/Data/Binary/Decode.hs → core/src/Streamly/Internal/Data/Binary/Parser.hsrenamed+157−38

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−2839

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+76−84

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+683−281

This diff is too big to show here.

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

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/Unboxed.hs+28−26

This diff is too big to show here.

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

This diff is too big to show here.

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

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+2811−711

This diff is too big to show here.

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

This diff is too big to show here.

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

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+6−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+245−317

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+11−1706

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+60−39

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

This diff is too big to show here.

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

This diff is too big to show here.

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

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.hs+22−10

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Eliminate.hs+702−231

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

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+795−358

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

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−1092

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Transform.hs+1393−337

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Type.hs+1962−286

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs → core/src/Streamly/Internal/Data/StreamK/Type.hsrenamed+1037−319

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Time/Units.hs+1−4

This diff is too big to show here.

core/src/Streamly/Internal/Data/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/Unboxed.hsdeleted−260

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold.hs+111−275

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Dir.hs → core/src/Streamly/Internal/FileSystem/Dir.hsrenamed+180−73

This diff is too big to show here.

src/Streamly/Internal/FileSystem/File.hs → core/src/Streamly/Internal/FileSystem/File.hsrenamed+173−107

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Handle.hs → core/src/Streamly/Internal/FileSystem/Handle.hsrenamed+127−183

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Array.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+144−161

This diff is too big to show here.

src/Streamly/Internal/Unicode/String.hs → core/src/Streamly/Internal/Unicode/String.hsrenamed+30−22

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+19−16

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/inline.hs+1−1

This diff is too big to show here.

core/streamly-core.cabal+268−109

This diff is too big to show here.

docs/Developer/Benchmarks.md+8

This diff is too big to show here.

docs/Developer/Contributing.md+1−2

This diff is too big to show here.

docs/Developer/MAINTAINING.md+13−14

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/Developer/paths.rst+25−2

This diff is too big to show here.

docs/Documentation.mdnew file+5

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

The content is the same.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/ProjectRelated/Changelog.md → docs/User/Project/Changelog.mdrenamed+120−20

This diff is too big to show here.

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

The content is the same.

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

The content is the same.

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

This diff is too big to show here.

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

The content is the same.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/Tutorials/Introduction.mddeleted−651

This diff is too big to show here.

docs/User/Tutorials/ReactiveProgramming.hs+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/streamly-docs.cabal+8−6

This diff is too big to show here.

hie.yaml+47−21

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.

src/Streamly/Data/Array/Foreign.hs+25−11

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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−39

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Channel/Types.hs → src/Streamly/Internal/Data/Channel/Types.hsrenamed+132−25

This diff is too big to show here.

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

This diff is too big to show here.

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

The content is the same.

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

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.hs+10

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async.hs+990−246

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async/Channel.hsdeleted−248

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async/Channel/Append.hsdeleted−292

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent.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/Async/Channel/Consumer.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Consumer.hsrenamed+14−17

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async/Channel/Dispatcher.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Dispatcher.hsrenamed+179−123

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async/Channel/Interleave.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Interleave.hsrenamed+35−31

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async/Channel/Operations.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Operations.hsrenamed+36−32

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Async/Channel/Type.hs → src/Streamly/Internal/Data/Stream/Concurrent/Channel/Type.hsrenamed+31−13

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Async.hsdeleted−1032

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+50−23

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs+133−38

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Expand.hs+33−26

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Generate.hs+15−39

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Type.hs+47−36

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+51−121

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Serial.hs+386−17

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.

src/Streamly/Internal/Data/Stream/WSerial.hsdeleted−208

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/ZipAsync.hs+7−7

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Linux.hs+93−97

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Windows.hs+53−53

This diff is too big to show here.

src/Streamly/Internal/FileSystem/FD.hs+22−21

This diff is too big to show here.

src/Streamly/Internal/Network/Inet/TCP.hs+145−110

This diff is too big to show here.

src/Streamly/Internal/Network/Socket.hs+130−233

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

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+13−5

This diff is too big to show here.

src/inline.hs+1−1

This diff is too big to show here.

stack.yaml+1−2

This diff is too big to show here.

streamly.cabal+190−246

This diff is too big to show here.

targets/Targets.hs+119−51

This diff is too big to show here.

test/Streamly/Test/Data/Array.hs+225−10

This diff is too big to show here.

test/Streamly/Test/Data/Array/Common.hs+10−18

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Array/Generic.hsnew file+65

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Array/Unboxed.hsdeleted−282

This diff is too big to show here.

test/Streamly/Test/Data/Array/Unboxed/Mut.hsdeleted−42

This diff is too big to show here.

test/Streamly/Test/Data/Fold.hs+15−14

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Parser.hs+363−204

This diff is too big to show here.

test/Streamly/Test/Data/Parser/ParserD.hs → test/Streamly/Test/Data/ParserK.hsrenamed+124−102

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/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/Async.hsdeleted−322

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

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+15−22

This diff is too big to show here.

test/Streamly/Test/Network/Inet/TCP.hs+22−15

This diff is too big to show here.

test/Streamly/Test/Network/Socket.hs+25−16

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+139−103

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+10−6

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Unicode/Stream.hs+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+11−2

This diff is too big to show here.

test/streamly-tests.cabal+113−28

This diff is too big to show here.

test/test-runner/Main.hs+1

This diff is too big to show here.

test/test-runner/cabal.project+3

This diff is too big to show here.