git.iko.soy/streamly
on master help sign in
swap
30c5a56634 ahead, 0 behind
367 files changed+41881−30530
since splitsnapshots
unifiedsplit
.circleci/config.yml+73−277 .github/workflows/haskell.yml+108−89 .github/workflows/regression-check.yml+15−27 .hlint.ignore+8−2 .hlint.yaml+1−3 CHANGELOG.md+1−1 LICENSE−254 README.md+1−1 appveyor.yml+2 benchmark/NanoBenchmarks.hs+1−1 benchmark/Streamly/Benchmark/Data/Array/Common.hs+6−6 benchmark/Streamly/Benchmark/Data/Array/CommonImports.hs+5−4 benchmark/Streamly/Benchmark/Data/Array/Stream.hs+34−28 benchmark/Streamly/Benchmark/Data/Fold.hs+35−11 benchmark/Streamly/Benchmark/Data/Fold/Window.hs+74−58 benchmark/Streamly/Benchmark/Data/Array/Mut.hs → benchmark/Streamly/Benchmark/Data/MutArray.hs+10−11 benchmark/Streamly/Benchmark/Data/Parser.hs+423−103 benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs−462 benchmark/Streamly/Benchmark/Data/Parser/ParserK.hs−167 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/Common.hs+125−63 benchmark/Streamly/Benchmark/Data/Stream/Concurrent.hs+1−1 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentCommon.hs+9−8 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentEager.hs+2−2 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentInterleaved.hs+2−2 benchmark/Streamly/Benchmark/Data/Stream/ConcurrentOrdered.hs+2−2 benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hs+59−39 benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hs+50−32 benchmark/Streamly/Benchmark/Data/Stream/Expand.hs+117−77 benchmark/Streamly/Benchmark/Data/Stream/Generate.hs+43−25 benchmark/Streamly/Benchmark/Data/Stream/Lift.hs+29−27 benchmark/Streamly/Benchmark/Data/Stream/Reduce.hs+165−119 benchmark/Streamly/Benchmark/Data/Stream/Split.hs+6−5 benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+6−4 benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs+35−35 benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs → benchmark/Streamly/Benchmark/Data/Stream/StreamKAlt.hs+3−3 benchmark/Streamly/Benchmark/Data/Stream/ToStreamK.hs+19−16 benchmark/Streamly/Benchmark/Data/Stream/Transform.hs+138−31 benchmark/Streamly/Benchmark/Data/Unfold.hs+16−7 benchmark/Streamly/Benchmark/FileSystem/Handle.hs+1−1 benchmark/Streamly/Benchmark/FileSystem/Handle/Read.hs+51−45 benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+12−13 benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+1−1 benchmark/Streamly/Benchmark/Prelude/Ahead.hs+1−1 benchmark/Streamly/Benchmark/Prelude/Async.hs+1−1 benchmark/Streamly/Benchmark/Prelude/Concurrent.hs+1−1 benchmark/Streamly/Benchmark/Prelude/Merge.hs+2−2 benchmark/Streamly/Benchmark/Prelude/Parallel.hs+1−1 benchmark/Streamly/Benchmark/Prelude/Rate.hs+1−1 benchmark/Streamly/Benchmark/Prelude/WAsync.hs+1−1 benchmark/Streamly/Benchmark/Prelude/WSerial.hs+2−2 benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+1−1 benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs+2−2 benchmark/Streamly/Benchmark/Unicode/Char.hs+2−2 benchmark/Streamly/Benchmark/Unicode/Parser.hs+107 benchmark/Streamly/Benchmark/Unicode/Stream.hs+39−13 benchmark/Streamly/Benchmark/Unicode/Utf8.hs+1−1 benchmark/bench-runner/Main.hs+88−42 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+1−1 benchmark/streamly-benchmarks.cabal+255−162 bin/mk-hscope.sh+1−1 bin/run-repl-quick.sh+1−1 cabal.project.doctest+1−1 cabal.project.packdiff+2−16 cabal.project.report+2−4 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 core/src/Streamly/Console/Stdio.hs+1−27 core/src/Streamly/Data/Array.hs+115−111 core/src/Streamly/Data/Array/Generic.hs+19−11 core/src/Streamly/Data/Array/Generic/Mut.hs−38 core/src/Streamly/Data/Array/Mut.hs−66 core/src/Streamly/Data/Fold.hs+105−54 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+147−12 core/src/Streamly/Data/ParserK.hs+139 core/src/Streamly/Data/Stream.hs+373−132 core/src/Streamly/Data/Stream/Zip.hs−16 core/src/Streamly/Data/StreamK.hs+194 core/src/Streamly/Data/Unfold.hs+98−85 core/src/Streamly/FileSystem/Handle.hs+15−29 core/src/Streamly/Internal/Console/Stdio.hs+2−1 core/src/Streamly/Internal/Data/Array.hs+645−190 core/src/Streamly/Internal/Data/Array/Generic.hs+151−184 core/src/Streamly/Internal/Data/Array/Generic/Mut/Type.hs−607 core/src/Streamly/Internal/Data/Array/Mut.hs−103 core/src/Streamly/Internal/Data/Array/Mut/Stream.hs−326 core/src/Streamly/Internal/Data/Array/Mut/Type.hs−2351 core/src/Streamly/Internal/Data/Stream/Chunked.hs → core/src/Streamly/Internal/Data/Array/Stream.hs+117−602 core/src/Streamly/Internal/Data/Array/Type.hs+673−116 core/src/Streamly/Internal/Serialize/FromBytes.hs → core/src/Streamly/Internal/Data/Binary/Parser.hs+29−13 core/src/Streamly/Internal/Serialize/ToBytes.hs → core/src/Streamly/Internal/Data/Binary/Stream.hs+46−24 core/src/Streamly/Internal/Data/Builder.hs+11−9 core/src/Streamly/Internal/Data/Fold.hs+11−2500 core/src/Streamly/Internal/Data/Fold/Chunked.hs+25−33 core/src/Streamly/Internal/Data/Fold/Combinators.hs+2452 core/src/Streamly/Internal/Data/Fold/Container.hs+119−40 core/src/Streamly/Internal/Data/Fold/Step.hs+2−2 core/src/Streamly/Internal/Data/Fold/Tee.hs+8−7 core/src/Streamly/Internal/Data/Fold/Type.hs+402−167 core/src/Streamly/Internal/Data/Fold/Window.hs+59−53 core/src/Streamly/Internal/Data/IOFinalizer.hs+12−2 core/src/Streamly/Internal/Data/IORef/Unboxed.hs+23−22 core/src/Streamly/Internal/Data/IsMap.hs+8 core/src/Streamly/Internal/Data/List.hs+81−16 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+2671−588 core/src/Streamly/Internal/Data/Parser/Chunked.hs−328 core/src/Streamly/Internal/Data/Parser/Chunked/Type.hs−329 core/src/Streamly/Internal/Data/Parser/ParserD.hs−2247 core/src/Streamly/Internal/Data/Parser/ParserK/Type.hs−313 core/src/Streamly/Internal/Data/Parser/ParserD/Tee.hs → core/src/Streamly/Internal/Data/Parser/Tee.hs+1−1 core/src/Streamly/Internal/Data/Parser/ParserD/Type.hs → core/src/Streamly/Internal/Data/Parser/Type.hs+212−271 core/src/Streamly/Internal/Data/ParserK.hs+16 core/src/Streamly/Internal/Data/ParserK/Type.hs+752 core/src/Streamly/Internal/Data/Pipe.hs+7−10 core/src/Streamly/Internal/Data/Producer.hs+6−13 core/src/Streamly/Internal/Data/Producer/Source.hs+34−19 core/src/Streamly/Internal/Data/Producer/Type.hs+1−1 core/src/Streamly/Internal/Data/Refold/Type.hs+2−2 core/src/Streamly/Internal/Data/Ring.hs+603−31 core/src/Streamly/Internal/Data/Ring/Generic.hs+185 core/src/Streamly/Internal/Data/Ring/Unboxed.hs−615 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+20−21 core/src/Streamly/Internal/Data/Stream/Bottom.hs−670 core/src/Streamly/Internal/Data/Stream/Container.hs+77−69 core/src/Streamly/Internal/Data/Stream/Cross.hs−143 core/src/Streamly/Internal/Data/Stream/Eliminate.hs+697−228 core/src/Streamly/Internal/Data/Stream/Enumerate.hs−560 core/src/Streamly/Internal/Data/Stream/Exception.hs+369−90 core/src/Streamly/Internal/Data/Stream/Expand.hs−893 core/src/Streamly/Internal/Data/Stream/Generate.hs+948−217 core/src/Streamly/Internal/Data/Stream/Lift.hs+70−36 core/src/Streamly/Internal/Data/Stream/StreamD/Nesting.hs → core/src/Streamly/Internal/Data/Stream/Nesting.hs+662−303 core/src/Streamly/Internal/Data/Stream/Reduce.hs−444 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−25 core/src/Streamly/Internal/Data/Stream/StreamD/Eliminate.hs−673 core/src/Streamly/Internal/Data/Stream/StreamD/Exception.hs−368 core/src/Streamly/Internal/Data/Stream/StreamD/Generate.hs−482 core/src/Streamly/Internal/Data/Stream/StreamD/Lift.hs−103 core/src/Streamly/Internal/Data/Stream/StreamD/Transform.hs−1113 core/src/Streamly/Internal/Data/Stream/StreamD/Transformer.hs−119 core/src/Streamly/Internal/Data/Stream/StreamD/Type.hs−1342 core/src/Streamly/Internal/Data/Stream/StreamDK.hs−156 core/src/Streamly/Internal/Data/Stream/StreamK.hs−1080 core/src/Streamly/Internal/Data/Stream/Top.hs+257−170 core/src/Streamly/Internal/Data/Stream/Transform.hs+1197−282 core/src/Streamly/Internal/Data/Stream/Transformer.hs+91−43 core/src/Streamly/Internal/Data/Stream/Type.hs+1961−219 core/src/Streamly/Internal/Data/Stream/Zip.hs−91 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/Stream/StreamK/Transformer.hs → core/src/Streamly/Internal/Data/StreamK/Transformer.hs+8−8 core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs → core/src/Streamly/Internal/Data/StreamK/Type.hs+1014−249 core/src/Streamly/Internal/Data/Time/Clock.hs+3−3 core/src/Streamly/Internal/Data/Time/Units.hs+1−4 core/src/Streamly/Internal/Data/Unboxed.hs → core/src/Streamly/Internal/Data/Unbox.hs+344−276 core/src/Streamly/Internal/Data/Unbox/TH.hs+498 core/src/Streamly/Internal/Data/Unfold.hs+34−197 core/src/Streamly/Internal/Data/Unfold/Enumeration.hs+14−45 core/src/Streamly/Internal/Data/Unfold/Type.hs+127−20 core/src/Streamly/Internal/FileSystem/Dir.hs+70−23 core/src/Streamly/Internal/FileSystem/File.hs+32−29 core/src/Streamly/Internal/FileSystem/Handle.hs+40−47 core/src/Streamly/Internal/FileSystem/Path.hs+515 core/src/Streamly/Internal/Unicode/Array.hs+6 core/src/Streamly/Internal/Unicode/Parser.hs+354−25 core/src/Streamly/Internal/Unicode/Stream.hs+87−79 core/src/Streamly/Internal/Unicode/String.hs+17−12 core/src/Streamly/Unicode/Parser.hs+12−2 core/src/Streamly/Unicode/Stream.hs+14−10 core/src/Streamly/Unicode/String.hs+15−1 core/src/inline.hs+1−1 core/streamly-core.cabal+197−115 docs/Developer/Benchmarks.md+8 docs/Developer/Contributing.md+1−2 docs/Developer/MAINTAINING.md+8−11 docs/Developer/module-organization.md+1−1 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+36−14 docs/User/HowTo/faq.md+1−1 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+9−1 docs/User/ProjectRelated/Changelog.md → docs/User/Project/Changelog.md+92−32 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+2 docs/User/Tutorials/README.md−166 docs/User/Tutorials/ReactiveProgramming.hs+2 docs/User/Tutorials/Tutorial.hs+2 docs/User/Tutorials/before-you-begin.md+77 docs/User/Tutorials/setup-and-usage.md → docs/User/Tutorials/getting-started.md+29−26 docs/User/Tutorials/haskell-lazy-evaluation.md+215 docs/User/Tutorials/Introduction.md → docs/User/Tutorials/quick-overview.md+21−42 docs/User/Tutorials/why-haskell-streamly.md+5 docs/streamly-docs.cabal+8−6 hie.yaml+24−12 src/Streamly.hs−624 src/Streamly/Data/Array/Foreign.hs+3−3 src/Streamly/Data/Fold/Prelude.hs+65 src/Streamly/Data/Fold/Tee.hs+2−1 src/Streamly/Data/Stream/Concurrent.hs−184 src/Streamly/Data/Stream/Exception.hs−24 src/Streamly/Data/Stream/MkType.hs+37−13 src/Streamly/Data/Stream/Prelude.hs+217−15 src/Streamly/Data/Stream/Time.hs−37 src/Streamly/Data/Unicode/Stream.hs−99 src/Streamly/Internal/Control/ForkLifted.hs+17−4 src/Streamly/Internal/Data/Array/ArrayMacros.h−40 src/Streamly/Internal/Data/Channel.hs+19 src/Streamly/Internal/Data/Stream/Channel/Dispatcher.hs → src/Streamly/Internal/Data/Channel/Dispatcher.hs+3−3 src/Streamly/Internal/Data/Stream/Channel/Types.hs → src/Streamly/Internal/Data/Channel/Types.hs+22−32 src/Streamly/Internal/Data/Stream/Channel/Worker.hs → src/Streamly/Internal/Data/Channel/Worker.hs+3−3 src/Streamly/Internal/Data/Fold/Async.hs+18−6 src/Streamly/Internal/Data/Fold/Concurrent.hs+37−49 src/Streamly/Internal/Data/Fold/Concurrent/Channel.hs+31−10 src/Streamly/Internal/Data/Fold/Concurrent/Channel/Type.hs+8−7 src/Streamly/Internal/Data/Fold/Prelude.hs+19 src/Streamly/Internal/Data/Fold/SVar.hs+8−7 src/Streamly/Internal/Data/IsMap/HashMap.hs+10 src/Streamly/Internal/Data/SVar.hs+1 src/Streamly/Internal/Data/SmallArray.hs+7−8 src/Streamly/Internal/Data/Stream/Ahead.hs+17−4 src/Streamly/Internal/Data/Stream/Async.hs+24−4 core/src/Streamly/Internal/Data/Stream/Common.hs → src/Streamly/Internal/Data/Stream/Common.hs+12−12 src/Streamly/Internal/Data/Stream/Concurrent.hs+223−97 src/Streamly/Internal/Data/Stream/Concurrent/Channel.hs+24−21 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Append.hs+37−37 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Consumer.hs+2−2 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Dispatcher.hs+3−3 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Interleave.hs+16−14 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Operations.hs+7−7 src/Streamly/Internal/Data/Stream/Concurrent/Channel/Type.hs+5−5 src/Streamly/Internal/Data/Stream/Instances.hs+6−9 src/Streamly/Internal/Data/Stream/IsStream.hs+20−10 src/Streamly/Internal/Data/Stream/IsStream/Combinators.hs+1−1 src/Streamly/Internal/Data/Stream/IsStream/Common.hs+41−17 src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs+126−35 src/Streamly/Internal/Data/Stream/IsStream/Enumeration.hs+1−1 src/Streamly/Internal/Data/Stream/IsStream/Exception.hs+10−10 src/Streamly/Internal/Data/Stream/IsStream/Expand.hs+19−15 src/Streamly/Internal/Data/Stream/IsStream/Generate.hs+9−10 src/Streamly/Internal/Data/Stream/IsStream/Lift.hs+4−4 src/Streamly/Internal/Data/Stream/IsStream/Reduce.hs+23−22 src/Streamly/Internal/Data/Stream/IsStream/Top.hs+5−6 src/Streamly/Internal/Data/Stream/IsStream/Transform.hs+9−9 src/Streamly/Internal/Data/Stream/IsStream/Type.hs+39−28 src/Streamly/Internal/Data/Stream/Exception/Lifted.hs → src/Streamly/Internal/Data/Stream/Lifted.hs+19−17 src/Streamly/Internal/Data/Stream/MkType.hs+40−46 src/Streamly/Internal/Data/Stream/Parallel.hs+37−115 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−10 src/Streamly/Internal/Data/Stream/Serial.hs+187−103 src/Streamly/Internal/Data/Stream/Time.hs+10−10 src/Streamly/Internal/Data/Stream/Zip.hs+174 src/Streamly/Internal/Data/Stream/Zip/Concurrent.hs−50 src/Streamly/Internal/Data/Stream/ZipAsync.hs+6−5 src/Streamly/Internal/Data/Unfold/Exception.hs+1−3 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+5−5 src/Streamly/Internal/FileSystem/Event/Linux.hs+15−9 src/Streamly/Internal/FileSystem/Event/Windows.hs+11−8 src/Streamly/Internal/FileSystem/FD.hs+17−16 src/Streamly/Internal/Network/Inet/TCP.hs+89−48 src/Streamly/Internal/Network/Socket.hs+39−33 src/Streamly/Internal/System/IOVec.hs+7−7 src/Streamly/Internal/Unicode/Char.hs+11−10 src/Streamly/Memory/Array.hs−74 src/Streamly/Network/Inet/TCP.hs+41−30 src/Streamly/Network/Socket.hs+16−30 src/Streamly/Prelude.hs+10−4 src/inline.hs+1−1 stack.yaml+1−2 streamly.cabal+118−90 targets/Targets.hs+106−90 test/Streamly/Test/Data/Array.hs+10−10 test/Streamly/Test/Data/Array/Stream.hs+4−3 test/Streamly/Test/Data/Fold.hs+8−8 test/Streamly/Test/Data/Fold/Window.hs+8−9 test/Streamly/Test/Data/Array/Mut.hs → test/Streamly/Test/Data/MutArray.hs+5−5 test/Streamly/Test/Data/Parser.hs+282−141 test/Streamly/Test/Data/Parser/Chunked.hs−1239 test/Streamly/Test/Data/Parser/ParserD.hs → test/Streamly/Test/Data/ParserK.hs+19−14 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/Stream.hs+33 test/Streamly/Test/Data/Stream/Concurrent.hs+126−82 test/Streamly/Test/Data/Unbox.hs+318−50 test/Streamly/Test/Data/Unbox/TH.hs+146 test/Streamly/Test/Data/Unfold.hs+2−2 test/Streamly/Test/FileSystem/Event/Common.hs+5−3 test/Streamly/Test/FileSystem/Event/Linux.hs+16−3 test/Streamly/Test/FileSystem/Handle.hs+2−2 test/Streamly/Test/Network/Inet/TCP.hs+5−4 test/Streamly/Test/Network/Socket.hs+5−4 test/Streamly/Test/Prelude/Serial.hs+42−35 test/Streamly/Test/Prelude/Top.hs+1−1 test/Streamly/Test/Serialize/Serializable.hs+237 test/Streamly/Test/Unicode/Char.hs+1−1 test/Streamly/Test/Unicode/Parser.hs+231 test/Streamly/Test/Unicode/Stream.hs+30−28 test/lib/Streamly/Test/Common.hs+4 test/lib/Streamly/Test/Prelude/Common.hs+9−2 test/streamly-tests.cabal+99−29
.circleci/config.yml+73−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: "a302772c8f3791c477edd1764b82f8d1f5b22fdf"
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,271 +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:
149+ cabal-ghc-8_6_5:
140150 <<: *env
141151 executor: amd64-executor
142152 steps:
143− - *preinstall
144153 - checkout
145− - *project-preinstall
146154 - *restore
155+ - *preinstall
147156 - run:
148157 environment:
158+ GHCVER: "8.6.5"
159+ CABAL_VERSION: "3.6.2.0"
149160 CABAL_PROJECT: "cabal.project"
150− DISABLE_TEST: "yes"
151− DISABLE_BENCH: "yes"
152161 DISABLE_SDIST_BUILD: "yes"
162+ CABAL_BUILD_OPTIONS: "--flag debug --flag -opt"
153163 command: |
154− apt-get install -y ghc-8.10.4
155− apt-get install -y cabal-install-3.4
156164 bash -c "$PACKCHECK cabal"
157165 - *save
158− stack-ghc-8_8:
166+ cabal-ghc-9_8_1-docspec:
159167 <<: *env
160168 executor: amd64-executor
161169 steps:
162− - *preinstall
163170 - checkout
164− - *project-preinstall
165171 - *restore
166− - run:
167− name: GHC 8.8 + stack lts-16.12
168− environment:
169− BUILD: "stack"
170− RESOLVER: "lts-16.12"
171− SDIST_OPTIONS: "--ignore-check"
172− STACK_BUILD_OPTIONS: "--flag streamly-benchmarks:-opt"
173− command: |
174− apt-get build-dep -y ghc-8.8.4
175− apt-get install -y cabal-install-3.2
176− bash -c "$PACKCHECK $BUILD"
177− - *save
178− cabal-ghc-8_6_5:
179− <<: *env
180− executor: amd64-executor
181− steps:
182172 - *preinstall
183− - checkout
184− - *project-preinstall
185− - *restore
186− - run: |
187− apt-get install -y ghc-8.6.3
188− apt-get install -y cabal-install-2.4
189− bash -c "$PACKCHECK cabal-v2"
190− - *save
191− cabal-ghc-8_4_4:
192− <<: *env
193− executor: x86-executor
194− steps:
195− - *preinstall
196− - checkout
197− - *project-preinstall
198− - *restore
199− - run:
200− name: GHC 8.4.4 + x86 + debug
201− environment:
202− BUILD: "cabal-v2"
203− GHCVER: "8.4.4"
204− CABAL_BUILD_OPTIONS: "--flag debug --flag limit-build-mem"
205− command: |
206− apt-get install -y ghc-8.4.4
207− apt-get install -y cabal-install-3.2
208− bash -c "$PACKCHECK $BUILD"
209− - *save
210− cabal-ghc-8_2_2:
211− <<: *env
212− executor: amd64-executor
213− steps:
214− - *preinstall
215− - checkout
216− - *project-preinstall
217− - *restore
218173 - run:
219174 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"
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"
226185 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"
186+ bash -c "$PACKCHECK cabal"
264187 - *save
265− stack-ghc-8_4:
188+ hlint-trailing-spaces:
266189 <<: *env
267190 executor: amd64-executor
268191 steps:
269− - *preinstall
270192 - checkout
271− - *project-preinstall
272193 - *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:
280194 - *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
295195 - run:
296− name: GHCJS 8.4+no-test+no-docs
196+ name: hlint and trailing spaces
297197 environment:
298− BUILD: cabal-v2
299− ENABLE_GHCJS: "yes"
300− DISABLE_TEST: "yes"
301− ENABLE_INSTALL: ""
302− DISABLE_DOCS: "yes"
303198 DISABLE_SDIST_BUILD: "yes"
304− command: |
305− add-apt-repository -y ppa:hvr/ghcjs
306− add-apt-repository -y 'deb https://deb.nodesource.com/node_11.x xenial main'
307− curl -sSL https://deb.nodesource.com/gpgkey/nodesource.gpg.key | apt-key add -
308− apt-get update
309− apt-get install -y cabal-install-3.2
310− apt-get install -y nodejs
311− apt-get install -y ghcjs-8.4
312− cabal user-config update -a "jobs: 1"
313− bash -c "$PACKCHECK $BUILD"
314− - *save
315− coveralls-ghc-8_2_2:
316− <<: *env
317− executor: amd64-executor
318− steps:
319− - *preinstall
320− - checkout
321− - *project-preinstall
322− - *restore
323− - run:
324− environment:
325− BUILD: cabal
326− COVERALLS_OPTIONS: "--repo-token=\"$REPO_TOKEN\" --coverage-mode=StrictlyFullLines --exclude-dir=test test"
327− GHC_OPTIONS: "-DCOVERAGE_BUILD"
328− command: |
329− apt-get install -y ghc-8.2.2
330− apt-get install -y cabal-install-2.4
331− bash -c "$PACKCHECK cabal-v1"
332− - *save
333− coveralls-ghc-8_8_3:
334− <<: *env
335− executor: amd64-executor
336− steps:
337− - *preinstall
338− - checkout
339− - *project-preinstall
340− - *restore
341− - run:
342− environment:
343− BUILD: cabal-v2
344− COVERALLS_OPTIONS: "--repo-token=\"$REPO_TOKEN\" --coverage-mode=StrictlyFullLines --exclude-dir=test"
345− CABAL_PROJECT: "cabal.project.coverage"
346− CABAL_BUILD_TARGETS: ""
347− command: |
348− apt-get install -y ghc-8.8.3
349− apt-get install -y cabal-install-3.0
350− bash -c "$PACKCHECK cabal-v2"
351− no_output_timeout: 25m
352− - *save
353− coveralls-ghc-8_10_2:
354− <<: *env
355− executor: amd64-executor
356− steps:
357− - *preinstall
358− - checkout
359− - *project-preinstall
360− - *restore
361− - run:
362− name: Build and test with inspection, coverage, Werror
363− command: |
364− apt-get install -y ghc-8.10.2
365− apt-get install -y cabal-install-3.2
366− # Run tests with coverage
367− cabal update
368− cabal user-config update -a "jobs: 1"
369− bin/test.sh --coverage --raw
370− # Upload results to coveralls.io
371− PATH=$HOME/.cabal/bin:$PATH
372− export PATH
373− which hpc-coveralls 2>/dev/null || cabal install --project-file cabal.project.hpc-coveralls hpc-coveralls
374− hpc-coveralls --repo-token="$REPO_TOKEN" --coverage-mode=StrictlyFullLines
375− no_output_timeout: 25m
376− - *save
377− hlint-src:
378− <<: *env
379− executor: amd64-executor
380− steps:
381− - *preinstall
382− - checkout
383− - *project-preinstall
384− - *restore
385− - run:
386− name: Hlint src
387− environment:
388− BUILD: hlint
199+ HLINT_VERSION: 3.6.1
389200 HLINT_OPTIONS: lint
390− DISABLE_SDIST_BUILD: "yes"
391201 HLINT_TARGETS: core/src src test benchmark
392202 command: |
393− bash -c "$PACKCHECK $BUILD" || exit 1
203+ bash -c "$PACKCHECK hlint" || exit 1
394204 echo "Checking trailing spaces..."
395205 count=$(find . -name "*.hs" -exec grep -H '\ $' {} \; | tee /dev/tty | wc -l)
396206 exit $count
@@ -400,23 +210,9 @@ workflows:
400210 version: 2
401211 build:
402212 jobs:
403− - cabal-ghc-8_10_4:
404− name: GHC 8.10.4 + sdist + no-test + no-bench
405− #- cabal-ghc-8.6.5
406− #- cabal-ghc-8_4_4:
407− # name: GHC 8.4.4 + x86 + debug
408− #- cabal-ghc-8_2_2:
409− # name: GHC 8.2.2 + no-test + no-bench + no-docs
410− #- cabal-ghc-8_0_2:
411− # name: GHC 8.0.2 + no-test + no-bench + no-docs
412− #- cabal-ghc-7.10.3
413− # - cabal-ghcjs-8_4:
414− # name: GHCJS 8.4 + no-test + no-docs
415− #- stack-ghc-8.4
416− #- stack-ghc-8.2
417− #- coveralls-ghc-8.2.2
418− #- coveralls-ghc-8.8.3
419− #- coveralls-ghc-8_10_2:
420− # name: GHC 8.10.2 + inspection + coverage + Werror
421− - hlint-src:
422− name: Hlint src + Trailing Spaces
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+108−89
@@ -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: "a302772c8f3791c477edd1764b82f8d1f5b22fdf"
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-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,35 +78,74 @@ 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-fusion-inspection
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
76100 runner: ubuntu-latest
77101 build: cabal
78− cabal_version: 3.8.1.0
102+ cabal_version: 3.10.1.0
103+ disable_sdist_build: "y"
104+ cabal_project: cabal.project.Werror
105+ ignore_error: false
106+ #- name: 9.8.1-docspec
107+ # ghc_version: 9.8.1
108+ # runner: ubuntu-latest
109+ # build: cabal
110+ # cabal_version: 3.10.1.0
111+ # cabal_project: cabal.project.doctest
112+ # disable_test: "y"
113+ # disable_bench: "y"
114+ # disable_docs: "y"
115+ # enable_docspec: "y"
116+ # disable_sdist_build: "y"
117+ # ignore_error: false
118+ - name: 9.8.1-fusion-inspection
119+ ghc_version: 9.8.1
120+ runner: ubuntu-latest
121+ build: cabal
122+ cabal_version: 3.10.1.0
79123 disable_sdist_build: "y"
80124 cabal_project: cabal.project
81125 cabal_build_options: "--flag fusion-plugin --flag inspection"
82126 ignore_error: false
83− - name: 9.2.4
84− ghc_version: 9.2.4
85− runner: ubuntu-latest
127+ - name: 9.6.3-macos
128+ ghc_version: 9.6.3
129+ runner: macos-latest
86130 build: cabal
131+ cabal_version: 3.10.1.0
132+ disable_sdist_build: "y"
87133 cabal_project: cabal.project
88− cabal_version: 3.6.2.0
134+ ignore_error: false
135+ - name: 9.4.7
136+ ghc_version: 9.4.7
137+ runner: ubuntu-latest
138+ build: cabal
139+ cabal_version: 3.8.1.0
89140 disable_sdist_build: "y"
141+ cabal_project: cabal.project
90142 ignore_error: false
91− - name: 9.2.4-docspec
92− ghc_version: 9.2.4
143+ - name: 9.2.8
144+ ghc_version: 9.2.8
93145 runner: ubuntu-latest
94− doctest: "y"
95− cabal_version: 3.6.2.0
146+ build: cabal
96147 cabal_project: cabal.project
148+ cabal_version: 3.6.2.0
97149 disable_sdist_build: "y"
98150 ignore_error: false
99151 - name: 9.0.2-streamly-sdist
@@ -103,37 +155,28 @@ jobs:
103155 cabal_version: 3.6.2.0
104156 cabal_project: cabal.project.streamly
105157 ignore_error: true
158+ - name: 9.0.2-streamly-core-sdist
159+ ghc_version: 9.0.2
160+ runner: ubuntu-latest
161+ build: cabal
162+ cabal_version: 3.6.2.0
163+ subdir: core
164+ ignore_error: false
106165 - name: 8.10.7-streamly-sdist-stack
107166 runner: ubuntu-latest
108167 build: stack
109− resolver: lts-18.23
168+ resolver: lts-20.13
110169 stack_yaml: stack.yaml
111170 sdist_options: "--ignore-check"
112171 stack_build_options: "--flag streamly-benchmarks:-opt"
113172 cabal_version: 3.6.2.0
114173 ignore_error: false
115− - name: 8.10.7-macos
116− ghc_version: 8.10.7
117− runner: macos-latest
118− build: cabal
119− cabal_version: 3.6.2.0
120− cabal_project: cabal.project
121− disable_sdist_build: "y"
122− ignore_error: false
123174 # - name: 8.10.7-coverage
124175 # ghc_version: 8.10.7
125176 # runner: ubuntu-latest
126177 # coverage: "y"
127178 # cabal_version: 3.6.2.0
128179 # ignore_error: false
129− - name: 8.10.7-Werror
130− ghc_version: 8.10.7
131− runner: ubuntu-latest
132− build: cabal
133− cabal_version: 3.6.2.0
134− cabal_project: cabal.project.Werror
135− disable_sdist_build: "y"
136− ignore_error: false
137180 - name: 8.8.4
138181 ghc_version: 8.8.4
139182 runner: ubuntu-latest
@@ -142,15 +185,6 @@ jobs:
142185 cabal_project: cabal.project
143186 disable_sdist_build: "y"
144187 ignore_error: false
145− - name: 8.6.5-no-fusion-unoptimized
146− ghc_version: 8.6.5
147− runner: ubuntu-latest
148− build: cabal
149− cabal_version: 3.6.2.0
150− cabal_project: cabal.project
151− cabal_build_options: "--flag no-fusion --flag -opt"
152− disable_sdist_build: "y"
153− ignore_error: false
154188 - name: 8.6.5-debug-unoptimized
155189 ghc_version: 8.6.5
156190 runner: ubuntu-latest
@@ -160,66 +194,44 @@ jobs:
160194 cabal_build_options: "--flag debug --flag -opt"
161195 disable_sdist_build: "y"
162196 ignore_error: false
197+ - name: hlint
198+ build: hlint
199+ runner: ubuntu-latest
200+ ignore_error: true
163201
164202 steps:
165203 - uses: actions/checkout@v2
166204
167205 - uses: actions/cache@v1
168− name: Cache ~/.cabal
206+ name: Cache common directories
169207 with:
170− path: ~/.cabal
208+ path: |
209+ ~/.local
210+ ~/.cabal
211+ ~/.stack
212+ ~/.ghcup
171213 # Bump the key version to clear the cache
172214 key: ${{ runner.os }}-${{ matrix.ghc_version }}-cabal-v2
173215
174216 - name: Download packcheck
175217 run: |
176− # Get packcheck if needed
177− CURL=$(which curl)
178− PACKCHECK_URL=${PACKCHECK_GITHUB_URL}/${PACKCHECK_GITHUB_COMMIT}/packcheck.sh
179− if test ! -e "$PACKCHECK_LOCAL_PATH"; then $CURL -sL -o "$PACKCHECK_LOCAL_PATH" $PACKCHECK_URL; fi;
180− chmod +x $PACKCHECK_LOCAL_PATH
181−
182− os=$(uname -s -m)
183− case "$os" in
184− "Linux x86_64") GHCUP_ARCH="x86_64-linux" ;;
185− "Darwin x86_64") GHCUP_ARCH="x86_64-apple-darwin" ;;
186− *) echo "Unknown OS/Arch: $os"; exit 1;;
187− esac
188−
189− # Check available versions here: https://downloads.haskell.org/~ghcup/
190− GHCUP_VER=0.1.18.0
191− $CURL -sL -o ./ghcup https://downloads.haskell.org/~ghcup/$GHCUP_VER/${GHCUP_ARCH}-ghcup-$GHCUP_VER
192− chmod +x ./ghcup
193− if test "$GHCVER" = "head"
218+ if test ! -e "$PACKCHECK"
194219 then
195− # The URL may change, to find a working URL go to https://gitlab.haskell.org/ghc/ghc/-/jobs/
196− # Find a debian10 job, click on a passed/failed job, at the
197− # end of the output you will find the tar.xz name, put that after
198− # "raw/", and put the job name after "job=".
199− # Also see https://github.com/mpickering/ghc-artefact-nix/blob/master/gitlab-artifact.nix
200− ./ghcup install ghc -u https://gitlab.haskell.org/ghc/ghc/-/jobs/artifacts/master/raw/ghc-x86_64-linux-deb10-int_native-validate.tar.xz?job=x86_64-linux-deb10-int_native-validate head
201− else
202− ./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
203230 fi
204− ./ghcup install cabal $CABALVER
205− ./ghcup set ghc $GHCVER
206− ./ghcup set cabal $CABALVER
207231
208232 - name: Run tests
209233 run: |
210− if test -n "$DOCTEST"
211− then
212− mkdir -p $HOME/.cabal/bin
213− curl -sL https://github.com/phadej/cabal-extras/releases/download/cabal-docspec-0.0.0.20210111/cabal-docspec-0.0.0.20210111.xz > cabal-docspec.xz
214− echo '0829bd034fba901cbcfe491d98ed8b28fd54f9cb5c91fa8e1ac62dc4413c9562 cabal-docspec.xz' | sha256sum -c -
215− xz -d < cabal-docspec.xz > $HOME/.cabal/bin/cabal-docspec
216− rm -f cabal-docspec.xz
217− chmod a+x $HOME/.cabal/bin/cabal-docspec
218− cabal update
219− cabal build --project-file cabal.project.doctest all
220− $HOME/.cabal/bin/cabal-docspec --version
221− $HOME/.cabal/bin/cabal-docspec --timeout 60 --check-properties --property-variables xs
222− elif test -n "$COVERAGE"
234+ if test -n "$COVERAGE"
223235 then
224236 # Run tests with coverage
225237 cabal update
@@ -232,8 +244,15 @@ jobs:
232244 # XXX Uncomment this and fix it properly later
233245 # hpc-coveralls --repo-token="$COVERALLS_TOKEN" --coverage-mode=StrictlyFullLines
234246 else
235− export TOOLS_DIR=/opt
236247 # /usr/local/opt/curl/bin for macOS
237248 export PATH=$HOME/.local/bin:$HOME/.ghcup/bin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/local/opt/curl/bin
238− 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"
239258 fi
.github/workflows/regression-check.yml+15−27
@@ -19,17 +19,15 @@ jobs:
1919 env:
2020 CI_BENCHMARKS_WITH_CUTOFF: >-
2121 Data.Array
22− Data.Array.Mut
23− Data.Array.Stream
22+ Data.MutArray
2423 Data.Array.Generic
2524 Data.Ring.Unboxed
2625 Data.Fold
2726 Data.Fold.Window
2827 Data.Parser
29− Data.Parser.ParserD
30− Data.Parser.ParserK
31− Data.Stream.StreamD
32− Data.Stream.StreamK:6
28+ Data.ParserK
29+ Data.StreamD
30+ Data.StreamK:6
3331 Data.Unfold
3432 Data.Stream
3533 Data.Stream.Concurrent
@@ -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,14 +73,6 @@ 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
80− uses: actions/cache@v2
81− with:
82− path: charts-master
83− # Bump the key version to clear the cache
84− key: charts-master-v1
85−
8676 - name: Cache bench-runner from pr
8777 id: cache-bench-runner-pr
8878 uses: actions/cache@v2
@@ -101,7 +91,6 @@ jobs:
10191 clean: false
10292
10393 - name: Install bench-runner
104− if: steps.cache-bench-runner-pr.outputs.cache-hit != 'true'
10594 run: |
10695 cabal install bench-runner --project-file=cabal.project.report --installdir=./
10796
@@ -110,19 +99,16 @@ jobs:
11099 # -----------------------------------------------------------------
111100
112101 - name: Checkout the base branch
113− if: steps.cache-charts-master.outputs.cache-hit != 'true'
114102 uses: actions/checkout@v2
115103 with:
116104 ref: master
117105 clean: false
118106
119107 - name: Run benchmarks
120− if: steps.cache-charts-master.outputs.cache-hit != 'true'
121108 run: |
122− ./bench-runner --targets "$CI_BENCHMARKS" --raw
109+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw
123110
124111 - name: Move charts to charts-master
125− if: steps.cache-charts-master.outputs.cache-hit != 'true'
126112 run: mv charts charts-master
127113
128114 # -----------------------------------------------------------------
@@ -139,7 +125,7 @@ jobs:
139125
140126 - name: Run benchmarks and append
141127 run: |
142− ./bench-runner --targets "$CI_BENCHMARKS" --raw --append
128+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --raw --append
143129
144130 # -----------------------------------------------------------------
145131 # -- Compare
@@ -147,7 +133,7 @@ jobs:
147133
148134 - name: List all benchmarks
149135 run: |
150− ./bench-runner --targets "$CI_BENCHMARKS" --no-measure
136+ ./bench-runner --package-name streamly-benchmarks --package-version 0.0.0 --targets "$CI_BENCHMARKS" --no-measure
151137
152138 - name: Compare benchmarks
153139 run: |
@@ -165,11 +151,13 @@ jobs:
165151
166152 echo
167153 echo "Checking $bname for regressions greater than $cutoff percent"
168− ! ./bench-runner \
169− --targets "$bname" \
170− --fields "$CI_FIELDS" \
171− --no-measure --silent \
172− --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 \
173161 | grep -v "^$"
174162 test $? -eq 1 && EXIT_STATUS=1
175163 done
.hlint.ignore+8−2
@@ -2,13 +2,18 @@ core/src/Streamly/Internal/Data/Stream/StreamK/Type.hs
22core/src/Streamly/Internal/Data/Pipe/Type.hs
33core/src/Streamly/Internal/Unicode/Stream.hs
44src/Streamly/Internal/Data/SmallArray/Type.hs
5+src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs
6+src/Streamly/Internal/Data/Stream/Serial.hs
7+src/Streamly/Internal/Data/Stream/Zip.hs
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
@@ -20,12 +25,13 @@ benchmark/lib/Streamly/Benchmark/Prelude.hs
2025benchmark/NanoBenchmarks.hs
2126benchmark/Streamly/Benchmark/Data/Array.hs
2227benchmark/Streamly/Benchmark/Data/Parser.hs
23−benchmark/Streamly/Benchmark/Data/Parser/ParserD.hs
28+benchmark/Streamly/Benchmark/Data/ParserK.hs
2429benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs
2530benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs
2631benchmark/Streamly/Benchmark/Data/Unfold.hs
2732benchmark/Streamly/Benchmark/FileSystem/Handle.hs
2833benchmark/Streamly/Benchmark/Prelude/Async.hs
34+benchmark/Streamly/Benchmark/Prelude/Concurrent.hs
2935benchmark/Streamly/Benchmark/Prelude/Merge.hs
3036benchmark/Streamly/Benchmark/Prelude/Parallel.hs
3137benchmark/Streamly/Benchmark/Prelude/Rate.hs
.hlint.yaml+1−3
@@ -24,14 +24,12 @@
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}
3634- ignore: {name: "Use isDigit", within: Streamly.Internal.Unicode.Parser}
3735
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/README.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+1−1
@@ -18,7 +18,7 @@ import qualified Streamly.Data.Fold as FL
1818import qualified Streamly.Internal.Data.Stream as S
1919import qualified Streamly.Internal.Data.Stream.IsStream as Internal
2020
21−import Gauge
21+import Test.Tasty.Bench
2222import System.Random
2323
2424maxValue :: Int
benchmark/Streamly/Benchmark/Data/Array/Common.hs+6−6
@@ -71,9 +71,9 @@ onArray
7171 -> m (Stream Int)
7272onArray 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.reader
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.reader
106106
107107{-# INLINE unfoldReadDrain #-}
108108unfoldReadDrain :: MonadIO m => Stream Int -> m ()
109−unfoldReadDrain = S.drain . S.unfold A.reader
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.readRev
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/Stream.hs+34−28
@@ -27,32 +27,34 @@ module Main
2727
2828import Control.DeepSeq (NFData(..))
2929import Control.Monad (void, when)
30−import Control.Monad.Catch (MonadCatch, try, SomeException)
30+import Control.Monad.Catch (MonadCatch)
3131import Data.Functor.Identity (runIdentity)
3232import Data.Maybe (isJust)
3333import Data.Word (Word8)
3434import Streamly.Internal.Data.Stream (Stream)
35+import Streamly.Internal.Data.StreamK (StreamK)
3536import System.IO (Handle)
3637import System.Random (randomRIO)
3738import Prelude hiding ()
3839
40+import qualified Streamly.Data.Stream as Stream
3941import qualified Streamly.Internal.Data.Array as Array
40−import qualified Streamly.Internal.Data.Stream.Chunked as ArrayStream
42+import qualified Streamly.Internal.Data.Array.Stream as ArrayStream
4143import qualified Streamly.Internal.Data.Fold as Fold
4244import qualified Streamly.Internal.Data.Parser as Parser
43−import qualified Streamly.Internal.Data.Stream as S
44−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
4547import qualified Streamly.Internal.FileSystem.Handle as Handle
4648import qualified Streamly.Internal.Unicode.Stream as Unicode
4749
48−import Gauge hiding (env)
50+import Test.Tasty.Bench hiding (env)
4951import Streamly.Benchmark.Common
5052import Streamly.Benchmark.Common.Handle
5153import Control.Monad.IO.Class (MonadIO)
5254
5355#ifdef INSPECTION
54−import Streamly.Internal.Data.Unboxed (Unbox)
55−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
56+import Streamly.Internal.Data.MutByteArray (Unbox)
57+import Streamly.Internal.Data.Stream (Step(..))
5658import Test.Inspection
5759#endif
5860
@@ -63,8 +65,8 @@ import Test.Inspection
6365-- XXX these can be moved to the common module
6466
6567{-# INLINE sourceUnfoldrM #-}
66−sourceUnfoldrM :: MonadIO m => Int -> Int -> Stream m Int
67−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
6870 where
6971 step cnt =
7072 if cnt > n + value
@@ -100,7 +102,7 @@ inspect $ 'toChunksLast `hasNoType` ''Step
100102toChunksSumLengths :: Handle -> IO Int
101103toChunksSumLengths inh =
102104 let s = Handle.readChunks inh
103− in Stream.sum (Stream.map Array.length s)
105+ in Stream.fold Fold.sum (Stream.map Array.length s)
104106
105107#ifdef INSPECTION
106108inspect $ hasNoTypeClasses 'toChunksSumLengths
@@ -121,7 +123,7 @@ inspect $ 'toChunksCountBytes `hasNoType` ''Step
121123
122124toChunksDecodeUtf8Arrays :: Handle -> IO ()
123125toChunksDecodeUtf8Arrays =
124− Stream.drain . Unicode.decodeUtf8Arrays . Handle.readChunks
126+ Stream.drain . Unicode.decodeUtf8Chunks . Handle.readChunks
125127
126128#ifdef INSPECTION
127129inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
@@ -135,7 +137,9 @@ inspect $ hasNoTypeClasses 'toChunksDecodeUtf8Arrays
135137-- | Count the number of lines in a file.
136138toChunksSplitOnSuffix :: Handle -> IO Int
137139toChunksSplitOnSuffix =
138− Stream.length . ArrayStream.splitOnSuffix 10 . Handle.readChunks
140+ Stream.fold Fold.length
141+ . ArrayStream.splitOnSuffix 10
142+ . Handle.readChunks
139143
140144#ifdef INSPECTION
141145inspect $ hasNoTypeClasses 'toChunksSplitOnSuffix
@@ -145,7 +149,10 @@ inspect $ 'toChunksSplitOnSuffix `hasNoType` ''Step
145149-- XXX use a word splitting combinator instead of splitOn and test it.
146150-- | Count the number of words in a file.
147151toChunksSplitOn :: Handle -> IO Int
148−toChunksSplitOn = Stream.length . ArrayStream.splitOn 32 . Handle.readChunks
152+toChunksSplitOn =
153+ Stream.fold Fold.length
154+ . ArrayStream.splitOn 32
155+ . Handle.readChunks
149156
150157#ifdef INSPECTION
151158inspect $ hasNoTypeClasses 'toChunksSplitOn
@@ -183,8 +190,7 @@ o_1_space_read_chunked env =
183190copyChunksSplitInterposeSuffix :: Handle -> Handle -> IO ()
184191copyChunksSplitInterposeSuffix inh outh =
185192 Stream.fold (Handle.write outh)
186− $ ArrayStream.interposeSuffix 10
187− $ ArrayStream.splitOnSuffix 10
193+ $ ArrayStream.interposeSuffix 10 . ArrayStream.splitOnSuffix 10
188194 $ Handle.readChunks inh
189195
190196#ifdef INSPECTION
@@ -197,9 +203,8 @@ inspect $ 'copyChunksSplitInterposeSuffix `hasNoType` ''Step
197203copyChunksSplitInterpose :: Handle -> Handle -> IO ()
198204copyChunksSplitInterpose inh outh =
199205 Stream.fold (Handle.write outh)
200− $ ArrayStream.interpose 32
201206 -- XXX this is not correct word splitting combinator
202− $ ArrayStream.splitOn 32
207+ $ ArrayStream.interpose 32 . ArrayStream.splitOn 32
203208 $ Handle.readChunks inh
204209
205210#ifdef INSPECTION
@@ -231,25 +236,26 @@ drainWhile p = Parser.takeWhile p Fold.drain
231236
232237{-# INLINE fold #-}
233238fold :: Stream IO (Array.Array Int) -> IO ()
234−fold s = void $ ArrayStream.foldBreak Fold.drain s
239+fold s = void $ ArrayStream.foldBreak Fold.drain $ StreamK.fromStream s
235240
236241{-# INLINE parse #-}
237242parse :: Int -> Stream IO (Array.Array Int) -> IO ()
238−parse value s = void $ ArrayStream.parseBreak (drainWhile (< value)) s
243+parse value s =
244+ void $ ArrayStream.parseBreak (drainWhile (< value)) $ StreamK.fromStream s
239245
240246{-# INLINE foldBreak #-}
241−foldBreak :: Stream IO (Array.Array Int) -> IO ()
247+foldBreak :: StreamK IO (Array.Array Int) -> IO ()
242248foldBreak s = do
243249 (r, s1) <- ArrayStream.foldBreak Fold.one s
244250 when (isJust r) $ foldBreak s1
245251
246252{-# INLINE parseBreak #-}
247−parseBreak :: Stream IO (Array.Array Int) -> IO ()
253+parseBreak :: StreamK IO (Array.Array Int) -> IO ()
248254parseBreak s = do
249− r <- try $ ArrayStream.parseBreak Parser.one s
255+ r <- ArrayStream.parseBreak Parser.one s
250256 case r of
251− Left (_ :: SomeException) -> return ()
252− Right (_, s1) -> parseBreak s1
257+ (Left _, _) -> return ()
258+ (Right _, s1) -> parseBreak s1
253259
254260o_1_space_serial_array ::
255261 Int -> [Array.Array Int] -> [Array.Array Int] -> [Benchmark]
@@ -259,7 +265,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
259265 , benchIO
260266 "foldBreak (recursive, small arrays)"
261267 (\_ -> Stream.fromList arraysSmall)
262− foldBreak
268+ (foldBreak . StreamK.fromStream)
263269 , benchIO "parse (of 100)" (\_ -> Stream.fromList arraysSmall)
264270 $ parse bound
265271 , benchIO "parse (single)" (\_ -> Stream.fromList arraysBig)
@@ -267,7 +273,7 @@ o_1_space_serial_array bound arraysSmall arraysBig =
267273 , benchIO
268274 "parseBreak (recursive, small arrays)"
269275 (\_ -> Stream.fromList arraysSmall)
270− parseBreak
276+ (parseBreak . StreamK.fromStream)
271277 ]
272278
273279-------------------------------------------------------------------------------
@@ -289,8 +295,8 @@ main = do
289295 then return (undefined, undefined)
290296 else
291297 do
292− small <- Stream.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
293− big <- Stream.toList $ Stream.arraysOf value $ sourceUnfoldrM value 0
298+ small <- Stream.toList $ Stream.chunksOf 100 $ sourceUnfoldrM value 0
299+ big <- Stream.toList $ Stream.chunksOf value $ sourceUnfoldrM value 0
294300 return (small, big)
295301
296302 allBenchmarks env arrays value =
benchmark/Streamly/Benchmark/Data/Fold.hs+35−11
@@ -12,6 +12,11 @@
1212{-# OPTIONS_GHC -fno-warn-warnings-deprecations #-}
1313{-# OPTIONS_GHC -Wno-orphans #-}
1414
15+#undef FUSION_CHECK
16+#ifdef FUSION_CHECK
17+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
18+#endif
19+
1520module Main (main) where
1621
1722import Control.DeepSeq (NFData(..))
@@ -28,15 +33,15 @@ import System.Random (randomRIO)
2833import Streamly.Internal.Data.Stream (Stream)
2934import Streamly.Internal.Data.Fold (Fold(..))
3035import Streamly.Internal.Data.IsMap.HashMap ()
36+import Streamly.Internal.Data.MutArray (MutArray)
3137
32−import qualified Streamly.Internal.Data.Array.Mut.Type as MArray
3338import qualified Streamly.Internal.Data.Fold as FL
34−import qualified Streamly.Internal.Data.Fold.Container as FL
39+import qualified Streamly.Data.Fold.Prelude as Fold
3540import qualified Streamly.Internal.Data.Unfold as Unfold
3641import qualified Streamly.Internal.Data.Pipe as Pipe
3742import qualified Streamly.Internal.Data.Stream as Stream
3843
39−import Gauge
44+import Test.Tasty.Bench
4045import Streamly.Benchmark.Common
4146import Prelude hiding (all, any, take, unzip, sequence_, filter)
4247
@@ -214,7 +219,7 @@ demuxToIntMap :: Monad m =>
214219demuxToIntMap f g = Stream.fold (FL.demuxToContainer f g)
215220
216221{-# INLINE demuxToHashMap #-}
217−demuxToHashMap :: (Monad m, Ord k, Hashable k) =>
222+demuxToHashMap :: (Monad m, Hashable k) =>
218223 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
219224demuxToHashMap f g = Stream.fold (FL.demuxToContainer f g)
220225
@@ -224,7 +229,7 @@ demuxToMapIO :: (MonadIO m, Ord k) =>
224229demuxToMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
225230
226231{-# INLINE demuxToHashMapIO #-}
227−demuxToHashMapIO :: (MonadIO m, Ord k, Hashable k) =>
232+demuxToHashMapIO :: (MonadIO m, Hashable k) =>
228233 (a -> k) -> (a -> m (Fold m a b)) -> Stream m a -> m (HashMap k b)
229234demuxToHashMapIO f g = Stream.fold (FL.demuxToContainerIO f g)
230235
@@ -251,7 +256,7 @@ toIntMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
251256{-# INLINE toHashMapIO #-}
252257toHashMapIO :: (MonadIO m, Ord k, Num a, Hashable k) =>
253258 (a -> k) -> Stream m a -> m (HashMap k a)
254−toHashMapIO f = Stream.fold (FL.toContainerIO f FL.sum)
259+toHashMapIO f = Stream.fold (Fold.toHashMapIO f FL.sum)
255260
256261-------------------------------------------------------------------------------
257262-- unzip
@@ -264,13 +269,13 @@ unzip = Stream.fold $ FL.lmap (\a -> (a, a)) (FL.unzip FL.sum FL.length)
264269{-# INLINE unzipWithFstM #-}
265270unzipWithFstM :: Monad m => Stream m Int -> m (Int, Int)
266271unzipWithFstM = do
267− let f = \a -> return (a + 1, a)
272+ let f a = return (a + 1, a)
268273 Stream.fold (FL.unzipWithFstM f FL.sum FL.length)
269274
270275{-# INLINE unzipWithMinM #-}
271276unzipWithMinM :: Monad m => Stream m Int -> m (Int, Int)
272277unzipWithMinM = do
273− let f = \a -> return (a + 1, a)
278+ let f a = return (a + 1, a)
274279 Stream.fold (FL.unzipWithMinM f FL.sum FL.length)
275280
276281-------------------------------------------------------------------------------
@@ -291,7 +296,7 @@ unfoldMany val =
291296moduleName :: String
292297moduleName = "Data.Fold"
293298
294−instance NFData (MArray.Array a) where
299+instance NFData (MutArray a) where
295300 {-# INLINE rnf #-}
296301 rnf _ = ()
297302
@@ -306,7 +311,6 @@ o_1_space_serial_elimination value =
306311 , benchIOSink value "drainBy" (Stream.fold (FL.drainBy return))
307312 , benchIOSink value "drainN" (Stream.fold (FL.drainN value))
308313 , benchIOSink value "last" (Stream.fold FL.last)
309− , benchIOSink value "nub" (Stream.fold FL.nub)
310314 , benchIOSink value "length" (Stream.fold FL.length)
311315 , benchIOSink value "top" (Stream.fold $ FL.top 10)
312316 , benchIOSink value "bottom" (Stream.fold $ FL.bottom 10)
@@ -449,6 +453,7 @@ o_n_heap_serial value =
449453 , benchIOSink value "toStreamRev"
450454 (Stream.fold FL.toStreamRev
451455 :: Stream IO a -> IO (Stream Identity a))
456+ , benchIOSink value "nub" (Stream.fold FL.nub)
452457 ]
453458 , bgroup "key-value"
454459 [
@@ -502,7 +507,9 @@ o_n_heap_serial value =
502507-------------------------------------------------------------------------------
503508
504509main :: IO ()
505−main = runWithCLIOpts defaultStreamSize allBenchmarks
510+main = do
511+#ifndef FUSION_CHECK
512+ runWithCLIOpts defaultStreamSize allBenchmarks
506513
507514 where
508515
@@ -515,3 +522,20 @@ main = runWithCLIOpts defaultStreamSize allBenchmarks
515522 , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
516523 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
517524 ]
525+#else
526+ -- Enable FUSION_CHECK macro at the beginning of the file
527+ -- Enable one benchmark below, and run the benchmark
528+ -- Check the .dump-simpl output
529+ let value = 100000
530+ let input = source value 1
531+ let getKey buckets = (`mod` buckets)
532+ let getFold k =
533+ return $ case k of
534+ 0 -> FL.sum
535+ 1 -> FL.length
536+ _ -> FL.length
537+
538+ -- demuxToMap (getKey 64) (getFold . getKey 64) input
539+ toIntMapIO (getKey 64) input
540+ return ()
541+#endif
benchmark/Streamly/Benchmark/Data/Fold/Window.hs+74−58
@@ -8,21 +8,22 @@ import Streamly.Internal.Data.Stream (Stream)
88import System.Random (randomRIO)
99
1010import qualified Streamly.Data.Fold as Fold
11−import qualified Streamly.Internal.Data.Ring.Unboxed as Ring
12−import qualified Streamly.Prelude as Stream
13−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
1414
15−import Gauge
15+import Streamly.Benchmark.Common
16+import Test.Tasty.Bench
1617
1718{-# INLINE source #-}
18−source :: (Monad m, Stream.IsStream t, Num a, Stream.Enumerable a) =>
19− Int -> a -> t m a
19+source :: (Monad m, Num a, Stream.Enumerable a) =>
20+ Int -> a -> Stream m a
2021source len from =
2122 Stream.enumerateFromThenTo from (from + 1) (from + fromIntegral len)
2223
2324{-# INLINE sourceDescending #-}
24−sourceDescending :: (Monad m, Stream.IsStream t, Num a, Stream.Enumerable a) =>
25− Int -> a -> t m a
25+sourceDescending :: (Monad m, Num a, Stream.Enumerable a) =>
26+ Int -> a -> Stream m a
2627sourceDescending len from =
2728 Stream.enumerateFromThenTo
2829 (from + fromIntegral len)
@@ -30,7 +31,7 @@ sourceDescending len from =
3031 from
3132
3233{-# INLINE sourceDescendingInt #-}
33−sourceDescendingInt :: (Monad m, Stream.IsStream t) => Int -> Int -> t m Int
34+sourceDescendingInt :: Monad m => Int -> Int -> Stream m Int
3435sourceDescendingInt = sourceDescending
3536
3637{-# INLINE benchWith #-}
@@ -56,120 +57,135 @@ benchScanWith src len name f =
5657 bench name
5758 $ nfIO
5859 $ randomRIO (1, 1 :: Int)
59− >>= Stream.drain . Stream.postscan f . src len . fromIntegral
60+ >>= Stream.fold Fold.drain
61+ . Stream.postscan f
62+ . src len
63+ . fromIntegral
6064
6165{-# INLINE benchWithPostscan #-}
6266benchWithPostscan :: Int -> String -> Fold IO Double a -> Benchmark
6367benchWithPostscan = benchScanWith source
6468
65−{-# INLINE numElements #-}
66−numElements :: Int
67−numElements = 100000
68−
69−main :: IO ()
70−main =
71− defaultMain
72− [ bgroup
73− "fold"
69+o_1_space_folds :: Int -> [Benchmark]
70+o_1_space_folds numElements =
71+ [ bgroup "fold"
7472 [ benchWithFold numElements "minimum (window size 100)"
75− (Window.minimum 100)
73+ (Window.windowMinimum 100)
7674 , benchWithFold numElements "minimum (window size 1000)"
77− (Window.minimum 1000)
75+ (Window.windowMinimum 1000)
7876 , benchWith sourceDescendingInt numElements
7977 "minimum descending (window size 1000)"
80− (Window.minimum 1000)
78+ (Window.windowMinimum 1000)
8179
8280 , benchWithFold numElements "maximum (window size 100)"
83− (Window.maximum 100)
81+ (Window.windowMaximum 100)
8482 , benchWithFold numElements "maximum (window size 1000)"
85− (Window.maximum 1000)
83+ (Window.windowMaximum 1000)
8684 , benchWith sourceDescendingInt numElements
8785 "maximum descending (window size 1000)"
88− (Window.maximum 1000)
86+ (Window.windowMaximum 1000)
8987
9088 , benchWithFold numElements "range (window size 100)"
91− (Window.range 100)
89+ (Window.windowRange 100)
9290 , benchWithFold numElements "range (window size 1000)"
93− (Window.range 1000)
91+ (Window.windowRange 1000)
9492 , benchWith sourceDescendingInt numElements
9593 "range descending (window size 1000)"
96− (Window.range 1000)
94+ (Window.windowRange 1000)
9795
9896 , benchWithFoldInt numElements "sumInt (window size 100)"
99− (Ring.slidingWindow 100 Window.sumInt)
97+ (Ring.slidingWindow 100 Window.windowSumInt)
10098 , benchWithFoldInt numElements "sum for Int (window size 100)"
101− (Ring.slidingWindow 100 Window.sum)
99+ (Ring.slidingWindow 100 Window.windowSum)
102100 , benchWithFold numElements "sum (window size 100)"
103− (Ring.slidingWindow 100 Window.sum)
101+ (Ring.slidingWindow 100 Window.windowSum)
104102 , benchWithFold numElements "sum (window size 1000)"
105− (Ring.slidingWindow 1000 Window.sum)
103+ (Ring.slidingWindow 1000 Window.windowSum)
106104 , benchWithFold numElements "sum (entire stream)"
107− (Window.cumulative Window.sum)
105+ (Window.cumulative Window.windowSum)
108106 , benchWithFold numElements "sum (Data.Fold)"
109107 Fold.sum
110108
111109 , benchWithFold numElements "mean (window size 100)"
112− (Ring.slidingWindow 100 Window.mean)
110+ (Ring.slidingWindow 100 Window.windowMean)
113111 , benchWithFold numElements "mean (window size 1000)"
114− (Ring.slidingWindow 1000 Window.mean)
112+ (Ring.slidingWindow 1000 Window.windowMean)
115113 , benchWithFold numElements "mean (entire stream)"
116− (Window.cumulative Window.mean)
114+ (Window.cumulative Window.windowMean)
117115 , benchWithFold numElements "mean (Data.Fold)"
118116 Fold.mean
119117
120118 , benchWithFold numElements "powerSum 2 (window size 100)"
121− (Ring.slidingWindow 100 (Window.powerSum 2))
119+ (Ring.slidingWindow 100 (Window.windowPowerSum 2))
122120 , benchWithFold numElements "powerSum 2 (entire stream)"
123− (Window.cumulative (Window.powerSum 2))
121+ (Window.cumulative (Window.windowPowerSum 2))
124122
125123 ]
126− , bgroup
127− "scan"
124+ ]
125+
126+o_1_space_scans :: Int -> [Benchmark]
127+o_1_space_scans numElements =
128+ [ bgroup "scan"
128129 [ benchWithPostscan numElements "minimum (window size 10)"
129− (Window.minimum 10)
130+ (Window.windowMinimum 10)
130131 -- Below window size 30 the linear search based impl performs better
131132 -- than the dequeue based implementation.
132133 , benchWithPostscan numElements "minimum (window size 30)"
133− (Window.minimum 30)
134+ (Window.windowMinimum 30)
134135 , benchWithPostscan numElements "minimum (window size 1000)"
135− (Window.minimum 1000)
136+ (Window.windowMinimum 1000)
136137 , benchScanWith sourceDescendingInt numElements
137138 "minimum descending (window size 1000)"
138− (Window.minimum 1000)
139+ (Window.windowMinimum 1000)
139140
140141 , benchWithPostscan numElements "maximum (window size 10)"
141− (Window.maximum 10)
142+ (Window.windowMaximum 10)
142143 , benchWithPostscan numElements "maximum (window size 30)"
143− (Window.maximum 30)
144+ (Window.windowMaximum 30)
144145 , benchWithPostscan numElements "maximum (window size 1000)"
145− (Window.maximum 1000)
146+ (Window.windowMaximum 1000)
146147 , benchScanWith sourceDescendingInt numElements
147148 "maximum descending (window size 1000)"
148− (Window.maximum 1000)
149+ (Window.windowMaximum 1000)
149150
150151 , benchWithPostscan numElements "range (window size 10)"
151− (Window.range 10)
152+ (Window.windowRange 10)
152153 , benchWithPostscan numElements "range (window size 30)"
153− (Window.range 30)
154+ (Window.windowRange 30)
154155 , benchWithPostscan numElements "range (window size 1000)"
155− (Window.range 1000)
156+ (Window.windowRange 1000)
156157 , benchScanWith sourceDescendingInt numElements
157158 "range descending (window size 1000)"
158− (Window.range 1000)
159+ (Window.windowRange 1000)
159160
160161 , benchWithPostscan numElements "sum (window size 100)"
161− (Ring.slidingWindow 100 Window.sum)
162+ (Ring.slidingWindow 100 Window.windowSum)
162163 , benchWithPostscan numElements "sum (window size 1000)"
163− (Ring.slidingWindow 1000 Window.sum)
164+ (Ring.slidingWindow 1000 Window.windowSum)
164165
165166 , benchWithPostscan numElements "mean (window size 100)"
166− (Ring.slidingWindow 100 Window.mean)
167+ (Ring.slidingWindow 100 Window.windowMean)
167168 , benchWithPostscan numElements "mean (window size 1000)"
168− (Ring.slidingWindow 1000 Window.mean)
169+ (Ring.slidingWindow 1000 Window.windowMean)
169170
170171 , benchWithPostscan numElements "powerSum 2 (window size 100)"
171− (Ring.slidingWindow 100 (Window.powerSum 2))
172+ (Ring.slidingWindow 100 (Window.windowPowerSum 2))
172173 , benchWithPostscan numElements "powerSum 2 (window size 1000)"
173− (Ring.slidingWindow 1000 (Window.powerSum 2))
174+ (Ring.slidingWindow 1000 (Window.windowPowerSum 2))
174175 ]
175176 ]
177+
178+moduleName :: String
179+moduleName = "Data.Fold.Window"
180+
181+main :: IO ()
182+main = runWithCLIOpts defaultStreamSize allBenchmarks
183+
184+ where
185+
186+ allBenchmarks value =
187+ [ bgroup (o_1_space_prefix moduleName) $ concat
188+ [ o_1_space_folds value
189+ , o_1_space_scans value
190+ ]
191+ ]
benchmark/Streamly/Benchmark/Data/Array/Mut.hs → benchmark/Streamly/Benchmark/Data/MutArray.hsrenamed+10−11
@@ -42,19 +42,19 @@ import Prelude
4242 , id
4343 , undefined
4444 )
45+import Streamly.Internal.Data.MutArray (MutArray)
4546
4647import qualified Streamly.Internal.Data.Array as Array
47−import qualified Streamly.Internal.Data.Array.Mut as MArray
48+import qualified Streamly.Internal.Data.MutArray as MArray
4849import qualified Streamly.Internal.Data.Fold as Fold
4950import qualified Streamly.Internal.Data.Stream as Stream
50−import qualified Streamly.Prelude as IsStream (scanl1')
5151
52−import Gauge
52+import Test.Tasty.Bench
5353import Streamly.Benchmark.Common hiding (benchPureSrc)
5454
55−type Stream = MArray.Array
55+type Stream = MutArray
5656
57−instance NFData (MArray.Array a) where
57+instance NFData (MutArray a) where
5858 {-# INLINE rnf #-}
5959 rnf _ = ()
6060
@@ -153,7 +153,7 @@ scanl' value n = composeN n $ onArray value $ Stream.scan (Fold.foldl' (+) 0)
153153
154154{-# INLINE scanl1' #-}
155155scanl1' :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
156−scanl1' value n = composeN n $ onArray value $ IsStream.scanl1' (+)
156+scanl1' value n = composeN n $ onArray value $ Stream.scanl1' (+)
157157
158158{-# INLINE map #-}
159159map :: MonadIO m => Int -> Int -> Stream Int -> m (Stream Int)
@@ -181,12 +181,11 @@ unfoldReadRevDrain = drain . Stream.unfold MArray.readerRev
181181
182182{-# INLINE toStreamDRevDrain #-}
183183toStreamDRevDrain :: MonadIO m => Stream Int -> m ()
184−toStreamDRevDrain =
185− drain . Stream.fromStreamD . MArray.toStreamDRev
184+toStreamDRevDrain = drain . MArray.readRev
186185
187186{-# INLINE toStreamDDrain #-}
188187toStreamDDrain :: MonadIO m => Stream Int -> m ()
189−toStreamDDrain = drain . Stream.fromStreamD . MArray.toStreamD
188+toStreamDDrain = drain . MArray.read
190189
191190{-# INLINE unfoldFold #-}
192191unfoldFold :: MonadIO m => Stream Int -> m Int
@@ -251,7 +250,7 @@ o_1_space_transformationX4 value =
251250 ]
252251
253252o_1_space_serial_marray ::
254− Int -> (MArray.Array Int, Array.Array Int) -> [Benchmark]
253+ Int -> (MutArray Int, Array.Array Int) -> [Benchmark]
255254o_1_space_serial_marray value ~(array, indices) =
256255 [ benchIO' "partitionBy (< 0)" (const (return array))
257256 $ MArray.partitionBy (< 0)
@@ -275,7 +274,7 @@ o_1_space_serial_marray value ~(array, indices) =
275274-------------------------------------------------------------------------------
276275
277276moduleName :: String
278−moduleName = "Data.Array.Mut"
277+moduleName = "Data.MutArray"
279278
280279main :: IO ()
281280main = do
benchmark/Streamly/Benchmark/Data/Parser.hs+423−103
@@ -1,5 +1,10 @@
11{-# OPTIONS_GHC -Wno-deprecations #-}
22
3+#undef FUSION_CHECK
4+#ifdef FUSION_CHECK
5+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
6+#endif
7+
38-- |
49-- Module : Streamly.Benchmark.Data.Parser
510-- Copyright : (c) 2020 Composewell Technologies
@@ -17,33 +22,34 @@ module Main
1722 main
1823 ) where
1924
25+import Control.Applicative ((<|>))
2026import Control.DeepSeq (NFData(..))
21−import Data.Foldable (asum)
27+import Data.Function ((&))
2228import Data.Functor (($>))
23−import Data.Maybe (fromMaybe)
2429import Data.Monoid (Sum(..))
2530import GHC.Magic (inline)
2631import GHC.Magic (noinline)
2732import System.IO (Handle)
2833import System.Random (randomRIO)
29−import Streamly.Internal.Data.Parser (ParseError(..))
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)
3038import Prelude hiding
31− (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile)
39+ (any, all, take, sequence, sequence_, sequenceA, takeWhile, dropWhile, span)
3240
33−import qualified Data.Traversable as TR
34−import qualified Data.Foldable as F
3541import qualified Control.Applicative as AP
42+import qualified Data.Foldable as F
43+import qualified Data.Traversable as TR
3644import qualified Streamly.FileSystem.Handle as Handle
3745import qualified Streamly.Internal.Data.Array as Array
3846import qualified Streamly.Internal.Data.Fold as Fold
3947import qualified Streamly.Internal.Data.Parser as PR
40−import qualified Streamly.Internal.Data.Stream as Stream
41−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream (tail)
48+import qualified Streamly.Data.Stream as Stream
4249import qualified Streamly.Internal.Data.Producer as Producer
43−import qualified Streamly.Internal.Data.Producer.Source as Source
50+import qualified Streamly.Internal.Data.Stream as Stream
4451
45−import Gauge hiding (env)
46−import Streamly.Internal.Data.Stream (Stream)
52+import Test.Tasty.Bench hiding (env)
4753import Streamly.Benchmark.Common
4854import Streamly.Benchmark.Common.Handle
4955
@@ -114,18 +120,6 @@ benchIOSink value name f =
114120-- Parsers
115121-------------------------------------------------------------------------------
116122
117−{-# INLINE one #-}
118−one :: Monad m => Int -> Stream m Int -> m (Either ParseError (Maybe Int))
119−one value = Stream.parse p
120−
121− where
122−
123− p = do
124− m <- PR.fromFold Fold.one
125− case m of
126− Just i -> if i >= value then pure m else p
127− Nothing -> pure Nothing
128−
129123{-# INLINE takeBetween #-}
130124takeBetween :: Monad m => Int -> Stream m a -> m (Either ParseError ())
131125takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
@@ -134,6 +128,10 @@ takeBetween value = Stream.parse (PR.takeBetween 0 value Fold.drain)
134128takeEQ :: Monad m => Int -> Stream m a -> m (Either ParseError ())
135129takeEQ value = Stream.parse (PR.takeEQ value Fold.drain)
136130
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+
137135{-# INLINE dropWhile #-}
138136dropWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
139137dropWhile value = Stream.parse (PR.dropWhile (<= value))
@@ -141,8 +139,7 @@ dropWhile value = Stream.parse (PR.dropWhile (<= value))
141139{-# INLINE takeStartBy #-}
142140takeStartBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
143141takeStartBy value stream = do
144− stream1 <- return . fromMaybe (Stream.fromPure (value + 1)) =<< IsStream.tail stream
145− let stream2 = value `Stream.cons` stream1
142+ let stream2 = value `Stream.cons` stream
146143 Stream.parse (PR.takeStartBy (== value) Fold.drain) stream2
147144
148145takeFramedByEsc_ :: Monad m => Int -> Stream m Char -> m (Either ParseError ())
@@ -189,14 +186,26 @@ wordBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
189186wordBy value = Stream.parse (PR.wordBy (>= value) Fold.drain)
190187
191188{-# INLINE sepByWords #-}
192−sepByWords :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
193−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)
194191 where
195192 wrds p = PR.sepBy (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
196193
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+
197206{-# INLINE sepByWords1 #-}
198−sepByWords1 :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
199−sepByWords1 _ = Stream.parse (wrds even Fold.drain)
207+sepByWords1 :: Monad m => Stream m Int -> m (Either ParseError ())
208+sepByWords1 = Stream.parse (wrds even Fold.drain)
200209 where
201210 wrds p = PR.sepBy1 (PR.takeWhile (not . p) Fold.drain) (PR.dropWhile p)
202211
@@ -210,6 +219,26 @@ deintercalate _ = Stream.parse (partition even)
210219 PR.deintercalate
211220 (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
212221
222+{-# INLINE deintercalate1 #-}
223+deintercalate1 :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
224+deintercalate1 _ = Stream.parse (partition even)
225+
226+ where
227+
228+ partition p =
229+ PR.deintercalate1
230+ (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
231+
232+{-# INLINE deintercalateAll #-}
233+deintercalateAll :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
234+deintercalateAll _ = Stream.parse (partition even)
235+
236+ where
237+
238+ partition p =
239+ PR.deintercalateAll
240+ (PR.takeWhile (not . p) Fold.sum) (PR.takeWhile p Fold.sum) Fold.drain
241+
213242{-# INLINE manyWordByEven #-}
214243manyWordByEven :: Monad m => Stream m Int -> m (Either ParseError ())
215244manyWordByEven = Stream.parse (PR.many (PR.wordBy even Fold.drain) Fold.drain)
@@ -239,16 +268,44 @@ manyTill :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
239268manyTill value =
240269 Stream.parse (PR.manyTill (PR.satisfy (> 0)) (PR.satisfy (== value)) Fold.length)
241270
242−{-# INLINE splitAp #-}
243−splitAp :: Monad m
271+{-# INLINE splitAp2 #-}
272+splitAp2 :: Monad m
244273 => Int -> Stream m Int -> m (Either ParseError ((), ()))
245−splitAp value =
274+splitAp2 value =
246275 Stream.parse
247276 ((,)
248277 <$> PR.dropWhile (<= (value `div` 2))
249278 <*> PR.dropWhile (<= value)
250279 )
251280
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+
252309{-# INLINE splitApBefore #-}
253310splitApBefore :: Monad m
254311 => Int -> Stream m Int -> m (Either ParseError ())
@@ -267,10 +324,10 @@ splitApAfter value =
267324 <* PR.dropWhile (<= value)
268325 )
269326
270−{-# INLINE splitWith #-}
271−splitWith :: Monad m
327+{-# INLINE splitWith2 #-}
328+splitWith2 :: Monad m
272329 => Int -> Stream m Int -> m (Either ParseError ((), ()))
273−splitWith value =
330+splitWith2 value =
274331 Stream.parse
275332 (PR.splitWith (,)
276333 (PR.dropWhile (<= (value `div` 2)))
@@ -287,6 +344,157 @@ split_ value =
287344 (PR.dropWhile (<= value))
288345 )
289346
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+
290498{-# INLINE takeEndBy_ #-}
291499takeEndBy_ :: Monad m
292500 => Int -> Stream m Int -> m (Either ParseError ())
@@ -334,6 +542,24 @@ longestAllAny value =
334542 )
335543-}
336544
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+
337563parseManyChunksOfSum :: Int -> Handle -> IO Int
338564parseManyChunksOfSum n inh =
339565 Stream.fold Fold.length
@@ -341,22 +567,6 @@ parseManyChunksOfSum n inh =
341567 (PR.fromFold $ Fold.take n Fold.sum)
342568 (Stream.unfold Handle.reader inh)
343569
344−-------------------------------------------------------------------------------
345−-- Parsing with unfolds
346−-------------------------------------------------------------------------------
347−
348−{-# INLINE parseManyUnfoldArrays #-}
349−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
350−parseManyUnfoldArrays count arrays = do
351− let src = Source.source (Just (Producer.OuterLoop arrays))
352− let parser = PR.fromFold (Fold.take count Fold.drain)
353− let readSrc =
354− Source.producer
355− $ Producer.concat Producer.fromList Array.producer
356− let streamParser =
357− Producer.simplify (Source.parseMany parser readSrc)
358− Stream.fold Fold.drain $ Stream.unfold streamParser src
359−
360570-------------------------------------------------------------------------------
361571-- Parsers in which -fspec-constr-recursive=16 is problematic
362572-------------------------------------------------------------------------------
@@ -370,17 +580,20 @@ lookAhead :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
370580lookAhead value =
371581 Stream.parse (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
372582
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
373590{-# INLINE sequenceA #-}
374591sequenceA :: Monad m => Int -> Stream m Int -> m Int
375592sequenceA value xs = do
376593 x <- Stream.parse (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
377594 return $ length x
378595
379−{-# INLINE sequenceA_ #-}
380−sequenceA_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
381−sequenceA_ value =
382− Stream.parse (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
383−
596+-- quadratic complexity
384597{-# INLINE sequence #-}
385598sequence :: Monad m => Int -> Stream m Int -> m Int
386599sequence value xs = do
@@ -389,13 +602,21 @@ sequence value xs = do
389602
390603{-# INLINE sequence_ #-}
391604sequence_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
392−sequence_ value =
393− Stream.parse (F.sequence_ $ replicate value (PR.satisfy (> 0)))
605+sequence_ value xs =
606+ Stream.parse (foldr f (return ()) (replicate value (PR.takeBetween 0 1 Fold.drain))) xs
607+
608+ where
609+
610+ {-# INLINE f #-}
611+ f m k = m >>= (\_ -> k)
394612
613+-- choice using the "Alternative" instance with direct style parser type has
614+-- quadratic performance complexity.
615+--
395616{-# INLINE choiceAsum #-}
396617choiceAsum :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
397618choiceAsum value =
398− Stream.parse (asum (replicate value (PR.satisfy (< 0)))
619+ Stream.parse (F.asum (replicate value (PR.satisfy (< 0)))
399620 AP.<|> PR.satisfy (> 0))
400621
401622{-
@@ -406,6 +627,22 @@ choice value =
406627 (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
407628-}
408629
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+
409646-------------------------------------------------------------------------------
410647-- Stream transformation
411648-------------------------------------------------------------------------------
@@ -418,6 +655,35 @@ parseMany n =
418655 . Stream.catRights . Stream.parseMany (PR.fromFold $ Fold.take n Fold.mconcat)
419656 . fmap Sum
420657
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+
421687{-# INLINE parseIterate #-}
422688parseIterate :: Monad m => Int -> Stream m Int -> m ()
423689parseIterate n =
@@ -429,22 +695,10 @@ parseIterate n =
429695 (Sum 0)
430696 . fmap Sum
431697
432−{-# INLINE parseBreak #-}
433−parseBreak :: Monad m => Stream m Int -> m ()
434−parseBreak s = do
435− r <- Stream.parseBreak PR.one s
436− case r of
437− (Left _, _) -> return ()
438− (Right _, s1) -> parseBreak s1
439−
440698{-# INLINE concatSequence #-}
441699concatSequence :: Monad m => Stream m Int -> m (Either ParseError ())
442−concatSequence = Stream.parse $ PR.concatSequence Fold.drain $ Stream.repeat PR.one
443−
444−{-# INLINE parseManyGroupBy #-}
445−parseManyGroupBy :: Monad m => (Int -> Int -> Bool) -> Stream m Int -> m ()
446−parseManyGroupBy cmp =
447− Stream.fold Fold.drain . Stream.parseMany (PR.groupBy cmp Fold.drain)
700+concatSequence =
701+ Stream.parse $ PR.sequence (Stream.repeat PR.one) Fold.drain
448702
449703-------------------------------------------------------------------------------
450704-- Benchmarks
@@ -459,49 +713,84 @@ instance NFData ParseError where
459713
460714o_1_space_serial :: Int -> [Benchmark]
461715o_1_space_serial value =
462− [ benchIOSink value "one (fold)" $ one value
463− , benchIOSink value "takeBetween" $ takeBetween value
464− , benchIOSink value "takeEQ" $ takeEQ value
716+ [ benchIOSink value "takeBetween" $ takeBetween value
465717 , benchIOSink value "takeWhile" $ takeWhile value
466718 , benchIOSink value "takeWhileP" $ takeWhileP value
467719 , benchIOSink value "takeP" $ takeP value
468720 , benchIOSink value "dropWhile" $ dropWhile value
469721 , benchIOSink value "takeStartBy" $ takeStartBy value
470− , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
471− $ takeFramedByEsc_ value
722+ , benchIOSink value "takeEndBy_" $ takeEndBy_ value
472723 , benchIOSink value "groupBy" $ groupBy
473724 , benchIOSink value "groupByRolling" $ groupByRolling
474725 , benchIOSink value "wordBy" $ wordBy value
475− , benchIOSink value "sepBy (words)" $ sepByWords value
476− , benchIOSink value "sepBy1 (words)" $ sepByWords1 value
726+ , benchIOSink value "sepBy (words)" sepByWords
727+ , benchIOSink value "sepByAll (words)" sepByAllWords
728+ , benchIOSink value "sepBy1 (words)" sepByWords1
477729 , benchIOSink value "deintercalate" $ deintercalate value
478− , 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
479736 , benchIOSink value "splitApBefore" $ splitApBefore value
480737 , benchIOSink value "splitApAfter" $ splitApAfter value
481− , benchIOSink value "splitWith" $ splitWith value
482− , 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
483751 , benchIOSink value "many" many
484752 , benchIOSink value "many (wordBy even)" $ manyWordByEven
485753 , benchIOSink value "some" some
486754 , 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
487773 {-
488774 , benchIOSink value "tee" $ teeAllAny value
489775 , benchIOSink value "teeFst" $ teeFstAllAny value
490776 , benchIOSink value "shortest" $ shortestAllAny value
491777 , benchIOSink value "longest" $ longestAllAny value
492778 -}
493− , benchIOSink value "parseBreak (recursive)" parseBreak
494− , benchIOSink value "parseMany (take 1)" (parseMany 1)
495− , benchIOSink value "parseMany (take all)" (parseMany value)
496− , benchIOSink value "parseIterate (take 1)" (parseIterate 1)
497− , benchIOSink value "parseIterate (take all)" (parseIterate value)
498− , benchIOSink value "concatSequence" concatSequence
499− , benchIOSink value "parseMany (groupBy (<))" (parseManyGroupBy (<))
500− , benchIOSink value "parseMany (groupBy (==))" (parseManyGroupBy (==))
501− , benchIOSink value "listEqBy" (listEqBy value)
502779 , benchIOSink value "streamEqBy" (streamEqBy value)
503780 ]
504781
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+
505794o_1_space_filesystem :: BenchEnv -> [Benchmark]
506795o_1_space_filesystem env =
507796 [ mkBench ("S.parseMany (Fold.take " ++ show (bigSize env) ++ " Fold.sum)") env
@@ -521,26 +810,38 @@ o_1_space_serial_unfold bound arrays =
521810o_n_heap_serial :: Int -> [Benchmark]
522811o_n_heap_serial value =
523812 [
813+ benchIOSink value "takeEQ" $ takeEQ value
814+ , benchIOSink value "takeGE" $ takeGE value
815+
524816 -- lookahead benchmark holds the entire input till end
525− benchIOSink value "lookAhead" $ lookAhead value
817+ , benchIOSink value "lookAhead" $ lookAhead value
526818
527− -- accumulates the results in a list
528− , benchIOSink value "sequence" $ sequence value
529− , benchIOSink value "sequenceA" $ sequenceA value
819+ -- o-n-heap because of backtracking
820+ , benchIOSrc sourceEscapedFrames value "takeFramedByEsc_"
821+ $ takeFramedByEsc_ value
530822
531− -- XXX why should this take O(n) heap, it discards the results?
532− , benchIOSink value "sequence_" $ sequence_ value
533− , benchIOSink value "sequenceA_" $ sequenceA_ value
534823 -- non-linear time complexity (parserD)
535824 , benchIOSink value "split_" $ split_ value
536− -- XXX why O(n) heap?
537− , benchIOSink value "choice (asum)" $ choiceAsum value
538− -- , benchIOSink value "choice" $ choice value
825+ -- XXX Takes lot of space when run on a long stream, why?
826+ , benchIOSink value "monad16" $ monad16 value
539827
540828 -- These show non-linear time complexity.
541829 -- They accumulate the results in a list.
830+ , benchIOSink value "sepBy1" sepBy1
542831 , benchIOSink value "manyAlt" manyAlt
543832 , 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)
544845 ]
545846
546847-------------------------------------------------------------------------------
@@ -549,12 +850,13 @@ o_n_heap_serial value =
549850
550851main :: IO ()
551852main = do
853+#ifndef FUSION_CHECK
552854 env <- mkHandleBenchEnv
553855 runWithCLIOptsEnv defaultStreamSize alloc (allBenchmarks env)
554856
555857 where
556858
557− 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
558860
559861 allBenchmarks env arrays value =
560862 [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
@@ -564,4 +866,22 @@ main = do
564866 , bgroup (o_1_space_prefix moduleName)
565867 (o_1_space_serial_unfold value arrays)
566868 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
869+ , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
567870 ]
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−462
@@ -1,462 +0,0 @@
1−{-# OPTIONS_GHC -Wno-deprecations #-}
2−
3−-- |
4−-- Module : Streamly.Benchmark.Data.ParserD
5−-- Copyright : (c) 2020 Composewell Technologies
6−--
7−-- License : BSD-3-Clause
8−-- Maintainer : streamly@composewell.com
9−
10−{-# LANGUAGE FlexibleContexts #-}
11−{-# LANGUAGE ScopedTypeVariables #-}
12−{-# OPTIONS_GHC -fspec-constr-recursive=4 #-}
13−{-# OPTIONS_GHC -Wno-orphans #-}
14−
15−module Main
16− (
17− main
18− ) where
19−
20−import Control.DeepSeq (NFData(..))
21−import Data.Foldable (asum)
22−import Data.Function ((&))
23−import Data.Functor (($>))
24−import Data.Maybe (fromMaybe)
25−import Streamly.Internal.Data.Stream (Stream)
26−import Streamly.Internal.Data.Parser (ParseError(..))
27−import System.Random (randomRIO)
28−import Prelude hiding (any, all, take, sequence, sequenceA, sequence_, takeWhile, span)
29−
30−import qualified Data.Traversable as TR
31−import qualified Data.Foldable as F
32−import qualified Control.Applicative as AP
33−import qualified Streamly.Internal.Data.Array as Array
34−import qualified Streamly.Internal.Data.Fold as Fold
35−import qualified Streamly.Internal.Data.Parser.ParserD as PR
36−import qualified Streamly.Internal.Data.Producer as Producer
37−import qualified Streamly.Internal.Data.Producer.Source as Source
38−import qualified Streamly.Internal.Data.Stream as Stream
39−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream (tail)
40−import qualified Streamly.Internal.Data.Stream.StreamD as D
41−
42−import Gauge
43−import Streamly.Benchmark.Common
44−
45−-------------------------------------------------------------------------------
46−-- Utilities
47−-------------------------------------------------------------------------------
48−
49−-- XXX these can be moved to the common module
50−
51−{-# INLINE sourceUnfoldrM #-}
52−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
53−sourceUnfoldrM value n = Stream.unfoldrM step n
54− where
55− step cnt =
56− if cnt > n + value
57− then return Nothing
58− else return (Just (cnt, cnt + 1))
59−
60−-- | Takes a fold method, and uses it with a default source.
61−{-# INLINE benchIOSink #-}
62−benchIOSink
63− :: (NFData b)
64− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
65−benchIOSink value name f =
66− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
67−
68−-------------------------------------------------------------------------------
69−-- Parsers
70−-------------------------------------------------------------------------------
71−
72−{-# INLINE listEqBy #-}
73−listEqBy :: Int -> Stream IO Int -> IO (Either ParseError [Int])
74−listEqBy len = Stream.parseD (PR.listEqBy (==) [1 .. len])
75−
76−{-# INLINE streamEqBy #-}
77−streamEqBy :: Int -> Stream IO Int -> IO (Either ParseError ())
78−streamEqBy len = Stream.parseD (PR.streamEqBy (==) (D.enumerateFromToIntegral 1 len))
79−
80−{-# INLINE drainWhile #-}
81−drainWhile :: Monad m => (a -> Bool) -> PR.Parser a m ()
82−drainWhile p = PR.takeWhile p Fold.drain
83−
84−{-# INLINE takeStartBy #-}
85−takeStartBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
86−takeStartBy value stream = do
87− stream1 <- return . fromMaybe (Stream.fromPure (value + 1)) =<< IsStream.tail stream
88− let stream2 = value `Stream.cons` stream1
89− Stream.parseD (PR.takeStartBy (== value) Fold.drain) stream2
90−
91−{-# INLINE takeWhile #-}
92−takeWhile :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
93−takeWhile value = Stream.parseD (drainWhile (<= value))
94−
95−{-# INLINE takeP #-}
96−takeP :: Monad m => Int -> Stream m a -> m (Either ParseError ())
97−takeP value = Stream.parseD (PR.takeP value (PR.fromFold Fold.drain))
98−
99−{-# INLINE takeBetween #-}
100−takeBetween :: Monad m => Int -> Stream m a -> m (Either ParseError ())
101−takeBetween value = Stream.parseD (PR.takeBetween 0 value Fold.drain)
102−
103−{-# INLINE groupBy #-}
104−groupBy :: Monad m => Stream m Int -> m (Either ParseError ())
105−groupBy = Stream.parseD (PR.groupBy (<=) Fold.drain)
106−
107−{-# INLINE groupByRolling #-}
108−groupByRolling :: Monad m => Stream m Int -> m (Either ParseError ())
109−groupByRolling = Stream.parseD (PR.groupByRolling (<=) Fold.drain)
110−
111−{-# INLINE wordBy #-}
112−wordBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
113−wordBy value = Stream.parseD (PR.wordBy (>= value) Fold.drain)
114−
115−{-# INLINE manyWordByEven #-}
116−manyWordByEven :: Monad m => Stream m Int -> m (Either ParseError ())
117−manyWordByEven =
118− Stream.parseD (PR.many (PR.wordBy (Prelude.even) Fold.drain) Fold.drain)
119−
120−{-# INLINE many #-}
121−many :: Monad m => Stream m Int -> m (Either ParseError Int)
122−many = Stream.parseD (PR.many (PR.satisfy (> 0)) Fold.length)
123−
124−{-# INLINE manyAlt #-}
125−manyAlt :: Monad m => Stream m Int -> m Int
126−manyAlt xs = do
127− x <- Stream.parseD (AP.many (PR.satisfy (> 0))) xs
128− return $ Prelude.length x
129−
130−{-# INLINE some #-}
131−some :: Monad m => Stream m Int -> m (Either ParseError Int)
132−some = Stream.parseD (PR.some (PR.satisfy (> 0)) Fold.length)
133−
134−{-# INLINE someAlt #-}
135−someAlt :: Monad m => Stream m Int -> m Int
136−someAlt xs = do
137− x <- Stream.parseD (AP.some (PR.satisfy (> 0))) xs
138− return $ Prelude.length x
139−
140−{-#INLINE takeEndBy_ #-}
141−takeEndBy_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
142−takeEndBy_ value = Stream.parseD (PR.takeEndBy_ (>= value) (PR.fromFold Fold.drain))
143−
144−{-# INLINE manyTill #-}
145−manyTill :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
146−manyTill value =
147− let p = PR.satisfy (> 0)
148− pcond = PR.satisfy (== value)
149− in Stream.parseD (PR.manyTill p pcond Fold.length)
150−
151−{-# INLINE splitWith #-}
152−splitWith :: Monad m
153− => Int -> Stream m Int -> m (Either ParseError ((), ()))
154−splitWith value =
155− Stream.parseD
156− ((,)
157− <$> drainWhile (<= (value `div` 2))
158− <*> drainWhile (<= value)
159− )
160−
161−{-
162−{-# INLINE teeAllAny #-}
163−teeAllAny :: Monad m
164− => Int -> Stream m Int -> m ((), ())
165−teeAllAny value =
166− Stream.parseD
167− (PR.teeWith (,)
168− (drainWhile (<= value))
169− (drainWhile (<= value))
170− )
171−
172−{-# INLINE teeFstAllAny #-}
173−teeFstAllAny :: Monad m
174− => Int -> Stream m Int -> m ((), ())
175−teeFstAllAny value =
176− Stream.parseD
177− (PR.teeWithFst (,)
178− (drainWhile (<= value))
179− (drainWhile (<= value))
180− )
181−
182−{-# INLINE shortestAllAny #-}
183−shortestAllAny :: Monad m
184− => Int -> Stream m Int -> m ()
185−shortestAllAny value =
186− Stream.parseD
187− (PR.shortest
188− (drainWhile (<= value))
189− (drainWhile (<= value))
190− )
191−
192−{-# INLINE longestAllAny #-}
193−longestAllAny :: Monad m
194− => Int -> Stream m Int -> m ()
195−longestAllAny value =
196− Stream.parseD
197− (PR.longest
198− (drainWhile (<= value))
199− (drainWhile (<= value))
200− )
201−-}
202−
203−{-# INLINE sequenceParser #-}
204−sequenceParser :: Monad m => Stream m Int -> m (Either ParseError ())
205−sequenceParser = Stream.parseD (PR.sequence (D.repeat (PR.satisfy $ const True)) Fold.drain)
206−
207−-------------------------------------------------------------------------------
208−-- Spanning
209−-------------------------------------------------------------------------------
210−
211−{-# INLINE span #-}
212−span :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
213−span value = Stream.parseD (PR.span (<= (value `div` 2)) Fold.drain Fold.drain)
214−
215−{-# INLINE spanBy #-}
216−spanBy :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
217−spanBy value =
218− Stream.parseD (PR.spanBy (\_ i -> i <= (value `div` 2)) Fold.drain Fold.drain)
219−
220−{-# INLINE spanByRolling #-}
221−spanByRolling :: Monad m => Int -> Stream m Int -> m (Either ParseError ((), ()))
222−spanByRolling value =
223− Stream.parseD (PR.spanByRolling (\_ i -> i <= value `div` 2) Fold.drain Fold.drain)
224−
225−-------------------------------------------------------------------------------
226−-- Nested
227−-------------------------------------------------------------------------------
228−
229−{-# INLINE parseMany #-}
230−parseMany :: Monad m => Int -> Stream m Int -> m ()
231−parseMany value = Stream.fold Fold.drain . Stream.parseManyD (drainWhile (<= value + 1))
232−
233−{-# INLINE parseManyGroups #-}
234−parseManyGroups :: Monad m => Bool -> Stream m Int -> m ()
235−parseManyGroups b = Stream.fold Fold.drain . Stream.parseManyD (PR.groupBy (\_ _ -> b) Fold.drain)
236−
237−{-# INLINE parseManyGroupsRolling #-}
238−parseManyGroupsRolling :: Monad m => Bool -> Stream m Int -> m ()
239−parseManyGroupsRolling b =
240− Stream.fold Fold.drain . Stream.parseManyD (PR.groupByRolling (\_ _ -> b) Fold.drain)
241−
242−{-# INLINE parseManyGroupsRollingEither #-}
243−parseManyGroupsRollingEither :: Monad m =>
244− (Int -> Int -> Bool) -> Int -> m ()
245−parseManyGroupsRollingEither cmp value = do
246− sourceUnfoldrM value 1
247− & Stream.parseManyD (PR.groupByRollingEither cmp Fold.drain Fold.drain)
248− & Stream.fold Fold.drain
249−
250−{-# INLINE parseManyGroupsRollingEitherAlt #-}
251−parseManyGroupsRollingEitherAlt :: Monad m =>
252− (Int -> Int -> Bool) -> Int -> m ()
253−parseManyGroupsRollingEitherAlt cmp value = do
254− sourceUnfoldrM value 1
255− -- Make the input unsorted.
256− & fmap (\x -> if even x then x + 2 else x)
257− & Stream.parseManyD (PR.groupByRollingEither cmp Fold.drain Fold.drain)
258− & Stream.fold Fold.drain
259−
260−-------------------------------------------------------------------------------
261−-- Parsing with unfolds
262−-------------------------------------------------------------------------------
263−
264−{-# INLINE parseManyUnfoldArrays #-}
265−parseManyUnfoldArrays :: Int -> [Array.Array Int] -> IO ()
266−parseManyUnfoldArrays count arrays = do
267− let src = Source.source (Just (Producer.OuterLoop arrays))
268− let parser = PR.fromFold (Fold.take count Fold.drain)
269− let readSrc =
270− Source.producer
271− $ Producer.concat Producer.fromList Array.producer
272− let streamParser =
273− Producer.simplify (Source.parseManyD parser readSrc)
274− Stream.fold Fold.drain $ Stream.unfold streamParser src
275−
276−-------------------------------------------------------------------------------
277−-- Parsers in which -fspec-constr-recursive=16 is problematic
278−-------------------------------------------------------------------------------
279−
280−-- XXX -fspec-constr-recursive=16 makes GHC go beserk when compiling these.
281−-- We need to fix GHC so that we can have better control over that option or do
282−-- not have to rely on it.
283−--
284−{-# INLINE lookAhead #-}
285−lookAhead :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
286−lookAhead value =
287− Stream.parseD (PR.lookAhead (PR.takeWhile (<= value) Fold.drain) $> ())
288−
289−-- XXX The timing of this increased 3x after the stepify extract changes.
290−{-# INLINE sequenceA_ #-}
291−sequenceA_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
292−sequenceA_ value =
293− Stream.parseD (F.sequenceA_ $ replicate value (PR.satisfy (> 0)))
294−
295−-- quadratic complexity
296−{-# INLINE sequenceA #-}
297−sequenceA :: Monad m => Int -> Stream m Int -> m Int
298−sequenceA value xs = do
299− x <- Stream.parseD (TR.sequenceA (replicate value (PR.satisfy (> 0)))) xs
300− return $ length x
301−
302−-- quadratic complexity
303−{-# INLINE sequence #-}
304−sequence :: Monad m => Int -> Stream m Int -> m Int
305−sequence value xs = do
306− x <- Stream.parseD (TR.sequence (replicate value (PR.satisfy (> 0)))) xs
307− return $ length x
308−
309−{-# INLINE sequence_ #-}
310−sequence_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
311−sequence_ value xs =
312− Stream.parseD (foldr f (return ()) (replicate value (PR.takeBetween 0 1 Fold.drain))) xs
313−
314− where
315−
316− {-# INLINE f #-}
317− f m k = m >>= (\_ -> k)
318−
319−-- choice using the "Alternative" instance with direct style parser type has
320−-- quadratic performance complexity.
321−--
322−{-# INLINE choiceAsum #-}
323−choiceAsum :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
324−choiceAsum value =
325− Stream.parseD (asum (replicate value (PR.satisfy (< 0)))
326− AP.<|> PR.satisfy (> 0))
327−
328−{-
329−{-# INLINE choice #-}
330−choice :: Monad m => Int -> Stream m Int -> m Int
331−choice value =
332− Stream.parseD
333− (PR.choice (replicate value (PR.satisfy (< 0))) AP.<|> PR.satisfy (> 0))
334−-}
335−
336−-------------------------------------------------------------------------------
337−-- Benchmarks
338−-------------------------------------------------------------------------------
339−
340−moduleName :: String
341−moduleName = "Data.Parser.ParserD"
342−
343−instance NFData ParseError where
344− {-# INLINE rnf #-}
345− rnf (ParseError x) = rnf x
346−
347−o_1_space_serial :: Int -> [Benchmark]
348−o_1_space_serial value =
349− [ benchIOSink value "takeWhile" $ takeWhile value
350− , benchIOSink value "takeP" $ takeP value
351− , benchIOSink value "takeBetween" $ takeBetween value
352− , benchIOSink value "takeStartBy" $ takeStartBy value
353− , benchIOSink value "groupBy" $ groupBy
354− , benchIOSink value "groupByRolling" $ groupByRolling
355− , benchIOSink value "wordBy" $ wordBy value
356− , benchIOSink value "splitWith" $ splitWith value
357− , benchIOSink value "many" many
358− , benchIOSink value "many (wordBy even)" $ manyWordByEven
359− , benchIOSink value "some" some
360− , benchIOSink value "takeEndBy_" $ takeEndBy_ value
361− , benchIOSink value "manyTill" $ manyTill value
362− {-
363− , benchIOSink value "tee (all,any)" $ teeAllAny value
364− , benchIOSink value "teeFst (all,any)" $ teeFstAllAny value
365− , benchIOSink value "shortest (all,any)" $ shortestAllAny value
366− , benchIOSink value "longest (all,any)" $ longestAllAny value
367− -}
368− , benchIOSink value "sequenceParser" sequenceParser
369− , benchIOSink value "listEqBy" (listEqBy value)
370− , benchIOSink value "streamEqBy" (streamEqBy value)
371− ]
372−
373−o_1_space_serial_spanning :: Int -> [Benchmark]
374−o_1_space_serial_spanning value =
375− [ benchIOSink value "span" $ span value
376− , benchIOSink value "spanBy" $ spanBy value
377− , benchIOSink value "spanByRolling" $ spanByRolling value
378− ]
379−
380−o_1_space_serial_nested :: Int -> [Benchmark]
381−o_1_space_serial_nested value =
382− [ benchIOSink value "parseMany" $ parseMany value
383− , benchIOSink value "parseMany groupBy (bound groups)"
384− $ parseManyGroups False
385− , benchIOSink value "parseMany groupRollingBy (bound groups)"
386− $ parseManyGroupsRolling False
387− , benchIOSink value "parseMany groupBy (1 group)" $ parseManyGroups True
388− , benchIOSink value "parseMany groupRollingBy (1 group)"
389− $ parseManyGroupsRolling True
390− , bench "parseMany groupRollingByEither (Left)"
391− $ nfIO $ parseManyGroupsRollingEitherLeft
392− , bench "parseMany groupRollingByEither (Right)"
393− $ nfIO $ parseManyGroupsRollingEitherRight
394− , bench "parseMany groupRollingByEither (Alternating)"
395− $ nfIO $ parseManyGroupsRollingEitherAlt1
396− ]
397−
398− where
399−
400− {-# NOINLINE parseManyGroupsRollingEitherLeft #-}
401− parseManyGroupsRollingEitherLeft = parseManyGroupsRollingEither (<) value
402−
403− {-# NOINLINE parseManyGroupsRollingEitherRight #-}
404− parseManyGroupsRollingEitherRight = parseManyGroupsRollingEither (>) value
405−
406− {-# NOINLINE parseManyGroupsRollingEitherAlt1 #-}
407− parseManyGroupsRollingEitherAlt1 =
408− parseManyGroupsRollingEitherAlt (>) value
409−
410−o_1_space_serial_unfold :: Int -> [Array.Array Int] -> [Benchmark]
411−o_1_space_serial_unfold bound arrays =
412− [ bench "parseMany/Unfold/1000 arrays/1 parse"
413− $ nfIO $ parseManyUnfoldArrays bound arrays
414− , bench "parseMany/Unfold/1000 arrays/100000 parses"
415− $ nfIO $ parseManyUnfoldArrays 1 arrays
416− ]
417−
418−o_n_heap_serial :: Int -> [Benchmark]
419−o_n_heap_serial value =
420− [
421− -- lookahead benchmark holds the entire input till end
422− benchIOSink value "lookAhead" $ lookAhead value
423−
424− -- These show non-linear time complexity
425− -- They accumulate the results in a list.
426− , benchIOSink value "manyAlt" manyAlt
427− , benchIOSink value "someAlt" someAlt
428− ]
429−
430−-- accumulate results in a list in IO
431−o_n_space_serial :: Int -> [Benchmark]
432−o_n_space_serial value =
433− [ benchIOSink value "sequenceA/100" $ sequenceA (value `div` 100)
434− , benchIOSink value "sequenceA_/100" $ sequenceA_ (value `div` 100)
435− , benchIOSink value "sequence/100" $ sequence (value `div` 100)
436− , benchIOSink value "sequence_/100" $ sequence_ (value `div` 100)
437− , benchIOSink value "choice (asum)/100" $ choiceAsum (value `div` 100)
438− -- , benchIOSink value "choice/100" $ choice (value `div` 100)
439− ]
440−
441−-------------------------------------------------------------------------------
442−-- Driver
443−-------------------------------------------------------------------------------
444−
445−main :: IO ()
446−main = do
447− x <- randomRIO (1,1)
448− runWithCLIOptsEnv (defaultStreamSize + x) alloc allBenchmarks
449−
450− where
451−
452− alloc value = Stream.fold Fold.toList $ Stream.arraysOf 100 $ sourceUnfoldrM value 0
453−
454− allBenchmarks arraysSmall value =
455− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
456− , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_spanning value)
457− , bgroup (o_1_space_prefix moduleName) (o_1_space_serial_nested value)
458− , bgroup (o_1_space_prefix moduleName)
459− (o_1_space_serial_unfold value arraysSmall)
460− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
461− , bgroup (o_n_space_prefix moduleName) (o_n_space_serial value)
462− ]
benchmark/Streamly/Benchmark/Data/Parser/ParserK.hsdeleted−167
@@ -1,167 +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−{-# OPTIONS_GHC -Wno-orphans #-}
11−
12−module Main
13− (
14− main
15− ) where
16−
17−import Control.DeepSeq (NFData(..))
18−import Data.Foldable (asum)
19−import Streamly.Internal.Data.Parser (ParseError(..))
20−import Streamly.Internal.Data.Stream (Stream)
21−import System.Random (randomRIO)
22−import Prelude hiding (any, all, take, sequence, sequenceA, takeWhile)
23−
24−import qualified Control.Applicative as AP
25−import qualified Data.Foldable as F
26−import qualified Data.Traversable as TR
27−import qualified Streamly.Internal.Data.Fold as FL
28−import qualified Streamly.Internal.Data.Parser.ParserK.Type as PR
29−import qualified Streamly.Internal.Data.Parser.ParserD as PRD
30−import qualified Streamly.Internal.Data.Stream as Stream
31−
32−import Gauge
33−import Streamly.Benchmark.Common
34−
35−-------------------------------------------------------------------------------
36−-- Utilities
37−-------------------------------------------------------------------------------
38−
39−-- XXX these can be moved to the common module
40−
41−{-# INLINE sourceUnfoldrM #-}
42−sourceUnfoldrM :: Monad m => Int -> Int -> Stream m Int
43−sourceUnfoldrM value n = Stream.unfoldrM step n
44− where
45− step cnt =
46− if cnt > n + value
47− then return Nothing
48− else return (Just (cnt, cnt + 1))
49−
50−-- | Takes a fold method, and uses it with a default source.
51−{-# INLINE benchIOSink #-}
52−benchIOSink
53− :: NFData b
54− => Int -> String -> (Stream IO Int -> IO b) -> Benchmark
55−benchIOSink value name f =
56− bench name $ nfIO $ randomRIO (1,1) >>= f . sourceUnfoldrM value
57−
58−-------------------------------------------------------------------------------
59−-- Parsers
60−-------------------------------------------------------------------------------
61−
62−#ifdef FROM_PARSERK
63−#define PARSE_OP (Stream.parseD . PRD.fromParserK)
64−#else
65−#define PARSE_OP Stream.parseK
66−#endif
67−
68−{-# INLINE satisfy #-}
69−satisfy :: Monad m => (a -> Bool) -> PR.Parser a m a
70−satisfy = PRD.toParserK . PRD.satisfy
71−
72−{-# INLINE takeWhile #-}
73−takeWhile :: Monad m => (a -> Bool) -> PR.Parser a m ()
74−takeWhile p = PRD.toParserK $ PRD.takeWhile p FL.drain
75−
76−{-# INLINE takeWhileK #-}
77−takeWhileK :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
78−takeWhileK value = PARSE_OP (takeWhile (<= value))
79−
80−{-# INLINE splitApp #-}
81−splitApp :: Monad m
82− => Int -> Stream m Int -> m (Either ParseError ((), ()))
83−splitApp value =
84− PARSE_OP ((,) <$> takeWhile (<= (value `div` 2)) <*> takeWhile (<= value))
85−
86−{-# INLINE sequenceA #-}
87−sequenceA :: Monad m => Int -> Stream m Int -> m Int
88−sequenceA value xs = do
89− let parser = satisfy (> 0)
90− list = Prelude.replicate value parser
91− x <- PARSE_OP (TR.sequenceA list) xs
92− return $ Prelude.length x
93−
94−{-# INLINE sequenceA_ #-}
95−sequenceA_ :: Monad m => Int -> Stream m Int -> m (Either ParseError ())
96−sequenceA_ value xs = do
97− let parser = satisfy (> 0)
98− list = Prelude.replicate value parser
99− PARSE_OP (F.sequenceA_ list) xs
100−
101−{-# INLINE sequence #-}
102−sequence :: Monad m => Int -> Stream m Int -> m Int
103−sequence value xs = do
104− let parser = satisfy (> 0)
105− list = Prelude.replicate value parser
106− x <- PARSE_OP (TR.sequence list) xs
107− return $ Prelude.length x
108−
109−{-# INLINE manyAlt #-}
110−manyAlt :: Monad m => Stream m Int -> m Int
111−manyAlt xs = do
112− x <- PARSE_OP (AP.many (satisfy (> 0))) xs
113− return $ Prelude.length x
114−
115−{-# INLINE someAlt #-}
116−someAlt :: Monad m => Stream m Int -> m Int
117−someAlt xs = do
118− x <- PARSE_OP (AP.some (satisfy (> 0))) xs
119− return $ Prelude.length x
120−
121−{-# INLINE choice #-}
122−choice :: Monad m => Int -> Stream m Int -> m (Either ParseError Int)
123−choice value =
124− PARSE_OP (asum (replicate value (satisfy (< 0)))
125− AP.<|> satisfy (> 0))
126−
127−-------------------------------------------------------------------------------
128−-- Benchmarks
129−-------------------------------------------------------------------------------
130−
131−moduleName :: String
132−moduleName = "Data.Parser.ParserK"
133−
134−instance NFData ParseError where
135− {-# INLINE rnf #-}
136− rnf (ParseError x) = rnf x
137−
138−o_1_space_serial :: Int -> [Benchmark]
139−o_1_space_serial value =
140− [ benchIOSink value "takeWhile" $ takeWhileK value
141− , benchIOSink value "splitApp" $ splitApp value
142− ]
143−
144−-- O(n) heap beacuse of accumulation of the list in strict IO monad?
145−o_n_heap_serial :: Int -> [Benchmark]
146−o_n_heap_serial value =
147− [ benchIOSink value "sequenceA" $ sequenceA value
148− , benchIOSink value "sequenceA_" $ sequenceA_ value
149− , benchIOSink value "sequence" $ sequence value
150− , benchIOSink value "manyAlt" manyAlt
151− , benchIOSink value "someAlt" someAlt
152− , benchIOSink value "choice" $ choice value
153− ]
154−
155−-------------------------------------------------------------------------------
156−-- Driver
157−-------------------------------------------------------------------------------
158−
159−main :: IO ()
160−main = runWithCLIOpts defaultStreamSize allBenchmarks
161−
162− where
163−
164− allBenchmarks value =
165− [ bgroup (o_1_space_prefix moduleName) (o_1_space_serial value)
166− , bgroup (o_n_heap_prefix moduleName) (o_n_heap_serial value)
167− ]
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.Type as Array
17−import qualified Streamly.Internal.Data.Ring.Unboxed 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/Common.hs+125−63
@@ -16,6 +16,9 @@
1616module Stream.Common
1717 ( MonadAsync
1818
19+ , fromStream
20+ , toStream
21+
1922 -- Generation
2023 , fromListM
2124 , fromFoldableM
@@ -41,8 +44,10 @@ module Stream.Common
4144 , benchIO
4245
4346 -- Benchmarking functions
47+#ifdef USE_STREAMK
4448 , concatStreamsWith
4549 , mergeMapWith
50+#endif
4651 , apDiscardFst
4752 , apDiscardSnd
4853 , apLiftA2
@@ -66,12 +71,12 @@ module Stream.Common
6671 )
6772where
6873
74+#if !MIN_VERSION_base(4,18,0)
6975import Control.Applicative (liftA2)
76+#endif
7077import Control.DeepSeq (NFData)
7178import Control.Exception (try)
7279import GHC.Exception (ErrorCall)
73−import Streamly.Internal.Data.Stream (Stream)
74−import Streamly.Internal.Data.Stream.Cross (CrossStream(..))
7580import System.Random (randomRIO)
7681
7782import qualified Streamly.Internal.Data.Fold as Fold
@@ -81,42 +86,97 @@ import qualified Streamly.Internal.Data.Pipe as Pipe
8186import Streamly.Prelude (foldl', scanl')
8287import qualified Streamly.Internal.Data.Stream.IsStream as Stream
8388import qualified Streamly.Prelude as Stream
89+import qualified Streamly.Prelude as StreamK
8490import Streamly.Benchmark.Prelude
8591 ( composeN, sourceConcatMapId, benchIOSink
86− , concatStreamsWith, mergeMapWith
92+ , concatStreamsWith
8793 )
8894#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
89102import qualified Streamly.Internal.Data.Stream as Stream
103+import qualified Streamly.Internal.Data.Stream as StreamK
104+#endif
90105#endif
91106
92−import Gauge
93−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
94123
95124#ifdef USE_PRELUDE
125+type Stream = Stream.SerialT
96126type MonadAsync m = Stream.MonadAsync m
127+mkCross = id
128+unCross = id
97129#else
98130type 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
99145#endif
100146
101−{-# INLINE append #-}
102−append :: Stream m a -> Stream m a -> Stream m a
103147#ifdef USE_PRELUDE
148+{-# INLINE append #-}
149+append :: Monad m => Stream m a -> Stream m a -> Stream m a
104150append = Stream.serial
105151#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
106157append = Stream.append
107158#endif
159+#endif
108160
109161{-# INLINE append2 #-}
110162append2 :: Monad m => Stream m a -> Stream m a -> Stream m a
111163#ifdef USE_PRELUDE
112164append2 = Stream.append
113165#else
114−append2 = Stream.append2
166+append2 = D.append
115167#endif
116168
117169{-# INLINE drain #-}
118170drain :: 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
119177drain = Stream.fold Fold.drain
178+toList = Stream.fold Fold.toList
179+#endif
120180
121181{-# INLINE fromListM #-}
122182fromListM :: MonadAsync m => [m a] -> Stream m a
@@ -131,7 +191,7 @@ fromFoldableM :: MonadAsync m => [m a] -> Stream m a
131191#ifdef USE_PRELUDE
132192fromFoldableM = Stream.fromFoldableM
133193#else
134−fromFoldableM = Stream.sequence . Stream.fromFoldable
194+fromFoldableM = Stream.sequence . toStream . StreamK.fromFoldable
135195#endif
136196
137197{-# INLINE sourceUnfoldrM #-}
@@ -168,8 +228,8 @@ sourceUnfoldrAction value n = Stream.unfoldr step n
168228 else Just (return cnt, cnt + 1)
169229
170230{-# INLINE sourceFromFoldable #-}
171−sourceFromFoldable :: Int -> Int -> Stream m Int
172−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]
173233
174234#ifndef USE_PRELUDE
175235{-# INLINE benchIOSink #-}
@@ -194,43 +254,45 @@ benchIO :: (NFData b) => String -> (Int -> IO b) -> Benchmark
194254benchIO name f = bench name $ nfIO $ randomRIO (1,1) >>= f
195255
196256#ifndef USE_PRELUDE
257+#ifdef USE_STREAMK
197258{-# INLINE concatStreamsWith #-}
198259concatStreamsWith
199− :: (Stream IO Int -> Stream IO Int -> Stream IO Int)
260+ :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
200261 -> Int
201262 -> Int
202263 -> Int
203264 -> IO ()
204265concatStreamsWith op outer inner n =
205− drain $ Stream.concatMapWith op
206− (sourceUnfoldrM inner)
207− (sourceUnfoldrM outer n)
266+ drain $ toStream $ StreamK.concatMapWith op
267+ (fromStream . sourceUnfoldrM inner)
268+ (fromStream $ sourceUnfoldrM outer n)
208269
209270{-# INLINE mergeMapWith #-}
210271mergeMapWith
211− :: (Stream IO Int -> Stream IO Int -> Stream IO Int)
272+ :: (StreamK IO Int -> StreamK IO Int -> StreamK IO Int)
212273 -> Int
213274 -> Int
214275 -> Int
215276 -> IO ()
216277mergeMapWith op outer inner n =
217− drain $ Stream.mergeMapWith op
218− (sourceUnfoldrM inner)
219− (sourceUnfoldrM outer n)
278+ drain $ toStream $ StreamK.mergeMapWith op
279+ (fromStream . sourceUnfoldrM inner)
280+ (fromStream $ sourceUnfoldrM outer n)
281+#endif
220282
221283{-# INLINE sourceConcatMapId #-}
222284sourceConcatMapId :: (Monad m)
223285 => Int -> Int -> Stream m (Stream m Int)
224286sourceConcatMapId value n =
225− Stream.fromFoldable $ fmap (Stream.fromEffect . return) [n..n+value]
287+ Stream.fromList $ fmap (D.fromEffect . return) [n..n+value]
226288#endif
227289
228290{-# INLINE apDiscardFst #-}
229291apDiscardFst :: MonadAsync m =>
230292 Int -> Int -> m ()
231−apDiscardFst linearCount start = drain $ unCrossStream $
232− CrossStream (sourceUnfoldrM nestedCount2 start)
233− *> CrossStream (sourceUnfoldrM nestedCount2 start)
293+apDiscardFst linearCount start = drain $ toStream $ unCross $
294+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
295+ *> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
234296
235297 where
236298
@@ -238,9 +300,9 @@ apDiscardFst linearCount start = drain $ unCrossStream $
238300
239301{-# INLINE apDiscardSnd #-}
240302apDiscardSnd :: MonadAsync m => Int -> Int -> m ()
241−apDiscardSnd linearCount start = drain $ unCrossStream $
242− CrossStream (sourceUnfoldrM nestedCount2 start)
243− <* CrossStream (sourceUnfoldrM nestedCount2 start)
303+apDiscardSnd linearCount start = drain $ toStream $ unCross $
304+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
305+ <* mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
244306
245307 where
246308
@@ -248,9 +310,9 @@ apDiscardSnd linearCount start = drain $ unCrossStream $
248310
249311{-# INLINE apLiftA2 #-}
250312apLiftA2 :: MonadAsync m => Int -> Int -> m ()
251−apLiftA2 linearCount start = drain $ unCrossStream $
252− liftA2 (+) (CrossStream (sourceUnfoldrM nestedCount2 start))
253− (CrossStream (sourceUnfoldrM nestedCount2 start))
313+apLiftA2 linearCount start = drain $ toStream $ unCross $
314+ liftA2 (+) (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
315+ (mkCross (fromStream $ sourceUnfoldrM nestedCount2 start))
254316
255317 where
256318
@@ -258,9 +320,9 @@ apLiftA2 linearCount start = drain $ unCrossStream $
258320
259321{-# INLINE toNullAp #-}
260322toNullAp :: MonadAsync m => Int -> Int -> m ()
261−toNullAp linearCount start = drain $ unCrossStream $
262− (+) <$> CrossStream (sourceUnfoldrM nestedCount2 start)
263− <*> CrossStream (sourceUnfoldrM nestedCount2 start)
323+toNullAp linearCount start = drain $ toStream $ unCross $
324+ (+) <$> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
325+ <*> mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
264326
265327 where
266328
@@ -268,9 +330,9 @@ toNullAp linearCount start = drain $ unCrossStream $
268330
269331{-# INLINE monadThen #-}
270332monadThen :: MonadAsync m => Int -> Int -> m ()
271−monadThen linearCount start = drain $ unCrossStream $ do
272− CrossStream (sourceUnfoldrM nestedCount2 start) >>
273− CrossStream (sourceUnfoldrM nestedCount2 start)
333+monadThen linearCount start = drain $ toStream $ unCross $ do
334+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start) >>
335+ mkCross (fromStream $ sourceUnfoldrM nestedCount2 start)
274336
275337 where
276338
@@ -278,9 +340,9 @@ monadThen linearCount start = drain $ unCrossStream $ do
278340
279341{-# INLINE toNullM #-}
280342toNullM :: MonadAsync m => Int -> Int -> m ()
281−toNullM linearCount start = drain $ unCrossStream $ do
282− x <- CrossStream (sourceUnfoldrM nestedCount2 start)
283− y <- CrossStream (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)
284346 return $ x + y
285347
286348 where
@@ -289,56 +351,56 @@ toNullM linearCount start = drain $ unCrossStream $ do
289351
290352{-# INLINE toNullM3 #-}
291353toNullM3 :: MonadAsync m => Int -> Int -> m ()
292−toNullM3 linearCount start = drain $ unCrossStream $ do
293− x <- CrossStream (sourceUnfoldrM nestedCount3 start)
294− y <- CrossStream (sourceUnfoldrM nestedCount3 start)
295− z <- CrossStream (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)
296358 return $ x + y + z
297359 where
298360 nestedCount3 = round (fromIntegral linearCount**(1/3::Double))
299361
300362{-# INLINE filterAllOutM #-}
301363filterAllOutM :: MonadAsync m => Int -> Int -> m ()
302−filterAllOutM linearCount start = drain $ unCrossStream $ do
303− x <- CrossStream (sourceUnfoldrM nestedCount2 start)
304− y <- CrossStream (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)
305367 let s = x + y
306368 if s < 0
307369 then return s
308− else CrossStream Stream.nil
370+ else mkCross StreamK.nil
309371 where
310372 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
311373
312374{-# INLINE filterAllInM #-}
313375filterAllInM :: MonadAsync m => Int -> Int -> m ()
314−filterAllInM linearCount start = drain $ unCrossStream $ do
315− x <- CrossStream (sourceUnfoldrM nestedCount2 start)
316− y <- CrossStream (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)
317379 let s = x + y
318380 if s > 0
319381 then return s
320− else CrossStream Stream.nil
382+ else mkCross StreamK.nil
321383 where
322384 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
323385
324386{-# INLINE filterSome #-}
325387filterSome :: MonadAsync m => Int -> Int -> m ()
326−filterSome linearCount start = drain $ unCrossStream $ do
327− x <- CrossStream (sourceUnfoldrM nestedCount2 start)
328− y <- CrossStream (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)
329391 let s = x + y
330392 if s > 1100000
331393 then return s
332− else CrossStream Stream.nil
394+ else mkCross StreamK.nil
333395 where
334396 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
335397
336398{-# INLINE breakAfterSome #-}
337399breakAfterSome :: Int -> Int -> IO ()
338400breakAfterSome linearCount start = do
339− (_ :: Either ErrorCall ()) <- try $ drain $ unCrossStream $ do
340− x <- CrossStream (sourceUnfoldrM nestedCount2 start)
341− y <- CrossStream (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)
342404 let s = x + y
343405 if s > 1100000
344406 then error "break"
@@ -349,9 +411,9 @@ breakAfterSome linearCount start = do
349411
350412{-# INLINE toListM #-}
351413toListM :: MonadAsync m => Int -> Int -> m [Int]
352−toListM linearCount start = Stream.fold Fold.toList $ unCrossStream $ do
353− x <- CrossStream (sourceUnfoldrM nestedCount2 start)
354− y <- CrossStream (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)
355417 return $ x + y
356418 where
357419 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
@@ -361,9 +423,9 @@ toListM linearCount start = Stream.fold Fold.toList $ unCrossStream $ do
361423{-# INLINE toListSome #-}
362424toListSome :: MonadAsync m => Int -> Int -> m [Int]
363425toListSome linearCount start =
364− Stream.fold Fold.toList $ Stream.take 10000 $ unCrossStream $ do
365− x <- CrossStream (sourceUnfoldrM nestedCount2 start)
366− y <- CrossStream (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)
367429 return $ x + y
368430 where
369431 nestedCount2 = round (fromIntegral linearCount**(1/2::Double))
benchmark/Streamly/Benchmark/Data/Stream/Concurrent.hs+1−1
@@ -17,4 +17,4 @@ moduleName = "Data.Stream.Concurrent"
1717-------------------------------------------------------------------------------
1818
1919main :: IO ()
20−main = runWithCLIOpts defaultStreamSize (allBenchmarks moduleName id)
20+main = runWithCLIOpts defaultStreamSize (allBenchmarks moduleName False id)
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentCommon.hs+9−8
@@ -14,14 +14,14 @@ where
1414import Stream.Common
1515 (composeN, benchIO, benchIOSink, benchIOSrc, sourceUnfoldrM)
1616import Streamly.Data.Stream (Stream)
17−import Streamly.Internal.Data.Stream.Concurrent (MonadAsync, Config)
17+import Streamly.Internal.Data.Stream.Prelude (MonadAsync, Config)
1818
1919import qualified Data.List as List
2020import qualified Streamly.Data.Fold as Fold
2121import qualified Streamly.Data.Stream as Stream
22−import qualified Streamly.Internal.Data.Stream.Concurrent as Async
22+import qualified Streamly.Internal.Data.Stream.Prelude as Async
2323
24−import Gauge
24+import Test.Tasty.Bench
2525import Prelude hiding (mapM)
2626import Streamly.Benchmark.Common
2727
@@ -193,15 +193,16 @@ o_1_space_outerProduct value f =
193193-- Benchmark sets
194194-------------------------------------------------------------------------------
195195
196−allBenchmarks :: String -> (Config -> Config) -> Int -> [Benchmark]
197−allBenchmarks moduleName modifier value =
196+allBenchmarks :: String -> Bool -> (Config -> Config) -> Int -> [Benchmark]
197+allBenchmarks moduleName wide modifier value =
198198 [ bgroup (o_1_space_prefix moduleName) $ concat
199199 [ o_1_space_mapping value modifier
200200 , o_1_space_concatFoldable value modifier
201201 , o_1_space_concatMap value modifier
202− , o_1_space_outerProduct value modifier
203202 , 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
204207 ]
205− , bgroup (o_n_heap_prefix moduleName)
206− (o_n_heap_buffering value modifier)
207208 ]
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentEager.hs+2−2
@@ -9,7 +9,7 @@
99import Stream.ConcurrentCommon (allBenchmarks)
1010import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
1111
12−import qualified Streamly.Internal.Data.Stream.Concurrent as Async
12+import qualified Streamly.Internal.Data.Stream.Prelude as Async
1313
1414moduleName :: String
1515moduleName = "Data.Stream.ConcurrentEager"
@@ -22,4 +22,4 @@ main :: IO ()
2222main =
2323 runWithCLIOpts
2424 defaultStreamSize
25− (allBenchmarks moduleName (Async.eager True))
25+ (allBenchmarks moduleName True (Async.eager True))
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentInterleaved.hs+2−2
@@ -9,7 +9,7 @@
99import Stream.ConcurrentCommon (allBenchmarks)
1010import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
1111
12−import qualified Streamly.Internal.Data.Stream.Concurrent as Async
12+import qualified Streamly.Internal.Data.Stream.Prelude as Async
1313
1414moduleName :: String
1515moduleName = "Data.Stream.ConcurrentInterleaved"
@@ -22,4 +22,4 @@ main :: IO ()
2222main =
2323 runWithCLIOpts
2424 defaultStreamSize
25− (allBenchmarks moduleName (Async.interleaved True))
25+ (allBenchmarks moduleName True (Async.interleaved True))
benchmark/Streamly/Benchmark/Data/Stream/ConcurrentOrdered.hs+2−2
@@ -9,7 +9,7 @@
99import Stream.ConcurrentCommon (allBenchmarks)
1010import Streamly.Benchmark.Common (runWithCLIOpts, defaultStreamSize)
1111
12−import qualified Streamly.Internal.Data.Stream.Concurrent as Async
12+import qualified Streamly.Internal.Data.Stream.Prelude as Async
1313
1414moduleName :: String
1515moduleName = "Data.Stream.ConcurrentOrdered"
@@ -22,4 +22,4 @@ main :: IO ()
2222main =
2323 runWithCLIOpts
2424 defaultStreamSize
25− (allBenchmarks moduleName (Async.ordered True))
25+ (allBenchmarks moduleName False (Async.ordered True))
benchmark/Streamly/Benchmark/Data/Stream/Eliminate.hs+59−39
@@ -32,39 +32,41 @@ import System.Random (randomRIO)
3232
3333import qualified Data.Foldable as F
3434import qualified GHC.Exts as GHC
35+import qualified Streamly.Internal.Data.Fold as Fold
3536
3637#ifdef INSPECTION
3738import GHC.Types (SPEC(..))
3839import Test.Inspection
39−
40−import qualified Streamly.Internal.Data.Stream.StreamD as D
41−#endif
42−import qualified Streamly.Internal.Data.Fold as Fold
43−#ifdef USE_PRELUDE
44−import qualified Streamly.Internal.Data.Stream.IsStream as S
45−#else
46−import qualified Streamly.Internal.Data.Stream as S
40+import qualified Streamly.Internal.Data.Stream as D
4741#endif
4842
49−import Gauge
50−import Streamly.Internal.Data.Stream (Stream)
5143#ifdef USE_PRELUDE
5244import Streamly.Prelude (fromSerial)
5345import Streamly.Benchmark.Prelude
46+import qualified Streamly.Internal.Data.Stream.IsStream as S
47+import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
5448#else
5549import Stream.Common
56− ( sourceUnfoldr
57− , sourceUnfoldrM
58− , sourceUnfoldrAction
59− , benchIOSink
60− )
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
6157#endif
58+#endif
59+
60+import Test.Tasty.Bench
6261import Streamly.Benchmark.Common
6362import Prelude hiding (length, sum, or, and, any, all, notElem, elem, (!!),
6463 lookup, repeat, minimum, maximum, product, last, mapM_, init)
6564import qualified Prelude
6665
6766#ifdef USE_PRELUDE
67+type Stream = S.SerialT
68+fromStream = id
69+
6870{-# INLINE repeat #-}
6971repeat :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
7072repeat count = S.take count . S.repeat
@@ -130,12 +132,14 @@ foldableAny :: Int -> Int -> Bool
130132foldableAny value n =
131133 Prelude.any (> (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
132134
135+{- HLINT ignore "Use all"-}
133136{-# INLINE foldableAnd #-}
134137foldableAnd :: Int -> Int -> Bool
135138foldableAnd value n =
136139 Prelude.and $ fmap
137140 (<= (value + 1)) (sourceUnfoldr value n :: Stream Identity Int)
138141
142+{- HLINT ignore "Use any"-}
139143{-# INLINE foldableOr #-}
140144foldableOr :: Int -> Int -> Bool
141145foldableOr value n =
@@ -213,6 +217,9 @@ o_1_space_elimination_foldable value =
213217 , bench "minimum" $ nf (foldableMin value) 1
214218 , benchPureSink value "min (ord)" ordInstanceMin
215219 , 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
216223 , bench "length . toList"
217224 $ nf (Prelude.length . foldableToList value) 1
218225 , bench "notElem" $ nf (foldableNotElem value) 1
@@ -235,28 +242,15 @@ o_1_space_elimination_foldable value =
235242 ]
236243 ]
237244
238−o_n_space_elimination_foldable :: Int -> [Benchmark]
239−o_n_space_elimination_foldable value =
240− -- Head recursive strict right folds.
241− [ bgroup "foldl"
242− -- XXX the definitions of minimumBy and maximumBy in Data.Foldable use
243− -- foldl1 which does not work in constant memory for our
244− -- implementation. It works in constant memory for lists but even for
245− -- lists it takes 15x more time compared to our foldl' based
246− -- implementation.
247− [ bench "minimumBy" $ nf (`foldableMinBy` 1) value
248− , bench "maximumBy" $ nf (`foldableMaxBy` 1) value
249− , bench "minimumByList" $ nf (`foldableListMinBy` 1) value
250− ]
251− ]
252−
253245-------------------------------------------------------------------------------
254246-- Stream folds
255247-------------------------------------------------------------------------------
256248
249+#ifndef USE_PRELUDE
257250instance NFData a => NFData (Stream Identity a) where
258251 {-# INLINE rnf #-}
259252 rnf xs = runIdentity $ S.fold (Fold.foldl' (\_ x -> rnf x) ()) xs
253+#endif
260254
261255{-# INLINE benchPureSink #-}
262256benchPureSink :: NFData b
@@ -283,9 +277,13 @@ benchIdentitySink value name f = bench name $ nf (f . sourceUnfoldr value) 1
283277-------------------------------------------------------------------------------
284278
285279{-# INLINE uncons #-}
280+#ifdef USE_STREAMK
281+uncons :: Monad m => StreamK m Int -> m ()
282+#else
286283uncons :: Monad m => Stream m Int -> m ()
284+#endif
287285uncons s = do
288− r <- S.uncons s
286+ r <- StreamK.uncons s
289287 case r of
290288 Nothing -> return ()
291289 Just (_, t) -> uncons t
@@ -310,9 +308,15 @@ foldrMElem e =
310308 else xs)
311309 (return False)
312310
311+#ifdef USE_STREAMK
313312{-# INLINE foldrToStream #-}
314−foldrToStream :: Monad m => Stream m Int -> m (Stream Identity Int)
315−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
316320
317321{-# INLINE foldrMBuild #-}
318322foldrMBuild :: Monad m => Stream m Int -> m [Int]
@@ -456,17 +460,34 @@ o_1_space_elimination_folds value =
456460 ]
457461 , bgroup "Identity"
458462 [ benchIdentitySink value "foldrMElem" (foldrMElem value)
463+#ifdef USE_STREAMK
459464 , 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)"
460473 (S.fold Fold.length . runIdentity . foldrToStream)
474+ -}
475+#endif
476+ {-
477+ , benchPureSink 16 "foldrMToListLength (16)"
478+ (Prelude.length . runIdentity . foldrMBuild)
479+ -}
461480 , benchPureSink value "foldrMToListLength"
462481 (Prelude.length . runIdentity . foldrMBuild)
463482 ]
464483 ]
465484
466485 -- deconstruction
467− , benchIOSink value "uncons" uncons
486+ , benchIOSink value "uncons" (uncons . fromStream)
487+#ifndef USE_PRELUDE
468488 , benchHoistSink value "length . generalizeInner"
469489 (S.fold Fold.length . S.generalizeInner)
490+#endif
470491#ifdef USE_PRELUDE
471492 , benchIOSink value "init" init
472493
@@ -587,8 +608,10 @@ o_n_space_elimination_toList value =
587608 [ bgroup "toList"
588609 -- Converting the stream to a list or pure stream in a strict monad
589610 [ benchIOSink value "toList" S.toList
611+#ifndef USE_PRELUDE
590612 , benchIOSink value "toStream"
591613 (S.toStream :: (Stream IO Int -> IO (Stream Identity Int)))
614+#endif
592615 ]
593616 ]
594617#endif
@@ -718,11 +741,8 @@ benchmarks moduleName size =
718741#ifdef USE_PRELUDE
719742 ++ o_n_heap_elimination_foldl size
720743 ++ o_n_heap_elimination_toList size
721−#endif
722− , bgroup (o_n_space_prefix moduleName) $
723− o_n_space_elimination_foldable size
724−#ifdef USE_PRELUDE
725744 ++ o_n_space_elimination_toList size
726745#endif
727− ++ o_n_space_elimination_foldr size
746+ , bgroup (o_n_space_prefix moduleName) $
747+ o_n_space_elimination_foldr size
728748 ]
benchmark/Streamly/Benchmark/Data/Stream/Exceptions.hs+50−32
@@ -27,51 +27,65 @@ module Stream.Exceptions (benchmarks) where
2727
2828import Control.Exception (Exception, throwIO)
2929import Stream.Common (drain)
30−import Streamly.Internal.Data.Stream (Stream)
3130
3231import qualified Data.IORef as Ref
3332import qualified Data.Map.Strict as Map
34−import qualified Stream.Common as Common
3533
36−#ifndef USE_STREAMLY_CORE
3734import Control.Exception (SomeException)
3835import System.IO (Handle, hClose, hPutChar)
3936import qualified Streamly.FileSystem.Handle as FH
4037import qualified Streamly.Internal.FileSystem.Handle as IFH
4138import qualified Streamly.Internal.Data.Unfold as IUF
42−import qualified Streamly.Internal.Data.Unfold.Exception as IUF
43−#endif
39+import qualified Streamly.Internal.Data.Unfold.Prelude as IUF
4440
4541#ifdef USE_PRELUDE
4642import qualified Streamly.Internal.Data.Stream.IsStream as Stream
4743#else
4844import qualified Streamly.Internal.Data.Stream as Stream
49−import qualified Streamly.Internal.Data.Stream.Exception.Lifted as Stream
45+import qualified Streamly.Internal.Data.Stream.Prelude as Stream
5046#endif
5147
52−import Gauge hiding (env)
48+import Test.Tasty.Bench hiding (env)
5349import Prelude hiding (last, length)
5450import Streamly.Benchmark.Common
5551import Streamly.Benchmark.Common.Handle
5652
5753#ifdef INSPECTION
54+import Control.Monad.Catch (MonadCatch)
5855import Test.Inspection
5956
60−import qualified Streamly.Internal.Data.Stream.StreamD as D
57+import qualified Streamly.Internal.Data.Stream as D
6158#endif
6259
63−-------------------------------------------------------------------------------
64−-- stream exceptions
65−-------------------------------------------------------------------------------
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
6671
67−{-# INLINE replicateM #-}
68−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
6975#ifdef USE_PRELUDE
70−replicateM = Stream.replicateM
76+afterUnsafe = Stream.after_
77+finallyUnsafe = Stream.finally_
78+bracketUnsafe = Stream.bracket_
7179#else
72−replicateM n = Stream.sequence . Stream.replicate n
80+afterUnsafe = Stream.afterUnsafe
81+finallyUnsafe = Stream.finallyUnsafe
82+bracketUnsafe = Stream.bracketUnsafe
7383#endif
7484
85+-------------------------------------------------------------------------------
86+-- stream exceptions
87+-------------------------------------------------------------------------------
88+
7589data BenchException
7690 = BenchException1
7791 | BenchException2
@@ -101,7 +115,7 @@ retryNone length from = do
101115 where
102116
103117 source ref =
104− replicateM (from + length)
118+ Stream.replicateM (from + length)
105119 $ Ref.modifyIORef' ref (+ 1) >> Ref.readIORef ref
106120
107121retryAll :: Int -> Int -> IO ()
@@ -146,7 +160,6 @@ o_1_space_serial_exceptions length =
146160 ]
147161
148162-- XXX Move these to FileSystem.Handle benchmarks
149−#ifndef USE_STREAMLY_CORE
150163
151164-------------------------------------------------------------------------------
152165-- copy stream exceptions
@@ -165,7 +178,8 @@ inspect $ hasNoTypeClasses 'readWriteOnExceptionStream
165178-- | Send the file contents to /dev/null with exception handling
166179readWriteHandleExceptionStream :: Handle -> Handle -> IO ()
167180readWriteHandleExceptionStream inh devNull =
168− let handler (_e :: SomeException) = Stream.fromEffect (hClose inh >> return 10)
181+ let handler (_e :: SomeException) =
182+ return $ Stream.fromEffect (hClose inh >> return 10)
169183 readEx = Stream.handle handler (Stream.unfold FH.reader inh)
170184 in Stream.fold (FH.write devNull) readEx
171185
@@ -177,7 +191,7 @@ inspect $ hasNoTypeClasses 'readWriteHandleExceptionStream
177191readWriteFinally_Stream :: Handle -> Handle -> IO ()
178192readWriteFinally_Stream inh devNull =
179193 let readEx =
180− Stream.finallyUnsafe (hClose inh) (Stream.unfold FH.reader inh)
194+ finallyUnsafe (hClose inh) (Stream.unfold FH.reader inh)
181195 in Stream.fold (FH.write devNull) readEx
182196
183197#ifdef INSPECTION
@@ -192,9 +206,9 @@ readWriteFinallyStream inh devNull =
192206-- | Send the file contents to /dev/null with exception handling
193207fromToBytesBracket_Stream :: Handle -> Handle -> IO ()
194208fromToBytesBracket_Stream inh devNull =
195− let readEx = Stream.bracketUnsafe (return ()) (\_ -> hClose inh)
196− (\_ -> IFH.read inh)
197− in IFH.putBytes devNull readEx
209+ let readEx = bracketUnsafe (return ()) (\_ -> hClose inh)
210+ (\_ -> fromStreamD $ IFH.read inh)
211+ in IFH.putBytes devNull (toStreamD readEx)
198212
199213#ifdef INSPECTION
200214inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
@@ -203,8 +217,8 @@ inspect $ hasNoTypeClasses 'fromToBytesBracket_Stream
203217fromToBytesBracketStream :: Handle -> Handle -> IO ()
204218fromToBytesBracketStream inh devNull =
205219 let readEx = Stream.bracket (return ()) (\_ -> hClose inh)
206− (\_ -> IFH.read inh)
207− in IFH.putBytes devNull readEx
220+ (\_ -> fromStreamD $ IFH.read inh)
221+ in IFH.putBytes devNull (toStreamD readEx)
208222
209223readWriteBeforeAfterStream :: Handle -> Handle -> IO ()
210224readWriteBeforeAfterStream inh devNull =
@@ -228,7 +242,7 @@ inspect $ 'readWriteAfterStream `hasNoType` ''D.Step
228242
229243readWriteAfter_Stream :: Handle -> Handle -> IO ()
230244readWriteAfter_Stream inh devNull =
231− let readEx = Stream.afterUnsafe (hClose inh) (Stream.unfold FH.reader inh)
245+ let readEx = afterUnsafe (hClose inh) (Stream.unfold FH.reader inh)
232246 in Stream.fold (FH.write devNull) readEx
233247
234248#ifdef INSPECTION
@@ -273,8 +287,12 @@ readChunksOnException inh devNull =
273287 in IUF.fold (IFH.writeChunks devNull) readEx inh
274288
275289#ifdef INSPECTION
290+#if __GLASGOW_HASKELL__ >= 906
291+inspect $ hasNoTypeClassesExcept 'readChunksOnException [''MonadCatch]
292+#else
276293inspect $ hasNoTypeClasses 'readChunksOnException
277294#endif
295+#endif
278296
279297-- | Send the file contents to /dev/null with exception handling
280298readChunksBracket_ :: Handle -> Handle -> IO ()
@@ -283,8 +301,12 @@ readChunksBracket_ inh devNull =
283301 in IUF.fold (IFH.writeChunks devNull) readEx inh
284302
285303#ifdef INSPECTION
304+#if __GLASGOW_HASKELL__ >= 906
305+inspect $ hasNoTypeClassesExcept 'readChunksBracket_ [''MonadCatch]
306+#else
286307inspect $ hasNoTypeClasses 'readChunksBracket_
287308#endif
309+#endif
288310
289311readChunksBracket :: Handle -> Handle -> IO ()
290312readChunksBracket inh devNull =
@@ -310,10 +332,10 @@ o_1_space_copy_exceptions_readChunks env =
310332-- | Send the file contents to /dev/null with exception handling
311333toChunksBracket_ :: Handle -> Handle -> IO ()
312334toChunksBracket_ inh devNull =
313− let readEx = Stream.bracketUnsafe
335+ let readEx = bracketUnsafe
314336 (return ())
315337 (\_ -> hClose inh)
316− (\_ -> IFH.readChunks inh)
338+ (\_ -> fromStreamD $ IFH.readChunks inh)
317339 in Stream.fold (IFH.writeChunks devNull) readEx
318340
319341#ifdef INSPECTION
@@ -325,7 +347,7 @@ toChunksBracket inh devNull =
325347 let readEx = Stream.bracket
326348 (return ())
327349 (\_ -> hClose inh)
328− (\_ -> IFH.readChunks inh)
350+ (\_ -> fromStreamD $ IFH.readChunks inh)
329351 in Stream.fold (IFH.writeChunks devNull) readEx
330352
331353o_1_space_copy_exceptions_toChunks :: BenchEnv -> [Benchmark]
@@ -338,16 +360,12 @@ o_1_space_copy_exceptions_toChunks env =
338360 ]
339361 ]
340362
341−#endif
342−
343363benchmarks :: String -> BenchEnv -> Int -> [Benchmark]
344364benchmarks moduleName _env size =
345365 [ bgroup (o_1_space_prefix moduleName) $ concat
346366 [ o_1_space_serial_exceptions size
347−#ifndef USE_STREAMLY_CORE
348367 , o_1_space_copy_exceptions_readChunks _env
349368 , o_1_space_copy_exceptions_toChunks _env
350369 , o_1_space_copy_stream_exceptions _env
351−#endif
352370 ]
353371 ]
benchmark/Streamly/Benchmark/Data/Stream/Expand.hs+117−77
@@ -25,32 +25,37 @@
2525
2626module Stream.Expand (benchmarks) where
2727
28−import Streamly.Internal.Data.Stream (Stream)
29−import Streamly.Internal.Data.Stream.Cross (CrossStream(..))
30−
31−import qualified Control.Applicative as AP
32−
3328#ifdef INSPECTION
3429import GHC.Types (SPEC(..))
3530import Test.Inspection
3631
37−import qualified Streamly.Internal.Data.Stream.StreamD as D
32+import qualified Streamly.Internal.Data.Stream as D
3833#endif
3934
4035import qualified Stream.Common as Common
36+import qualified Streamly.Internal.Data.Unfold as UF
37+
4138#ifdef USE_PRELUDE
4239import qualified Streamly.Internal.Data.Stream.IsStream as S
40+import qualified Streamly.Internal.Data.Stream.IsStream as StreamK
4341import Streamly.Benchmark.Prelude
4442 ( sourceFoldMapM, sourceFoldMapWith, sourceFoldMapWithM
4543 , sourceFoldMapWithStream, concatFoldableWith, concatForFoldableWith)
4644#else
4745import qualified Streamly.Internal.Data.Stream as S
48−#endif
49−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
5050import 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
5156
52−import Gauge
53−import Stream.Common hiding (append2)
57+import Test.Tasty.Bench
58+import Stream.Common
5459import Streamly.Benchmark.Common
5560import Prelude hiding (concatMap)
5661
@@ -58,6 +63,7 @@ import Prelude hiding (concatMap)
5863-- Iteration/looping utilities
5964-------------------------------------------------------------------------------
6065
66+#ifdef USE_STREAMK
6167{-# INLINE iterateN #-}
6268iterateN :: (Int -> a -> a) -> a -> Int -> a
6369iterateN g initial count = f count initial
@@ -69,13 +75,16 @@ iterateN g initial count = f count initial
6975
7076-- Iterate a transformation over a singleton stream
7177{-# INLINE iterateSingleton #-}
72−iterateSingleton ::
73− (Int -> CrossStream m Int -> CrossStream m Int)
78+iterateSingleton :: Applicative m =>
79+ (Int -> CrossStreamK m Int -> CrossStreamK m Int)
7480 -> Int
7581 -> Int
7682 -> Stream m Int
7783iterateSingleton g count n =
78− unCrossStream $ iterateN g (CrossStream (S.fromPure n)) count
84+ toStream
85+ $ StreamK.unCross
86+ $ iterateN g (StreamK.mkCross (StreamK.fromPure n)) count
87+#endif
7988
8089{-
8190-- XXX need to check why this is slower than the explicit recursion above, even
@@ -104,50 +113,28 @@ _iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
104113{-# INLINE serial2 #-}
105114serial2 :: Int -> Int -> IO ()
106115serial2 count n =
107− drain $
108− 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))
109120
110121{-# INLINE serial4 #-}
111122serial4 :: Int -> Int -> IO ()
112123serial4 count n =
113− drain $
124+ drain $ toStream $
114125 Common.append
115− (Common.append (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1)))
116126 (Common.append
117− (sourceUnfoldrM count (n + 2))
118− (sourceUnfoldrM count (n + 3)))
119−
120−{-# INLINE append2 #-}
121−append2 :: Int -> Int -> IO ()
122−append2 count n =
123− drain $
124− Common.append2 (sourceUnfoldrM count n) (sourceUnfoldrM count (n + 1))
125−
126−{-# INLINE append4 #-}
127−append4 :: Int -> Int -> IO ()
128−append4 count n =
129− drain $
130− Common.append2
131− (Common.append2
132− (sourceUnfoldrM count n)
133− (sourceUnfoldrM count (n + 1)))
134− (Common.append2
135− (sourceUnfoldrM count (n + 2))
136− (sourceUnfoldrM count (n + 3)))
137−
138−#ifdef INSPECTION
139−inspect $ hasNoTypeClasses 'append2
140−inspect $ 'append2 `hasNoType` ''SPEC
141−inspect $ 'append2 `hasNoType` ''D.AppendState
142−#endif
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)))
143132
144133o_1_space_joining :: Int -> [Benchmark]
145134o_1_space_joining value =
146135 [ bgroup "joining"
147136 [ benchIOSrc1 "serial (2,x/2)" (serial2 (value `div` 2))
148− , benchIOSrc1 "append (2,x/2)" (append2 (value `div` 2))
149137 , benchIOSrc1 "serial (2,2,x/4)" (serial4 (value `div` 4))
150− , benchIOSrc1 "append (2,2,x/4)" (append4 (value `div` 4))
151138 ]
152139 ]
153140
@@ -183,10 +170,11 @@ o_1_space_concatFoldable value =
183170{-# INLINE concatMap #-}
184171concatMap :: Int -> Int -> Int -> IO ()
185172concatMap outer inner n =
186− drain $ S.concatMap
187− (\_ -> sourceUnfoldrM inner n)
188− (sourceUnfoldrM outer n)
173+ drain $ toStream $ StreamK.concatMap
174+ (\_ -> fromStream $ sourceUnfoldrM inner n)
175+ (fromStream $ sourceUnfoldrM outer n)
189176
177+#ifndef USE_STREAMK
190178{-# INLINE concatMapM #-}
191179concatMapM :: Int -> Int -> Int -> IO ()
192180concatMapM outer inner n =
@@ -198,18 +186,23 @@ concatMapM outer inner n =
198186inspect $ hasNoTypeClasses 'concatMap
199187inspect $ 'concatMap `hasNoType` ''SPEC
200188#endif
189+#endif
201190
202191-- concatMap unfoldr/unfoldr
203192
204193{-# INLINE concatMapPure #-}
205194concatMapPure :: Int -> Int -> Int -> IO ()
206195concatMapPure outer inner n =
207− drain $ S.concatMap
208− (\_ -> sourceUnfoldr inner n)
209− (sourceUnfoldr outer n)
196+ drain $ toStream $ StreamK.concatMap
197+ (\_ -> fromStream $ sourceUnfoldr inner n)
198+ (fromStream $ sourceUnfoldr outer n)
210199
211200#ifdef INSPECTION
201+#if __GLASGOW_HASKELL__ >= 906
202+inspect $ hasNoTypeClassesExcept 'concatMapPure [''Applicative]
203+#else
212204inspect $ hasNoTypeClasses 'concatMapPure
205+#endif
213206inspect $ 'concatMapPure `hasNoType` ''SPEC
214207#endif
215208
@@ -218,15 +211,21 @@ inspect $ 'concatMapPure `hasNoType` ''SPEC
218211{-# INLINE concatMapRepl #-}
219212concatMapRepl :: Int -> Int -> Int -> IO ()
220213concatMapRepl outer inner n =
221− drain $ S.concatMap (S.replicate inner) (sourceUnfoldrM outer n)
214+ drain $ toStream $ StreamK.concatMap
215+ (fromStream . S.replicate inner) (fromStream $ sourceUnfoldrM outer n)
222216
223217#ifdef INSPECTION
218+#if __GLASGOW_HASKELL__ >= 906
219+inspect $ hasNoTypeClassesExcept 'concatMapRepl [''Applicative]
220+#else
224221inspect $ hasNoTypeClasses 'concatMapRepl
222+#endif
225223inspect $ 'concatMapRepl `hasNoType` ''SPEC
226224#endif
227225
228226-- concatMapWith
229227
228+#ifdef USE_STREAMK
230229{-# INLINE concatMapWithSerial #-}
231230concatMapWithSerial :: Int -> Int -> Int -> IO ()
232231concatMapWithSerial = concatStreamsWith Common.append
@@ -236,6 +235,7 @@ inspect $ hasNoTypeClasses 'concatMapWithSerial
236235inspect $ 'concatMapWithSerial `hasNoType` ''SPEC
237236#endif
238237
238+{-
239239{-# INLINE concatMapWithAppend #-}
240240concatMapWithAppend :: Int -> Int -> Int -> IO ()
241241concatMapWithAppend = concatStreamsWith Common.append2
@@ -244,6 +244,7 @@ concatMapWithAppend = concatStreamsWith Common.append2
244244inspect $ hasNoTypeClasses 'concatMapWithAppend
245245inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
246246#endif
247+-}
247248
248249-- mergeMapWith
249250
@@ -251,9 +252,12 @@ inspect $ 'concatMapWithAppend `hasNoType` ''SPEC
251252mergeMapWithSerial :: Int -> Int -> Int -> IO ()
252253mergeMapWithSerial = mergeMapWith Common.append
253254
255+{-
254256{-# INLINE mergeMapWithAppend #-}
255257mergeMapWithAppend :: Int -> Int -> Int -> IO ()
256258mergeMapWithAppend = mergeMapWith Common.append2
259+-}
260+#endif
257261
258262-- unfoldMany
259263
@@ -284,10 +288,6 @@ o_1_space_concat value = sqrtVal `seq`
284288 , benchIOSrc1 "concatMapPure (1 of n)"
285289 (concatMapPure 1 value)
286290
287− -- This is for comparison with foldMapWith
288− , benchIOSrc "concatMapId (n of 1) (fromFoldable)"
289− (S.concatMap id . sourceConcatMapId value)
290−
291291 , benchIOSrc1 "concatMap (n of 1)"
292292 (concatMap value 1)
293293 , benchIOSrc1 "concatMap (sqrt n of sqrt n)"
@@ -295,16 +295,25 @@ o_1_space_concat value = sqrtVal `seq`
295295 , benchIOSrc1 "concatMap (1 of n)"
296296 (concatMap 1 value)
297297
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+
298303 , benchIOSrc1 "concatMapM (n of 1)"
299304 (concatMapM value 1)
300305 , benchIOSrc1 "concatMapM (sqrt n of sqrt n)"
301306 (concatMapM sqrtVal sqrtVal)
302307 , benchIOSrc1 "concatMapM (1 of n)"
303308 (concatMapM 1 value)
309+#endif
304310
311+#ifdef USE_STREAMK
312+ {-
305313 -- This is for comparison with foldMapWith
306314 , benchIOSrc "concatMapWithId (n of 1) (fromFoldable)"
307− (S.concatMapWith Common.append id . sourceConcatMapId value)
315+ (toStream . S.concatMapWith Common.append id . sourceConcatMapId value)
316+ -}
308317
309318 , benchIOSrc1 "concatMapWith (n of 1)"
310319 (concatMapWithSerial value 1)
@@ -313,9 +322,12 @@ o_1_space_concat value = sqrtVal `seq`
313322 , benchIOSrc1 "concatMapWith (1 of n)"
314323 (concatMapWithSerial 1 value)
315324
325+ {-
316326 -- quadratic with number of outer streams
317327 , benchIOSrc1 "concatMapWithAppend (2 of n/2)"
318328 (concatMapWithAppend 2 (value `div` 2))
329+ -}
330+#endif
319331
320332 -- concatMap vs unfoldMany
321333 , benchIOSrc1 "concatMapRepl (sqrt n of sqrt n)"
@@ -329,8 +341,9 @@ o_1_space_concat value = sqrtVal `seq`
329341
330342 sqrtVal = round $ sqrt (fromIntegral value :: Double)
331343
332−o_n_space_concat :: Int -> [Benchmark]
333−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`
334347 [ bgroup "concat"
335348 [
336349 -------------------mergeMapWith-----------------
@@ -344,16 +357,19 @@ o_n_space_concat value = sqrtVal `seq`
344357 , benchIOSrc1 "mergeMapWithSerial (2 of n/2)"
345358 (mergeMapWithSerial 2 (value `div` 2))
346359
360+ {-
347361 , benchIOSrc1 "mergeMapWithAppend (n of 1)"
348362 (mergeMapWithAppend value 1)
349363 , benchIOSrc1 "mergeMapWithAppend (sqrtVal of sqrtVal)"
350364 (mergeMapWithAppend sqrtVal sqrtVal)
365+ -}
351366 ]
352367 ]
353368
354369 where
355370
356371 sqrtVal = round $ sqrt (fromIntegral value :: Double)
372+#endif
357373
358374-------------------------------------------------------------------------------
359375-- Applicative
@@ -369,9 +385,10 @@ o_1_space_applicative value =
369385 ]
370386 ]
371387
388+#ifdef USE_STREAMK
372389o_n_space_applicative :: Int -> [Benchmark]
373390o_n_space_applicative value =
374− [ bgroup "Applicative"
391+ [ bgroup "iterated"
375392 [ benchIOSrc "(*>) (n times)" $
376393 iterateSingleton ((*>) . pure) value
377394 , benchIOSrc "(<*) (n times)" $
@@ -382,6 +399,7 @@ o_n_space_applicative value =
382399 iterateSingleton (AP.liftA2 (+) . pure) value
383400 ]
384401 ]
402+#endif
385403
386404-------------------------------------------------------------------------------
387405-- Monad
@@ -405,30 +423,46 @@ o_1_space_monad value =
405423 ]
406424 ]
407425
426+#ifdef USE_STREAMK
408427-- This is a good benchmark but inefficient way to compute primes. As we see a
409428-- new prime we keep appending a division filter for all the future numbers.
410429{-# INLINE sieve #-}
411−sieve :: Monad m => Stream m Int -> Stream m Int
412−sieve s = S.concatEffect $ do
413− r <- S.uncons s
430+sieve :: Monad m => StreamK m Int -> StreamK m Int
431+sieve s = StreamK.concatEffect $ do
432+ r <- StreamK.uncons s
414433 case r of
415434 Just (prime, rest) ->
416− pure $ prime `S.cons` sieve (S.filter (\n -> n `mod` prime /= 0) rest)
417− Nothing -> pure 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
418458
419459o_n_space_monad :: Int -> [Benchmark]
420460o_n_space_monad value =
421461 [ bgroup "Monad"
422− [ benchIOSrc "(>>) (n times)" $
423− iterateSingleton ((>>) . pure) value
424− , benchIOSrc "(>>=) (n times)" $
425− iterateSingleton (\x xs -> xs >>= \y -> return (x + y)) value
426− , benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
462+ [ benchIO "(>>=) (sqrt n x sqrt n) (toList)" $
427463 toListM value
428464 , benchIO "(>>=) (sqrt n x sqrt n) (toListSome)" $
429465 toListSome value
430− , benchIO "naive prime sieve (n/4)"
431− (\n -> S.fold Fold.sum $ sieve $ S.enumerateFromTo 2 (value `div` 4 + n))
432466 ]
433467 ]
434468
@@ -436,6 +470,7 @@ o_n_space_monad value =
436470-- Joining
437471-------------------------------------------------------------------------------
438472
473+{-
439474toKv :: Int -> (Int, Int)
440475toKv p = (p, p)
441476
@@ -487,6 +522,7 @@ o_n_heap_buffering value =
487522
488523 halfVal = value `div` 2
489524 sqrtVal = round $ sqrt (fromIntegral value :: Double)
525+-}
490526
491527-------------------------------------------------------------------------------
492528-- Main
@@ -495,6 +531,7 @@ o_n_heap_buffering value =
495531-- In addition to gauge options, the number of elements in the stream can be
496532-- passed using the --stream-size option.
497533--
534+{-# ANN benchmarks "HLint: ignore" #-}
498535benchmarks :: String -> Int -> [Benchmark]
499536benchmarks moduleName size =
500537 [ bgroup (o_1_space_prefix moduleName) $ Prelude.concat
@@ -505,19 +542,22 @@ benchmarks moduleName size =
505542 , o_1_space_concatFoldable size
506543#endif
507544 , o_1_space_concat size
508−
509545 , o_1_space_applicative size
510546 , o_1_space_monad size
511−
512547 ]
513548 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
514549 [
515550 -- multi-stream
516− o_n_space_applicative size
517− , o_n_space_monad size
518− , 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
519557 ]
558+ {-
520559 , bgroup (o_n_heap_prefix moduleName) $
521560 -- multi-stream
522561 o_n_heap_buffering size
562+ -}
523563 ]
benchmark/Streamly/Benchmark/Data/Stream/Generate.hs+43−25
@@ -21,29 +21,28 @@ import Control.DeepSeq (NFData(..))
2121import Data.Functor.Identity (Identity(..))
2222
2323import qualified GHC.Exts as GHC
24−import qualified Stream.Common as Common
2524import qualified Streamly.Internal.Data.Fold as Fold
25+
2626#ifdef USE_PRELUDE
27+import Streamly.Prelude (MonadAsync)
28+import Stream.Common hiding (MonadAsync)
2729import Streamly.Benchmark.Prelude (sourceFromFoldableM, absTimes)
2830import qualified Streamly.Prelude as S
2931import qualified Streamly.Internal.Data.Stream.IsStream as Stream
3032#else
33+import Stream.Common
34+import Streamly.Internal.Data.Stream (Stream)
3135import 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
3240#endif
33−import qualified Prelude
34−
35−import Gauge
36−import Streamly.Benchmark.Common
37−import Streamly.Internal.Data.Stream (Stream)
38−import Streamly.Internal.Data.Stream.Cross (CrossStream(..))
39−#ifdef USE_PRELUDE
40−import Streamly.Prelude (MonadAsync)
41−import Stream.Common hiding (MonadAsync)
42−#else
43−import Stream.Common
4441#endif
4542
46−import System.IO.Unsafe (unsafeInterleaveIO)
43+import Test.Tasty.Bench
44+import Streamly.Benchmark.Common
45+import qualified Prelude
4746
4847import Prelude hiding (repeat, replicate, iterate)
4948
@@ -51,6 +50,14 @@ import Prelude hiding (repeat, replicate, iterate)
5150-- Generation
5251-------------------------------------------------------------------------------
5352
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+
5461-------------------------------------------------------------------------------
5562-- fromList
5663-------------------------------------------------------------------------------
@@ -157,15 +164,15 @@ iterate count = Stream.take count . Stream.iterate (+1)
157164iterateM :: MonadAsync m => Int -> Int -> Stream m Int
158165iterateM count = Stream.take count . Stream.iterateM (return . (+1)) . return
159166
160−#ifdef USE_PRELUDE
161167{-# INLINE repeatM #-}
162−repeatM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
163−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
164170
165171{-# INLINE replicateM #-}
166−replicateM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
167−replicateM count = S.replicateM count . return
172+replicateM :: MonadAsync m => Int -> Int -> Stream m Int
173+replicateM count = Stream.replicateM count . return
168174
175+#ifdef USE_PRELUDE
169176{-# INLINE fromIndices #-}
170177fromIndices :: (Monad m, S.IsStream t) => Int -> Int -> t m Int
171178fromIndices value n = S.take value $ S.fromIndices (+ n)
@@ -175,15 +182,17 @@ fromIndicesM :: (MonadAsync m, S.IsStream t) => Int -> Int -> t m Int
175182fromIndicesM value n = S.take value $ S.fromIndicesM (return <$> (+ n))
176183#endif
177184
185+#ifdef USE_STREAMK
178186{-# INLINE mfixUnfold #-}
179187mfixUnfold :: Int -> Int -> Stream IO (Int, Int)
180−mfixUnfold count start = Stream.mfix f
188+mfixUnfold count start = toStream $ StreamK.mfix f
181189 where
182− f action = unCrossStream $ do
190+ f action = StreamK.unCross $ do
183191 let incr n act = fmap ((+n) . snd) $ unsafeInterleaveIO act
184− x <- CrossStream (Common.fromListM [incr 1 action, incr 2 action])
185− y <- CrossStream (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)
186194 return (x, y)
195+#endif
187196
188197o_1_space_generation :: Int -> [Benchmark]
189198o_1_space_generation value =
@@ -201,37 +210,46 @@ o_1_space_generation value =
201210 , benchIOSrc "fracFromTo" (sourceFracFromTo value)
202211 , benchIOSrc "fromList" (sourceFromList value)
203212 , benchIOSrc "fromListM" (sourceFromListM value)
204− , benchPureSrc "IsList.fromList" (sourceIsList value)
205− , benchPureSrc "IsString.fromString" (sourceIsString value)
213+ , benchPureSrc "IsList.fromList" (toStreamD . sourceIsList value)
214+ , benchPureSrc "IsString.fromString" (toStreamD . sourceIsString value)
206215 , benchIOSrc "enumerateFrom" (enumerateFrom value)
207216 , benchIOSrc "enumerateFromTo" (enumerateFromTo value)
208217 , benchIOSrc "enumerateFromThen" (enumerateFromThen value)
209218 , benchIOSrc "enumerateFromThenTo" (enumerateFromThenTo value)
210219 , benchIOSrc "enumerate" (enumerate value)
211220 , benchIOSrc "enumerateTo" (enumerateTo value)
212−#ifdef USE_PRELUDE
213221 , benchIOSrc "repeatM" (repeatM value)
214222 , benchIOSrc "replicateM" (replicateM value)
223+#ifdef USE_PRELUDE
215224 , benchIOSrc "fromIndices" (fromIndices value)
216225 , benchIOSrc "fromIndicesM" (fromIndicesM value)
217226#endif
218227
219228 -- These essentially test cons and consM
229+#ifdef USE_STREAMK
220230 , benchIOSrc "fromFoldable" (sourceFromFoldable value)
231+ -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
232+#else
233+ -- , benchIOSrc "fromFoldable 16" (sourceFromFoldable 16)
234+#endif
221235
222236#ifdef USE_PRELUDE
223237 , benchIOSrc "fromFoldableM" (sourceFromFoldableM value)
224238 , benchIOSrc "absTimes" $ absTimes value
225239#endif
240+#ifdef USE_STREAMK
226241 , Common.benchIOSrc "mfix_10" (mfixUnfold 10)
227242 , Common.benchIOSrc "mfix_100" (mfixUnfold 100)
228243 , Common.benchIOSrc "mfix_1000" (mfixUnfold 1000)
244+#endif
229245 ]
230246 ]
231247
248+#ifndef USE_PRELUDE
232249instance NFData a => NFData (Stream Identity a) where
233250 {-# INLINE rnf #-}
234251 rnf xs = runIdentity $ Stream.fold (Fold.foldl' (\_ x -> rnf x) ()) xs
252+#endif
235253
236254o_n_heap_generation :: Int -> [Benchmark]
237255o_n_heap_generation value =
benchmark/Streamly/Benchmark/Data/Stream/Lift.hs+29−27
@@ -18,24 +18,33 @@ module Stream.Lift (benchmarks) where
1818import Control.DeepSeq (NFData(..))
1919import Control.Monad.State.Strict (StateT, get, put)
2020import Data.Functor.Identity (Identity)
21−import Stream.Common
22− (benchIO, sourceUnfoldr, sourceUnfoldrM, benchIOSrc, drain)
21+import Stream.Common (sourceUnfoldr, sourceUnfoldrM, benchIOSrc)
2322import System.Random (randomRIO)
23+
24+import qualified Stream.Common as Common
25+import qualified Streamly.Internal.Data.Fold as Fold
26+
2427#ifdef USE_PRELUDE
2528import qualified Streamly.Internal.Data.Stream.IsStream as Stream
2629#else
30+import Streamly.Internal.Data.Stream (Stream)
2731import qualified Streamly.Internal.Data.Stream as Stream
28−#endif
29−import qualified Streamly.Internal.Data.Fold as Fold
30−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
3136import qualified Control.Monad.State.Strict as State
37+#endif
38+#endif
3239
33−import Gauge
34−import Streamly.Internal.Data.Stream (Stream)
40+import Test.Tasty.Bench
3541import Streamly.Benchmark.Common
36−
3742import Prelude hiding (reverse, tail)
3843
44+#ifdef USE_PRELUDE
45+type Stream = Stream.SerialT
46+#endif
47+
3948-------------------------------------------------------------------------------
4049-- Monad transformation (hoisting etc.)
4150-------------------------------------------------------------------------------
@@ -76,12 +85,15 @@ o_1_space_hoisting value =
7685 [ bgroup "hoisting"
7786 [ benchIOSrc "evalState" (evalStateT value)
7887 , benchIOSrc "withState" (withState value)
88+#ifndef USE_PRELUDE
7989 , benchHoistSink value "generalizeInner"
8090 ((\xs -> Stream.fold Fold.length xs :: IO Int)
8191 . Stream.generalizeInner)
92+#endif
8293 ]
8394 ]
8495
96+#ifdef USE_STREAMK
8597{-# INLINE iterateStateIO #-}
8698iterateStateIO ::
8799 Monad m
@@ -95,28 +107,17 @@ iterateStateIO n = do
95107 iterateStateIO n
96108 else return x
97109
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.
98112{-# INLINE iterateStateT #-}
99−iterateStateT :: Int -> Stream (StateT Int IO) Int
100−iterateStateT n = Stream.concatEffect $ do
113+iterateStateT :: Int -> StreamK (StateT Int IO) Int
114+iterateStateT n = StreamK.concatEffect $ do
101115 x <- get
102116 if x > n
103117 then do
104118 put (x - 1)
105119 return $ iterateStateT n
106− else return $ Stream.fromPure x
107−
108−{-# INLINE iterateState #-}
109−{-# SPECIALIZE iterateState :: Int -> Stream (StateT Int IO) Int #-}
110−iterateState :: Monad m =>
111− Int
112− -> Stream (StateT Int m) Int
113−iterateState n = Stream.concatEffect $ do
114− x <- get
115− if x > n
116− then do
117− put (x - 1)
118− return $ iterateState n
119− else return $ Stream.fromPure x
120+ else return $ StreamK.fromPure x
120121
121122o_n_heap_transformer :: Int -> [Benchmark]
122123o_n_heap_transformer value =
@@ -124,11 +125,10 @@ o_n_heap_transformer value =
124125 [ benchIO "StateT Int IO (n times) (baseline)" $ \n ->
125126 State.evalStateT (iterateStateIO n) value
126127 , benchIO "Stream (StateT Int IO) (n times)" $ \n ->
127− State.evalStateT (drain (iterateStateT n)) value
128− , benchIO "MonadState Int m => Stream m Int" $ \n ->
129− State.evalStateT (drain (iterateState n)) value
128+ State.evalStateT (drain $ Common.toStream (iterateStateT n)) value
130129 ]
131130 ]
131+#endif
132132
133133-------------------------------------------------------------------------------
134134-- Main
@@ -140,5 +140,7 @@ o_n_heap_transformer value =
140140benchmarks :: String -> Int -> [Benchmark]
141141benchmarks moduleName size =
142142 [ bgroup (o_1_space_prefix moduleName) (o_1_space_hoisting size)
143+#ifdef USE_STREAMK
143144 , bgroup (o_n_heap_prefix moduleName) (o_n_heap_transformer size)
145+#endif
144146 ]
benchmark/Streamly/Benchmark/Data/Stream/Reduce.hs+165−119
@@ -21,17 +21,21 @@ import Control.DeepSeq (NFData(..))
2121import Control.Monad.IO.Class (MonadIO(..))
2222import Data.Monoid (Sum(..))
2323import GHC.Generics (Generic)
24−import Streamly.Internal.Data.Stream (Stream)
2524
2625import qualified Streamly.Internal.Data.Refold.Type as Refold
2726import qualified Streamly.Internal.Data.Fold as FL
2827import qualified Stream.Common as Common
29−#ifdef USE_PRELUDE
30−import Control.Monad (when)
31−import Data.Proxy (Proxy(..))
28+
29+#ifndef USE_STREAMLY_CORE
3230import Data.HashMap.Strict (HashMap)
31+import Data.Proxy (Proxy(..))
3332import Streamly.Internal.Data.IsMap.HashMap ()
33+#endif
34+
35+#ifdef USE_PRELUDE
36+import Control.Monad (when)
3437import qualified Streamly.Internal.Data.Stream.IsStream as S
38+import qualified Streamly.Prelude as S
3539import Streamly.Prelude (fromSerial)
3640import Streamly.Benchmark.Prelude hiding
3741 ( benchIO, benchIOSrc, sourceUnfoldrM, apDiscardFst, apDiscardSnd, apLiftA2
@@ -39,53 +43,50 @@ import Streamly.Benchmark.Prelude hiding
3943 , filterSome, breakAfterSome, toListM, toListSome, transformMapM
4044 , transformComposeMapM, transformTeeMapM, transformZipMapM)
4145#else
46+
47+import Streamly.Internal.Data.Stream (Stream)
4248import 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
4352#endif
4453
45−import Gauge
54+#ifdef USE_STREAMK
55+import Streamly.Internal.Data.StreamK (StreamK)
56+import qualified Streamly.Internal.Data.Parser as PR
57+import qualified Streamly.Internal.Data.StreamK as K
58+#else
59+import qualified Streamly.Internal.Data.Stream as K
60+#endif
61+
62+#endif
63+
64+import Test.Tasty.Bench
4665import Streamly.Benchmark.Common
4766import Stream.Common
4867import Prelude hiding (reverse, tail)
4968
50−-------------------------------------------------------------------------------
51−-- Iteration/looping utilities
52−-------------------------------------------------------------------------------
53−
54−{-# INLINE iterateN #-}
55−iterateN :: (Int -> a -> a) -> a -> Int -> a
56−iterateN g initial count = f count initial
57−
58− where
59−
60− f (0 :: Int) x = x
61− f i x = f (i - 1) (g i x)
69+#ifdef USE_PRELUDE
70+type Stream = S.SerialT
71+#endif
6272
63−-- Iterate a transformation over a singleton stream
64−{-# INLINE iterateSingleton #-}
65−iterateSingleton ::
66− (Int -> Stream m Int -> Stream m Int)
67− -> 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)
6879 -> Int
69− -> Stream m Int
70−iterateSingleton g count n = iterateN g (S.fromPure n) count
71−
72−{-
73−-- XXX need to check why this is slower than the explicit recursion above, even
74−-- if the above code is written in a foldr like head recursive way. We also
75−-- need to try this with foldlM' once #150 is fixed.
76−-- However, it is perhaps best to keep the iteration benchmarks independent of
77−-- foldrM and any related fusion issues.
78−{-# INLINE _iterateSingleton #-}
79−_iterateSingleton ::
80− Monad m
81− => (Int -> Stream m Int -> Stream m Int)
8280 -> Int
8381 -> Int
84− -> Stream m Int
85−_iterateSingleton g value n = S.foldrM g (return n) $ sourceIntFromTo value n
86−-}
82+ -> StreamK m Int
83+iterateSource g count len n = f count (fromStream $ sourceUnfoldrM len n)
8784
88−-- Apply transformation g count times on a stream of length len
85+ where
86+
87+ f (0 :: Int) stream = stream
88+ f i stream = f (i - 1) (g stream)
89+#else
8990{-# INLINE iterateSource #-}
9091iterateSource ::
9192 MonadAsync m
@@ -100,57 +101,56 @@ iterateSource g count len n = f count (sourceUnfoldrM len n)
100101
101102 f (0 :: Int) stream = stream
102103 f i stream = f (i - 1) (g stream)
103−
104−-------------------------------------------------------------------------------
105−-- Functor
106−-------------------------------------------------------------------------------
107−
108−o_n_space_functor :: Int -> [Benchmark]
109−o_n_space_functor value =
110− [ bgroup "Functor"
111− [ benchIO "(+) (n times) (baseline)" $ \i0 ->
112− iterateN (\i acc -> acc >>= \n -> return $ i + n) (return i0) value
113− , benchIOSrc "(<$) (n times)" $
114− iterateSingleton (<$) value
115− , benchIOSrc "fmap (n times)" $
116− iterateSingleton (fmap . (+)) value
117− {-
118− , benchIOSrc fromSerial "_(<$) (n times)" $
119− _iterateSingleton (<$) value
120− , benchIOSrc fromSerial "_fmap (n times)" $
121− _iterateSingleton (fmap . (+)) value
122− -}
123− ]
124− ]
104+#endif
125105
126106-------------------------------------------------------------------------------
127107-- Grouping transformations
128108-------------------------------------------------------------------------------
129109
130−#ifdef USE_PRELUDE
131110{-# INLINE groups #-}
132111groups :: MonadIO m => Stream m Int -> m ()
133−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
118+
119+{-# INLINE groupsWhileLT #-}
120+groupsWhileLT :: MonadIO m => Stream m Int -> m ()
121+groupsWhileLT =
122+#ifdef USE_PRELUDE
123+ Common.drain . S.groupsBy (>) FL.drain
124+#else
125+ Common.drain . S.groupsWhile (<) FL.drain
126+#endif
134127
135−-- XXX Change this test when the order of comparison is later changed
136−{-# INLINE groupsByGT #-}
137−groupsByGT :: MonadIO m => Stream m Int -> m ()
138−groupsByGT = Common.drain . S.groupsBy (>) FL.drain
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
139136
140−{-# INLINE groupsByEq #-}
141−groupsByEq :: MonadIO m => Stream m Int -> m ()
142−groupsByEq = Common.drain . S.groupsBy (==) FL.drain
143137
144−-- XXX Change this test when the order of comparison is later changed
145138{-# INLINE groupsByRollingLT #-}
146139groupsByRollingLT :: MonadIO m => Stream m Int -> m ()
147140groupsByRollingLT =
141+#ifdef USE_PRELUDE
148142 Common.drain . S.groupsByRolling (<) FL.drain
143+#else
144+ Common.drain . S.groupsRollingBy (<) FL.drain
145+#endif
149146
150147{-# INLINE groupsByRollingEq #-}
151148groupsByRollingEq :: MonadIO m => Stream m Int -> m ()
152149groupsByRollingEq =
150+#ifdef USE_PRELUDE
153151 Common.drain . S.groupsByRolling (==) FL.drain
152+#else
153+ Common.drain . S.groupsRollingBy (==) FL.drain
154154#endif
155155
156156{-# INLINE foldMany #-}
@@ -195,52 +195,84 @@ refoldIterateM =
195195 (Refold.take 2 Refold.sconcat) (return (Sum 0))
196196 . fmap Sum
197197
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+
198208o_1_space_grouping :: Int -> [Benchmark]
199209o_1_space_grouping value =
200210 -- Buffering operations using heap proportional to group/window sizes.
201211 [ bgroup "grouping"
202212 [
203−#ifdef USE_PRELUDE
204213 benchIOSink value "groups" groups
205− , benchIOSink value "groupsByGT" groupsByGT
206− , benchIOSink value "groupsByEq" groupsByEq
214+ , benchIOSink value "groupsWhileLT" groupsWhileLT
215+ , benchIOSink value "groupsWhileEq" groupsWhileEq
207216 , benchIOSink value "groupsByRollingLT" groupsByRollingLT
208217 , benchIOSink value "groupsByRollingEq" groupsByRollingEq
209218 ,
210−#endif
219+
211220 -- XXX parseMany/parseIterate benchmarks are in the Parser/ParserD
212− -- modules we can bring those here. arraysOf benchmarks are in
221+ -- modules we can bring those here. chunksOf benchmarks are in
213222 -- Parser/ParserD/Array.Stream/FileSystem.Handle.
214223 benchIOSink value "foldMany" foldMany
215224 , benchIOSink value "foldManyPost" foldManyPost
216225 , benchIOSink value "refoldMany" refoldMany
217226 , benchIOSink value "foldIterateM" foldIterateM
218227 , 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
219242 ]
220243 ]
221244
245+#ifndef USE_STREAMLY_CORE
246+ where
247+
248+ getKey :: Int -> Int -> Int
249+ getKey n = (`mod` n)
250+#endif
251+
222252-------------------------------------------------------------------------------
223253-- Size conserving transformations (reordering, buffering, etc.)
224254-------------------------------------------------------------------------------
225255
256+#ifndef USE_PRELUDE
226257{-# INLINE reverse #-}
227258reverse :: MonadIO m => Int -> Stream m Int -> m ()
228−reverse n = composeN n S.reverse
259+reverse n = composeN n (toStream . K.reverse . fromStream)
229260
230261{-# INLINE reverse' #-}
231262reverse' :: MonadIO m => Int -> Stream m Int -> m ()
232−reverse' n = composeN n S.reverse'
263+reverse' n = composeN n S.reverseUnbox
264+#endif
233265
234266o_n_heap_buffering :: Int -> [Benchmark]
235267o_n_heap_buffering value =
236268 [ bgroup "buffered"
237269 [
270+#ifndef USE_PRELUDE
238271 -- Reversing a stream
239272 benchIOSink value "reverse" (reverse 1)
240273 , benchIOSink value "reverse'" (reverse' 1)
241−
242−#ifdef USE_PRELUDE
243− , benchIOSink value "mkAsync" (mkAsync fromSerial)
274+#else
275+ benchIOSink value "mkAsync" (mkAsync fromSerial)
244276#endif
245277 ]
246278 ]
@@ -249,9 +281,9 @@ o_n_heap_buffering value =
249281-- Grouping/Splitting
250282-------------------------------------------------------------------------------
251283
252−#ifdef USE_PRELUDE
284+#ifndef USE_STREAMLY_CORE
253285{-# INLINE classifySessionsOf #-}
254−classifySessionsOf :: MonadAsync m => (Int -> Int) -> Stream m Int -> m ()
286+classifySessionsOf :: S.MonadAsync m => (Int -> Int) -> Stream m Int -> m ()
255287classifySessionsOf getKey =
256288 Common.drain
257289 . S.classifySessionsOf
@@ -260,7 +292,7 @@ classifySessionsOf getKey =
260292 . fmap (\x -> (getKey x, x))
261293
262294{-# INLINE classifySessionsOfHash #-}
263−classifySessionsOfHash :: MonadAsync m =>
295+classifySessionsOfHash :: S.MonadAsync m =>
264296 (Int -> Int) -> Stream m Int -> m ()
265297classifySessionsOfHash getKey =
266298 Common.drain
@@ -269,25 +301,6 @@ classifySessionsOfHash getKey =
269301 1 False (const (return False)) 3 (FL.take 10 FL.sum)
270302 . S.timestamped
271303 . fmap (\x -> (getKey x, x))
272−
273−o_n_space_grouping :: Int -> [Benchmark]
274−o_n_space_grouping value =
275− -- Buffering operations using heap proportional to group/window sizes.
276− [ bgroup "grouping"
277− [ benchIOSink value "classifySessionsOf (10000 buckets)"
278− (classifySessionsOf (getKey 10000))
279− , benchIOSink value "classifySessionsOf (64 buckets)"
280− (classifySessionsOf (getKey 64))
281− , benchIOSink value "classifySessionsOfHash (10000 buckets)"
282− (classifySessionsOfHash (getKey 10000))
283− , benchIOSink value "classifySessionsOfHash (64 buckets)"
284− (classifySessionsOfHash (getKey 64))
285− ]
286− ]
287−
288− where
289−
290− getKey n = (`mod` n)
291304#endif
292305
293306-------------------------------------------------------------------------------
@@ -349,8 +362,9 @@ data Pair a b =
349362 deriving (Generic, NFData)
350363
351364{-# INLINE sumProductFold #-}
352−sumProductFold :: Monad m => Stream m Int -> m (Int, Int)
353−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)
354368
355369{-# INLINE sumProductScan #-}
356370sumProductScan :: Monad m => Stream m Int -> m (Pair Int Int)
@@ -398,6 +412,46 @@ o_1_space_transformations_mixedX4 value =
398412-- Iterating a transformation over and over again
399413-------------------------------------------------------------------------------
400414
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+
401455-- this is quadratic
402456{-# INLINE iterateScan #-}
403457iterateScan :: MonadAsync m => Int -> Int -> Int -> Stream m Int
@@ -426,15 +480,11 @@ iterateTakeAll value = iterateSource (S.take (value + 1))
426480iterateDropOne :: MonadAsync m => Int -> Int -> Int -> Stream m Int
427481iterateDropOne = iterateSource (S.drop 1)
428482
429−{-# INLINE iterateDropWhileFalse #-}
430−iterateDropWhileFalse :: MonadAsync m
431− => Int -> Int -> Int -> Int -> Stream m Int
432−iterateDropWhileFalse value = iterateSource (S.dropWhile (> (value + 1)))
433−
434483{-# INLINE iterateDropWhileTrue #-}
435484iterateDropWhileTrue :: MonadAsync m
436485 => Int -> Int -> Int -> Int -> Stream m Int
437486iterateDropWhileTrue value = iterateSource (S.dropWhile (<= (value + 1)))
487+#endif
438488
439489#ifdef USE_PRELUDE
440490{-# INLINE tail #-}
@@ -455,8 +505,10 @@ o_n_stack_iterated :: Int -> [Benchmark]
455505o_n_stack_iterated value = by10 `seq` by100 `seq`
456506 [ bgroup "iterated"
457507 [ benchIOSrc "mapM (n/10 x 10)" $ iterateMapM by10 10
508+#ifndef USE_STREAMK
458509 , benchIOSrc "scanl' (quadratic) (n/100 x 100)" $
459510 iterateScan by100 100
511+#endif
460512#ifdef USE_PRELUDE
461513 , benchIOSrc "scanl1' (n/10 x 10)" $ iterateScanl1 by10 10
462514#endif
@@ -465,8 +517,10 @@ o_n_stack_iterated value = by10 `seq` by100 `seq`
465517 , benchIOSrc "takeAll (n/10 x 10)" $
466518 iterateTakeAll value by10 10
467519 , benchIOSrc "dropOne (n/10 x 10)" $ iterateDropOne by10 10
520+#ifdef USE_STREAMK
468521 , benchIOSrc "dropWhileFalse (n/10 x 10)" $
469522 iterateDropWhileFalse value by10 10
523+#endif
470524 , benchIOSrc "dropWhileTrue (n/10 x 10)" $
471525 iterateDropWhileTrue value by10 10
472526#ifdef USE_PRELUDE
@@ -530,13 +584,5 @@ benchmarks moduleName size =
530584 , o_1_space_pipesX4 size
531585 ]
532586 , bgroup (o_n_stack_prefix moduleName) (o_n_stack_iterated size)
533− , bgroup (o_n_heap_prefix moduleName) $ Prelude.concat
534− [
535−#ifdef USE_PRELUDE
536− o_n_space_grouping size
537− ,
538−#endif
539− o_n_space_functor size
540− , o_n_heap_buffering size
541− ]
587+ , bgroup (o_n_heap_prefix moduleName) (o_n_heap_buffering size)
542588 ]
benchmark/Streamly/Benchmark/Data/Stream/Split.hs+6−5
@@ -35,15 +35,15 @@ import qualified Streamly.Internal.FileSystem.Handle as IFH
3535import qualified Streamly.Internal.Unicode.Stream as IUS
3636import qualified Streamly.Prelude as S
3737
38−import Gauge hiding (env)
38+import Test.Tasty.Bench hiding (env)
3939import Prelude hiding (last, length)
4040import Streamly.Benchmark.Common
4141import Streamly.Benchmark.Common.Handle
4242
4343#ifdef INSPECTION
44−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
44+import Streamly.Internal.Data.Stream (Step(..))
4545
46−import qualified Streamly.Internal.Data.Array.Mut.Type as MA
46+import qualified Streamly.Internal.Data.MutArray as MA
4747import qualified Streamly.Internal.Data.Unfold as IUF
4848
4949import Test.Inspection
@@ -143,7 +143,7 @@ splitOnSeq str inh =
143143-- | Split on a word8 sequence.
144144splitOnSeq100k :: Handle -> IO Int
145145splitOnSeq100k inh = do
146− arr <- A.fromStream $ S.replicate 100000 123
146+ arr <- A.fromStream $ IP.toStream $ S.fromSerial $ S.replicate 100000 123
147147 (S.length $ IP.splitOnSeq arr FL.drain
148148 $ S.unfold FH.read inh) -- >>= print
149149
@@ -220,8 +220,9 @@ o_1_space_reduce_read_split env =
220220splitOnSeqUtf8 :: String -> Handle -> IO Int
221221splitOnSeqUtf8 str inh =
222222 (S.length $ IP.splitOnSeq (A.fromList str) FL.drain
223+ $ IP.fromStream
223224 $ IUS.decodeUtf8Arrays
224− $ IFH.getChunks inh) -- >>= print
225+ $ IFH.readChunks inh) -- >>= print
225226
226227o_1_space_reduce_toChunks_split :: BenchEnv -> [Benchmark]
227228o_1_space_reduce_toChunks_split env =
benchmark/Streamly/Benchmark/Data/Stream/StreamD.hs+6−4
@@ -22,15 +22,17 @@
2222
2323module Main (main) where
2424
25+#if !MIN_VERSION_base(4,18,0)
2526import Control.Applicative (liftA2)
27+#endif
2628import Control.Monad (when)
2729import Data.Maybe (isJust)
28−import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
30+import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
2931import System.Random (randomRIO)
3032import Prelude hiding (tail, mapM_, foldl, last, map, mapM, concatMap, zip)
3133
3234import qualified Prelude as P
33−import qualified Streamly.Internal.Data.Stream.StreamD as S
35+import qualified Streamly.Internal.Data.Stream as S
3436import qualified Streamly.Internal.Data.Unfold as UF
3537import qualified Streamly.Internal.Data.Fold as FL
3638
@@ -324,7 +326,7 @@ filterMap n = composeN n $ S.map (subtract 1) . S.filter (<= maxValue)
324326-- Nested Composition
325327-------------------------------------------------------------------------------
326328
327−instance Applicative f => Applicative (S.Stream f) where
329+instance Monad f => Applicative (S.Stream f) where
328330 {-# INLINE pure #-}
329331 pure = S.fromPure
330332
@@ -461,7 +463,7 @@ inspect $ 'unfoldManyRepl `hasNoType` ''SPEC
461463-------------------------------------------------------------------------------
462464
463465moduleName :: String
464−moduleName = "Data.Stream.StreamD"
466+moduleName = "Data.StreamD"
465467
466468o_1_space :: [Benchmark]
467469o_1_space =
benchmark/Streamly/Benchmark/Data/Stream/StreamK.hs+35−35
@@ -21,23 +21,23 @@
2121
2222module Main (main) where
2323
24+#if !MIN_VERSION_base(4,18,0)
2425import Control.Applicative (liftA2)
26+#endif
2527import Control.Monad (when)
2628import Data.Maybe (isJust)
2729import System.Random (randomRIO)
2830import Prelude hiding
29− ( tail, mapM_, foldl, last, map, mapM, concatMap, zipWith, init, iterate
31+ ( Foldable(..), tail, mapM_, last, map, mapM, concatMap, zipWith, init, iterate
3032 , repeat, replicate
3133 )
3234
3335import qualified Prelude as P
3436import qualified Data.List as List
3537
36−import qualified Streamly.Internal.Control.Concurrent as S
37−import qualified Streamly.Internal.Data.Stream.StreamK.Type as S
38−import qualified Streamly.Internal.Data.Stream.StreamK as S
38+import qualified Streamly.Internal.Data.StreamK as S
3939
40−import Gauge (bench, nfIO, bgroup, Benchmark, defaultMain)
40+import Test.Tasty.Bench (bench, nfIO, bgroup, Benchmark, defaultMain)
4141
4242import Streamly.Benchmark.Common
4343
@@ -117,7 +117,7 @@ Benchmarks that need to be added
117117-- Stream generation and elimination
118118-------------------------------------------------------------------------------
119119
120−type Stream m a = S.Stream m a
120+type Stream m a = S.StreamK m a
121121
122122{-# INLINE unfoldr #-}
123123unfoldr :: Int -> Int -> Stream m Int
@@ -129,7 +129,7 @@ unfoldr streamLen n = S.unfoldr step n
129129 else Just (cnt, cnt + 1)
130130
131131{-# INLINE unfoldrM #-}
132−unfoldrM :: S.MonadAsync m => Int -> Int -> Stream m Int
132+unfoldrM :: Monad m => Int -> Int -> Stream m Int
133133unfoldrM streamLen n = S.unfoldrMWith S.consM step n
134134 where
135135 step cnt =
@@ -142,7 +142,7 @@ repeat :: Int -> Int -> Stream m Int
142142repeat streamLen = S.take streamLen . S.repeat
143143
144144{-# INLINE repeatM #-}
145−repeatM :: S.MonadAsync m => Int -> Int -> Stream m Int
145+repeatM :: Monad m => Int -> Int -> Stream m Int
146146repeatM streamLen = S.take streamLen . S.repeatM . return
147147
148148{-# INLINE replicate #-}
@@ -150,7 +150,7 @@ replicate :: Int -> Int -> Stream m Int
150150replicate = S.replicate
151151
152152{-# INLINE replicateM #-}
153−replicateM :: S.MonadAsync m => Int -> Int -> Stream m Int
153+replicateM :: Monad m => Int -> Int -> Stream m Int
154154replicateM streamLen = S.replicateMWith S.consM streamLen . return
155155
156156{-# INLINE iterate #-}
@@ -158,7 +158,7 @@ iterate :: Int -> Int -> Stream m Int
158158iterate streamLen = S.take streamLen . S.iterate (+1)
159159
160160{-# INLINE iterateM #-}
161−iterateM :: S.MonadAsync m => Int -> Int -> Stream m Int
161+iterateM :: Monad m => Int -> Int -> Stream m Int
162162iterateM streamLen = S.take streamLen . S.iterateM (return . (+1)) . return
163163
164164{-# INLINE fromFoldable #-}
@@ -166,26 +166,27 @@ fromFoldable :: Int -> Int -> Stream m Int
166166fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
167167
168168{-# INLINE fromFoldableM #-}
169−fromFoldableM :: S.MonadAsync m => Int -> Int -> Stream m Int
169+fromFoldableM :: Monad m => Int -> Int -> Stream m Int
170170fromFoldableM streamLen n =
171− 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])
172172
173173{-# INLINABLE concatMapFoldableWith #-}
174−concatMapFoldableWith :: Foldable f
174+concatMapFoldableWith :: P.Foldable f
175175 => (Stream m b -> Stream m b -> Stream m b)
176176 -> (a -> Stream m b)
177177 -> f a
178178 -> Stream m b
179−concatMapFoldableWith f g = Prelude.foldr (f . g) S.nil
179+concatMapFoldableWith f g = P.foldr (f . g) S.nil
180180
181181{-# INLINE concatMapFoldableSerial #-}
182182concatMapFoldableSerial :: Int -> Int -> Stream m Int
183−concatMapFoldableSerial streamLen n = concatMapFoldableWith S.serial S.fromPure [n..n+streamLen]
183+concatMapFoldableSerial streamLen n =
184+ concatMapFoldableWith S.append S.fromPure [n..n+streamLen]
184185
185186{-# INLINE concatMapFoldableSerialM #-}
186187concatMapFoldableSerialM :: Monad m => Int -> Int -> Stream m Int
187188concatMapFoldableSerialM streamLen n =
188− concatMapFoldableWith S.serial (S.fromEffect . return) [n..n+streamLen]
189+ concatMapFoldableWith S.append (S.fromEffect . return) [n..n+streamLen]
189190
190191-------------------------------------------------------------------------------
191192-- Elimination
@@ -270,11 +271,11 @@ fmapK :: Monad m => Int -> Stream m Int -> m ()
270271fmapK n = composeN n $ P.fmap (+ 1)
271272
272273{-# INLINE mapM #-}
273−mapM :: S.MonadAsync m => Int -> Stream m Int -> m ()
274+mapM :: Monad m => Int -> Stream m Int -> m ()
274275mapM n = composeN n $ S.mapMWith S.consM return
275276
276277{-# INLINE mapMSerial #-}
277−mapMSerial :: S.MonadAsync m => Int -> Stream m Int -> m ()
278+mapMSerial :: Monad m => Int -> Stream m Int -> m ()
278279mapMSerial n = composeN n $ S.mapMSerial return
279280
280281{-# INLINE filterEven #-}
@@ -326,7 +327,7 @@ foldlS :: Monad m => Int -> Stream m Int -> m ()
326327foldlS n = composeN n $ S.foldlS (flip S.cons) S.nil
327328
328329{-# INLINE intersperse #-}
329−intersperse :: S.MonadAsync m => Int -> Int -> Stream m Int -> m ()
330+intersperse :: Monad m => Int -> Int -> Stream m Int -> m ()
330331intersperse streamLen n = composeN n $ S.intersperse streamLen
331332
332333-------------------------------------------------------------------------------
@@ -335,8 +336,7 @@ intersperse streamLen n = composeN n $ S.intersperse streamLen
335336
336337{-# INLINE iterateSource #-}
337338iterateSource
338− :: S.MonadAsync m
339− => 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
340340iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
341341 where
342342 f (0 :: Int) m = g m
@@ -344,37 +344,37 @@ iterateSource iterStreamLen g i n = f i (unfoldrM iterStreamLen n)
344344
345345-- this is quadratic
346346{-# INLINE iterateScan #-}
347−iterateScan :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
347+iterateScan :: Monad m => Int -> Int -> Int -> Stream m Int
348348iterateScan iterStreamLen maxIters =
349349 iterateSource iterStreamLen (S.scanl' (+) 0) (maxIters `div` 10)
350350
351351-- this is quadratic
352352{-# INLINE iterateDropWhileFalse #-}
353−iterateDropWhileFalse :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
353+iterateDropWhileFalse :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
354354iterateDropWhileFalse streamLen iterStreamLen maxIters =
355355 iterateSource iterStreamLen (S.dropWhile (> streamLen)) (maxIters `div` 10)
356356
357357{-# INLINE iterateMapM #-}
358−iterateMapM :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
358+iterateMapM :: Monad m => Int -> Int -> Int -> Stream m Int
359359iterateMapM iterStreamLen =
360360 iterateSource iterStreamLen (S.mapMWith S.consM return)
361361
362362{-# INLINE iterateFilterEven #-}
363−iterateFilterEven :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
363+iterateFilterEven :: Monad m => Int -> Int -> Int -> Stream m Int
364364iterateFilterEven iterStreamLen = iterateSource iterStreamLen (S.filter even)
365365
366366{-# INLINE iterateTakeAll #-}
367−iterateTakeAll :: S.MonadAsync m => Int -> Int -> Int -> Int -> Stream m Int
367+iterateTakeAll :: Monad m => Int -> Int -> Int -> Int -> Stream m Int
368368iterateTakeAll streamLen iterStreamLen =
369369 iterateSource iterStreamLen (S.take streamLen)
370370
371371{-# INLINE iterateDropOne #-}
372−iterateDropOne :: S.MonadAsync m => Int -> Int -> Int -> Stream m Int
372+iterateDropOne :: Monad m => Int -> Int -> Int -> Stream m Int
373373iterateDropOne iterStreamLen = iterateSource iterStreamLen (S.drop 1)
374374
375375{-# INLINE iterateDropWhileTrue #-}
376−iterateDropWhileTrue :: S.MonadAsync m =>
377− Int -> Int -> Int -> Int -> Stream m Int
376+iterateDropWhileTrue ::
377+ Monad m => Int -> Int -> Int -> Int -> Stream m Int
378378iterateDropWhileTrue streamLen iterStreamLen =
379379 iterateSource iterStreamLen (S.dropWhile (<= streamLen))
380380
@@ -392,7 +392,7 @@ zipWithM src = drain $ S.zipWithM (curry return) src src
392392
393393{-# INLINE sortByK #-}
394394sortByK :: (a -> a -> Ordering) -> Stream m a -> Stream m a
395−sortByK f = S.concatPairsWith (S.mergeBy f) S.fromPure
395+sortByK f = S.mergeMapWith (S.mergeBy f) S.fromPure
396396
397397{-# INLINE sortBy #-}
398398sortBy :: Monad m => Stream m Int -> m ()
@@ -494,7 +494,7 @@ sourceConcatMapId val n =
494494{-# INLINE concatMapBySerial #-}
495495concatMapBySerial :: Int -> Int -> Int -> IO ()
496496concatMapBySerial outer inner n =
497− S.drain $ S.concatMapWith S.serial
497+ S.drain $ S.concatMapWith S.append
498498 (unfoldrM inner)
499499 (unfoldrM outer n)
500500
@@ -502,7 +502,7 @@ concatMapBySerial outer inner n =
502502-- Nested Composition
503503-------------------------------------------------------------------------------
504504
505−instance Monad m => Applicative (S.Stream m) where
505+instance Monad m => Applicative (S.StreamK m) where
506506 {-# INLINE pure #-}
507507 pure = S.fromPure
508508
@@ -521,7 +521,7 @@ instance Monad m => Applicative (S.Stream m) where
521521-- NOTE: even though concatMap for StreamD is 3x faster compared to StreamK,
522522-- the monad instance of StreamD is slower than StreamK after foldr/build
523523-- fusion.
524−instance Monad m => Monad (S.Stream m) where
524+instance Monad m => Monad (S.StreamK m) where
525525 {-# INLINE return #-}
526526 return = pure
527527
@@ -634,7 +634,7 @@ filterAllInNestedList str = do
634634-------------------------------------------------------------------------------
635635
636636moduleName :: String
637−moduleName = "Data.Stream.StreamK"
637+moduleName = "Data.StreamK"
638638
639639o_1_space_generation :: Int -> Benchmark
640640o_1_space_generation streamLen =
@@ -731,7 +731,7 @@ o_1_space_concat streamLen =
731731 -- This is for comparison with concatMapFoldableWith
732732 , benchIOSrc1 "concatMapWithId (n of 1) (fromFoldable)"
733733 (S.drain
734− . S.concatMapWith S.serial id
734+ . S.concatMapWith S.append id
735735 . sourceConcatMapId streamLen)
736736
737737 , benchIOSrc1 "concatMapBy serial (n of 1)"
benchmark/Streamly/Benchmark/Data/Stream/StreamDK.hs → benchmark/Streamly/Benchmark/Data/Stream/StreamKAlt.hsrenamed+3−3
@@ -18,12 +18,12 @@ import Prelude hiding ()
1818-- import qualified Prelude as P
1919-- import qualified Data.List as List
2020
21−import qualified Streamly.Internal.Data.Stream.StreamDK as S
21+import qualified Streamly.Internal.Data.StreamK.Alt as S
2222-- import qualified Streamly.Internal.Data.Stream.Common as SP
2323-- import qualified Streamly.Internal.Data.SVar as S
2424
2525import Streamly.Benchmark.Common
26−import Gauge (bgroup, Benchmark, defaultMain)
26+import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
2727
2828value :: Int
2929value = 100000
@@ -452,4 +452,4 @@ o_1_space =
452452 ]
453453
454454main :: IO ()
455−main = defaultMain $ concat [o_1_space]
455+main = defaultMain [o_1_space]
benchmark/Streamly/Benchmark/Data/Stream/ToStreamK.hs+19−16
@@ -1,5 +1,5 @@
11-- |
2−-- Module : Streamly.Benchmark.Data.Stream.StreamK
2+-- Module : Streamly.Benchmark.Data.StreamK
33-- Copyright : (c) 2018 Composewell Technologies
44--
55-- License : BSD3
@@ -33,14 +33,11 @@ import Prelude hiding
3333import qualified Prelude as P
3434-- import qualified Data.List as List
3535
36−import qualified Streamly.Internal.Control.Concurrent as S
37−import qualified Streamly.Internal.Data.Stream.StreamK.Type as S
38−import qualified Streamly.Internal.Data.Stream.StreamK as S
39−import qualified Streamly.Internal.Data.Stream.StreamD as D
40−-- import qualified Streamly.Internal.Data.Stream as Stream
36+import qualified Streamly.Internal.Data.StreamK as S
37+import qualified Streamly.Internal.Data.Stream as D
4138import qualified Streamly.Internal.Data.Fold as Fold
4239
43−import Gauge (bgroup, Benchmark, defaultMain)
40+import Test.Tasty.Bench (bgroup, Benchmark, defaultMain)
4441
4542import Streamly.Benchmark.Common
4643
@@ -64,7 +61,7 @@ unfoldrD streamLen n = D.toStreamK (D.unfoldr step n)
6461 else Just (cnt, cnt + 1)
6562
6663{-# INLINE unfoldrMD #-}
67−unfoldrMD :: S.MonadAsync m => Int -> Int -> Stream m Int
64+unfoldrMD :: Monad m => Int -> Int -> Stream m Int
6865unfoldrMD streamLen n = D.toStreamK (D.unfoldrM step n)
6966 where
7067 step cnt =
@@ -84,7 +81,7 @@ unfoldrK streamLen n = S.unfoldr step n
8481-}
8582
8683{-# INLINE unfoldrMK #-}
87−unfoldrMK :: S.MonadAsync m => Int -> Int -> Stream m Int
84+unfoldrMK :: Monad m => Int -> Int -> Stream m Int
8885unfoldrMK streamLen n = S.unfoldrMWith S.consM step n
8986 where
9087 step cnt =
@@ -97,7 +94,7 @@ repeat :: Monad m => Int -> Int -> Stream m Int
9794repeat streamLen = S.take streamLen . D.toStreamK . D.repeat
9895
9996{-# INLINE repeatM #-}
100−repeatM :: S.MonadAsync m => Int -> Int -> Stream m Int
97+repeatM :: Monad m => Int -> Int -> Stream m Int
10198repeatM streamLen = S.take streamLen . D.toStreamK . D.repeatM . return
10299
103100{-# INLINE replicate #-}
@@ -105,7 +102,7 @@ replicate :: Monad m => Int -> Int -> Stream m Int
105102replicate x y = D.toStreamK $ D.replicate x y
106103
107104{-# INLINE replicateM #-}
108−replicateM :: S.MonadAsync m => Int -> Int -> Stream m Int
105+replicateM :: Monad m => Int -> Int -> Stream m Int
109106replicateM streamLen = D.toStreamK . D.replicateM streamLen . return
110107
111108{-# INLINE iterate #-}
@@ -113,7 +110,7 @@ iterate :: Monad m => Int -> Int -> Stream m Int
113110iterate streamLen = S.take streamLen . D.toStreamK . D.iterate (+1)
114111
115112{-# INLINE iterateM #-}
116−iterateM :: S.MonadAsync m => Int -> Int -> Stream m Int
113+iterateM :: Monad m => Int -> Int -> Stream m Int
117114iterateM streamLen = S.take streamLen . D.toStreamK . D.iterateM (return . (+1)) . return
118115
119116{-# INLINE fromFoldable #-}
@@ -121,9 +118,9 @@ fromFoldable :: Int -> Int -> Stream m Int
121118fromFoldable streamLen n = S.fromFoldable [n..n+streamLen]
122119
123120{-# INLINE fromFoldableM #-}
124−fromFoldableM :: S.MonadAsync m => Int -> Int -> Stream m Int
121+fromFoldableM :: Monad m => Int -> Int -> Stream m Int
125122fromFoldableM streamLen n =
126− Prelude.foldr S.consM S.nil (Prelude.fmap return [n..n+streamLen])
123+ Prelude.foldr (S.consM . return) S.nil [n .. n + streamLen]
127124
128125{-
129126{-# INLINABLE concatMapFoldableWith #-}
@@ -225,7 +222,7 @@ composeN n f =
225222{-# INLINE scanl' #-}
226223scanl' :: Monad m => Int -> Stream m Int -> m ()
227224scanl' n =
228− composeN n (D.toStreamK . D.scanOnce (Fold.foldl' (+) 0) . D.fromStreamK)
225+ composeN n (D.toStreamK . D.scan (Fold.foldl' (+) 0) . D.fromStreamK)
229226
230227{-# INLINE map #-}
231228map :: Monad m => Int -> Stream m Int -> m ()
@@ -238,7 +235,7 @@ fmapK n = composeN n $ P.fmap (+ 1)
238235-}
239236
240237{-# INLINE mapM #-}
241−mapM :: S.MonadAsync m => Int -> Stream m Int -> m ()
238+mapM :: Monad m => Int -> Stream m Int -> m ()
242239mapM n = composeN n (D.toStreamK . D.mapM return . D.fromStreamK)
243240
244241{-
@@ -620,6 +617,8 @@ filterAllInNestedList str = do
620617moduleName :: String
621618moduleName = "Data.Stream.ToStreamK"
622619
620+-- Generation of StreamK using StreamD generation functions and eleminating
621+-- using StreamK drain.
623622o_1_space_generation :: Int -> Benchmark
624623o_1_space_generation streamLen =
625624 bgroup "generation"
@@ -640,6 +639,7 @@ o_1_space_generation streamLen =
640639 , benchFold "concatMapFoldableWithM" drain (concatMapFoldableSerialM streamLen)
641640 ]
642641
642+-- Generating using StreamK and eliminating using StreamD folds.
643643o_1_space_elimination :: Int -> Benchmark
644644o_1_space_elimination streamLen =
645645 bgroup "elimination"
@@ -671,6 +671,8 @@ o_1_space_nested streamLen =
671671 streamLen3 = round (P.fromIntegral streamLen**(1/3::P.Double)) -- triple nested loop
672672-}
673673
674+-- Generate using StreamK and transform using StreamD transformation functions
675+-- and then drain using StreamK.
674676o_1_space_transformation :: Int -> Benchmark
675677o_1_space_transformation streamLen =
676678 bgroup "transformation"
@@ -694,6 +696,7 @@ o_1_space_transformationX4 streamLen =
694696 -- , benchFold "concatMap" (concatMap 4) (unfoldrM streamLen16)
695697 ]
696698
699+-- Generate using K, fold using K, concat using D.concatMap
697700o_1_space_concat :: Int -> Benchmark
698701o_1_space_concat streamLen =
699702 bgroup "concat"
benchmark/Streamly/Benchmark/Data/Stream/Transform.hs+138−31
@@ -26,32 +26,47 @@
2626
2727module Stream.Transform (benchmarks) where
2828
29−import Control.DeepSeq (NFData(..))
3029import Control.Monad.IO.Class (MonadIO(..))
31−import Data.Functor.Identity (Identity(..))
3230
3331import System.Random (randomRIO)
3432
3533import qualified Streamly.Internal.Data.Fold as FL
3634
37−import qualified Prelude
3835import qualified Stream.Common as Common
39−import qualified Streamly.Internal.Data.Fold as Fold
4036import qualified Streamly.Internal.Data.Unfold as Unfold
37+
4138#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
4243import qualified Streamly.Internal.Data.Stream.IsStream as Stream
4344import Streamly.Internal.Data.Time.Units
4445#else
45−import qualified Streamly.Internal.Data.Stream.Time as Stream
46+import Streamly.Internal.Data.Stream (Stream)
4647import 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
4759#endif
4860
49−import Gauge
50−import Streamly.Internal.Data.Stream (Stream)
61+import Test.Tasty.Bench
5162import Stream.Common hiding (scanl')
5263import Streamly.Benchmark.Common
5364import Prelude hiding (sequence, mapM)
5465
66+#ifdef USE_PRELUDE
67+type Stream = Stream.SerialT
68+#endif
69+
5570-------------------------------------------------------------------------------
5671-- Pipelines (stream-to-stream transformations)
5772-------------------------------------------------------------------------------
@@ -64,32 +79,36 @@ import Prelude hiding (sequence, mapM)
6479-- Traversable Instance
6580-------------------------------------------------------------------------------
6681
82+#ifdef USE_STREAMK
6783{-# INLINE traversableTraverse #-}
68−traversableTraverse :: Stream Identity Int -> IO (Stream Identity Int)
84+traversableTraverse :: StreamK Identity Int -> IO (StreamK Identity Int)
6985traversableTraverse = traverse return
7086
7187{-# INLINE traversableSequenceA #-}
72−traversableSequenceA :: Stream Identity Int -> IO (Stream Identity Int)
88+traversableSequenceA :: StreamK Identity Int -> IO (StreamK Identity Int)
7389traversableSequenceA = sequenceA . Prelude.fmap return
7490
7591{-# INLINE traversableMapM #-}
76−traversableMapM :: Stream Identity Int -> IO (Stream Identity Int)
92+traversableMapM :: StreamK Identity Int -> IO (StreamK Identity Int)
7793traversableMapM = Prelude.mapM return
7894
7995{-# INLINE traversableSequence #-}
80−traversableSequence :: Stream Identity Int -> IO (Stream Identity Int)
96+traversableSequence :: StreamK Identity Int -> IO (StreamK Identity Int)
8197traversableSequence = Prelude.sequence . Prelude.fmap return
8298
8399{-# INLINE benchPureSinkIO #-}
84100benchPureSinkIO
85101 :: NFData b
86− => Int -> String -> (Stream Identity Int -> IO b) -> Benchmark
102+ => Int -> String -> (StreamK Identity Int -> IO b) -> Benchmark
87103benchPureSinkIO value name f =
88− bench name $ nfIO $ randomRIO (1, 1) >>= f . sourceUnfoldr value
104+ bench name
105+ $ nfIO $ randomRIO (1, 1) >>= f . fromStream . sourceUnfoldr value
89106
90−instance NFData a => NFData (Stream Identity a) where
107+instance NFData a => NFData (StreamK Identity a) where
91108 {-# INLINE rnf #-}
92− rnf xs = runIdentity $ Stream.fold (Fold.foldl' (\_ x -> rnf x) ()) xs
109+ rnf xs =
110+ runIdentity
111+ $ Stream.fold (Fold.foldl' (\_ x -> rnf x) ()) (toStream xs)
93112
94113o_n_space_traversable :: Int -> [Benchmark]
95114o_n_space_traversable value =
@@ -102,6 +121,7 @@ o_n_space_traversable value =
102121 , benchPureSinkIO value "sequence" traversableSequence
103122 ]
104123 ]
124+#endif
105125
106126-------------------------------------------------------------------------------
107127-- maps and scans
@@ -166,13 +186,21 @@ timestamped :: (MonadAsync m) => Stream m Int -> m ()
166186timestamped = Stream.drain . Stream.timestamped
167187#endif
168188
189+#ifdef USE_STREAMK
169190{-# INLINE foldrS #-}
170191foldrS :: MonadIO m => Int -> Stream m Int -> m ()
171−foldrS n = composeN n $ Stream.foldrS Stream.cons Stream.nil
192+foldrS n =
193+ composeN n (toStream . StreamK.foldrS StreamK.cons StreamK.nil . fromStream)
172194
173195{-# INLINE foldrSMap #-}
174196foldrSMap :: MonadIO m => Int -> Stream m Int -> m ()
175−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
176204
177205{-
178206{-# INLINE foldrT #-}
@@ -195,14 +223,17 @@ o_1_space_mapping value =
195223 [ bgroup
196224 "mapping"
197225 [
226+#ifdef USE_STREAMK
198227 -- Right folds
199228 benchIOSink value "foldrS" (foldrS 1)
200229 , benchIOSink value "foldrSMap" (foldrSMap 1)
230+ ,
231+#endif
201232 -- , benchIOSink value "foldrT" (foldrT 1)
202233 -- , benchIOSink value "foldrTMap" (foldrTMap 1)
203234
204235 -- Mapping
205− , benchIOSink value "map" (mapN 1)
236+ benchIOSink value "map" (mapN 1)
206237 , bench "sequence" $ nfIO $ randomRIO (1, 1000) >>= \n ->
207238 sequence (sourceUnfoldrAction value n)
208239 , benchIOSink value "mapM" (mapM 1)
@@ -273,6 +304,73 @@ o_1_space_functor value =
273304 ]
274305 ]
275306
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+
276374-------------------------------------------------------------------------------
277375-- Size reducing transformations (filtering)
278376-------------------------------------------------------------------------------
@@ -317,6 +415,7 @@ takeWhileTrue value n = composeN n $ Stream.takeWhile (<= (value + 1))
317415takeWhileMTrue :: MonadIO m => Int -> Int -> Stream m Int -> m ()
318416takeWhileMTrue value n = composeN n $ Stream.takeWhileM (return . (<= (value + 1)))
319417
418+#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
320419{-# INLINE takeInterval #-}
321420takeInterval :: Double -> Int -> Stream IO Int -> IO ()
322421takeInterval i n = composeN n (Stream.takeInterval i)
@@ -329,6 +428,18 @@ takeInterval i n = composeN n (Stream.takeInterval i)
329428-- inspect $ 'takeInterval `hasNoType` ''D.Step
330429#endif
331430
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+
332443{-# INLINE dropOne #-}
333444dropOne :: MonadIO m => Int -> Stream m Int -> m ()
334445dropOne n = composeN n $ Stream.drop 1
@@ -356,17 +467,6 @@ _intervalsOfSum :: MonadAsync m => Double -> Int -> Stream m Int -> m ()
356467_intervalsOfSum i n = composeN n (Stream.intervalsOf i FL.sum)
357468#endif
358469
359−{-# INLINE dropInterval #-}
360−dropInterval :: Double -> Int -> Stream IO Int -> IO ()
361−dropInterval i n = composeN n (Stream.dropInterval i)
362−
363−-- Inspection testing is disabled for dropInterval
364−-- Enable it when looking at it throughly
365−#ifdef INSPECTION
366−-- inspect $ hasNoTypeClasses 'dropInterval
367−-- inspect $ 'dropInterval `hasNoType` ''D.Step
368−#endif
369−
370470{-# INLINE findIndices #-}
371471findIndices :: MonadIO m => Int -> Int -> Stream m Int -> m ()
372472findIndices value n = composeN n $ Stream.findIndices (== (value + 1))
@@ -421,8 +521,10 @@ o_1_space_filtering value =
421521 -- , benchIOSink value "takeWhileM-true" (_takeWhileMTrue value 1)
422522 , benchIOSink value "drop-one" (dropOne 1)
423523 , benchIOSink value "drop-all" (dropAll value 1)
524+#if !defined(USE_STREAMLY_CORE) && !defined(USE_PRELUDE)
424525 , benchIOSink value "takeInterval-all" (takeInterval 10000 1)
425526 , benchIOSink value "dropInterval-all" (dropInterval 10000 1)
527+#endif
426528 , benchIOSink value "dropWhile-true" (dropWhileTrue value 1)
427529 -- , benchIOSink value "dropWhileM-true" (_dropWhileMTrue value 1)
428530 , benchIOSink
@@ -574,7 +676,12 @@ benchmarks moduleName size =
574676 , o_1_space_indexingX4 size
575677 ]
576678 , bgroup (o_n_space_prefix moduleName) $ Prelude.concat
577− [ o_n_space_traversable size
578− , 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
579686 ]
580687 ]
benchmark/Streamly/Benchmark/Data/Unfold.hs+16−7
@@ -31,18 +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.Exception as UF
34+import qualified Streamly.Internal.Data.Unfold.Prelude as UF
3535import qualified Streamly.Internal.Data.Stream as S
36−import qualified Streamly.Internal.Data.Stream.StreamD as D
37−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
3838
39−
40−import Gauge hiding (env)
39+import Test.Tasty.Bench hiding (env)
4140import Prelude hiding (take, filter, zipWith, map, mapM, takeWhile)
4241import Streamly.Benchmark.Common
4342import Streamly.Benchmark.Common.Handle
4443
4544#ifdef INSPECTION
45+import Control.Monad.Catch (MonadCatch)
4646import Test.Inspection
4747#endif
4848
@@ -753,7 +753,7 @@ readWriteOnExceptionUnfold inh devNull =
753753 in S.fold (FH.write devNull) $ S.unfold readEx inh
754754
755755#ifdef INSPECTION
756−inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
756+-- inspect $ hasNoTypeClasses 'readWriteOnExceptionUnfold
757757-- inspect $ 'readWriteOnExceptionUnfold `hasNoType` ''Step
758758#endif
759759
@@ -765,7 +765,8 @@ readWriteHandleExceptionUnfold inh devNull =
765765 in S.fold (FH.write devNull) $ S.unfold readEx inh
766766
767767#ifdef INSPECTION
768−inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
768+-- hasNoTypeClasses started failing in GHC 9.4.4
769+-- inspect $ hasNoTypeClasses 'readWriteHandleExceptionUnfold
769770-- inspect $ 'readWriteHandleExceptionUnfold `hasNoType` ''Step
770771#endif
771772
@@ -776,7 +777,11 @@ readWriteFinally_Unfold inh devNull =
776777 in S.fold (FH.write devNull) $ S.unfold readEx inh
777778
778779#ifdef INSPECTION
780+#if __GLASGOW_HASKELL__ >= 906
781+inspect $ hasNoTypeClassesExcept 'readWriteFinally_Unfold [''MonadCatch]
782+#else
779783inspect $ hasNoTypeClasses 'readWriteFinally_Unfold
784+#endif
780785-- inspect $ 'readWriteFinallyUnfold `hasNoType` ''Step
781786#endif
782787
@@ -792,7 +797,11 @@ readWriteBracket_Unfold inh devNull =
792797 in S.fold (FH.write devNull) $ S.unfold readEx inh
793798
794799#ifdef INSPECTION
800+#if __GLASGOW_HASKELL__ >= 906
801+inspect $ hasNoTypeClassesExcept 'readWriteBracket_Unfold [''MonadCatch]
802+#else
795803inspect $ hasNoTypeClasses 'readWriteBracket_Unfold
804+#endif
796805-- inspect $ 'readWriteBracketUnfold `hasNoType` ''Step
797806#endif
798807
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+51−45
@@ -29,25 +29,26 @@ import GHC.Magic (inline)
2929import GHC.Magic (noinline)
3030import System.IO (Handle)
3131
32+import qualified Streamly.Data.Stream as Stream
33+import qualified Streamly.Data.Fold as Fold
3234import qualified Streamly.FileSystem.Handle as FH
3335import qualified Streamly.Internal.Data.Array as A
34−import qualified Streamly.Internal.Data.Array.Type as AT
3536import qualified Streamly.Internal.Data.Fold as FL
36−import qualified Streamly.Internal.Data.Stream.IsStream as IP
37+import qualified Streamly.Internal.Data.Stream as IP
3738import qualified Streamly.Internal.FileSystem.Handle as IFH
3839import qualified Streamly.Internal.Unicode.Stream as IUS
39−import qualified Streamly.Prelude as S
40+import qualified Streamly.Data.Stream.Prelude as S
4041import qualified Streamly.Unicode.Stream as SS
4142
42−import Gauge hiding (env)
43+import Test.Tasty.Bench hiding (env)
4344import Prelude hiding (last, length)
4445import Streamly.Benchmark.Common.Handle
4546
4647#ifdef INSPECTION
47−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..), FoldMany)
48+import Streamly.Internal.Data.Stream (Step(..), FoldMany)
4849
49−import qualified Streamly.Internal.Data.Array.Mut.Type as MA
50−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
5152import qualified Streamly.Internal.Data.Unfold as IUF
5253
5354import Test.Inspection
@@ -61,31 +62,31 @@ import Test.Inspection
6162
6263-- | Get the last byte from a file bytestream.
6364readLast :: Handle -> IO (Maybe Word8)
64−readLast = S.last . S.unfold FH.reader
65+readLast = S.fold Fold.last . S.unfold FH.reader
6566
6667#ifdef INSPECTION
6768inspect $ hasNoTypeClasses 'readLast
6869inspect $ 'readLast `hasNoType` ''Step -- S.unfold
6970inspect $ 'readLast `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
70−inspect $ 'readLast `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
71+inspect $ 'readLast `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
7172#endif
7273
7374-- assert that flattenArrays constructors are not present
7475-- | Count the number of bytes in a file.
7576readCountBytes :: Handle -> IO Int
76−readCountBytes = S.length . S.unfold FH.reader
77+readCountBytes = S.fold Fold.length . S.unfold FH.reader
7778
7879#ifdef INSPECTION
7980inspect $ hasNoTypeClasses 'readCountBytes
8081inspect $ 'readCountBytes `hasNoType` ''Step -- S.unfold
8182inspect $ 'readCountBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
82−inspect $ 'readCountBytes `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
83+inspect $ 'readCountBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
8384#endif
8485
8586-- | Count the number of lines in a file.
8687readCountLines :: Handle -> IO Int
8788readCountLines =
88− S.length
89+ S.fold Fold.length
8990 . IUS.lines FL.drain
9091 . SS.decodeLatin1
9192 . S.unfold FH.reader
@@ -94,13 +95,13 @@ readCountLines =
9495inspect $ hasNoTypeClasses 'readCountLines
9596inspect $ 'readCountLines `hasNoType` ''Step
9697inspect $ 'readCountLines `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
97−inspect $ 'readCountLines `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
98+inspect $ 'readCountLines `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
9899#endif
99100
100101-- | Count the number of words in a file.
101102readCountWords :: Handle -> IO Int
102103readCountWords =
103− S.length
104+ S.fold Fold.length
104105 . IUS.words FL.drain
105106 . SS.decodeLatin1
106107 . S.unfold FH.reader
@@ -112,13 +113,13 @@ inspect $ hasNoTypeClasses 'readCountWords
112113
113114-- | Sum the bytes in a file.
114115readSumBytes :: Handle -> IO Word8
115−readSumBytes = S.sum . S.unfold FH.reader
116+readSumBytes = S.fold Fold.sum . S.unfold FH.reader
116117
117118#ifdef INSPECTION
118119inspect $ hasNoTypeClasses 'readSumBytes
119120inspect $ 'readSumBytes `hasNoType` ''Step
120121inspect $ 'readSumBytes `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
121−inspect $ 'readSumBytes `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
122+inspect $ 'readSumBytes `hasNoType` ''MutArray.ArrayUnsafe -- FH.read/A.read
122123#endif
123124
124125-- XXX When we mark this with INLINE and we have two benchmarks using S.drain
@@ -132,19 +133,19 @@ inspect $ 'readSumBytes `hasNoType` ''MA.ArrayUnsafe -- FH.read/A.read
132133-- fusion-plugin to propagate INLINE phase information such that this problem
133134-- does not occur.
134135readDrain :: Handle -> IO ()
135−readDrain inh = S.drain $ S.unfold FH.reader inh
136+readDrain inh = S.fold Fold.drain $ S.unfold FH.reader inh
136137
137138-- XXX investigate why we need an INLINE in this case (GHC)
138139{-# INLINE readDecodeLatin1 #-}
139140readDecodeLatin1 :: Handle -> IO ()
140141readDecodeLatin1 inh =
141− S.drain
142+ S.fold Fold.drain
142143 $ SS.decodeLatin1
143144 $ S.unfold FH.reader inh
144145
145146readDecodeUtf8 :: Handle -> IO ()
146147readDecodeUtf8 inh =
147− S.drain
148+ S.fold Fold.drain
148149 $ SS.decodeUtf8
149150 $ S.unfold FH.reader inh
150151
@@ -187,7 +188,7 @@ o_1_space_reduce_read env =
187188-- | Count the number of lines in a file.
188189getChunksConcatUnfoldCountLines :: Handle -> IO Int
189190getChunksConcatUnfoldCountLines inh =
190− S.length
191+ S.fold Fold.length
191192 $ IUS.lines FL.drain
192193 $ SS.decodeLatin1
193194 -- XXX replace with toBytes
@@ -212,46 +213,51 @@ o_1_space_reduce_toBytes env =
212213-------------------------------------------------------------------------------
213214
214215chunksOfSum :: Int -> Handle -> IO Int
215−chunksOfSum n inh = S.length $ S.chunksOf n FL.sum (S.unfold FH.reader inh)
216+chunksOfSum n inh =
217+ S.fold Fold.length $ IP.groupsOf n FL.sum (S.unfold FH.reader inh)
216218
217219foldManyPostChunksOfSum :: Int -> Handle -> IO Int
218220foldManyPostChunksOfSum n inh =
219− S.length $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.reader inh)
221+ S.fold Fold.length
222+ $ IP.foldManyPost (FL.take n FL.sum) (S.unfold FH.reader inh)
220223
221224foldManyChunksOfSum :: Int -> Handle -> IO Int
222225foldManyChunksOfSum n inh =
223− S.length $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.reader inh)
226+ S.fold Fold.length
227+ $ IP.foldMany (FL.take n FL.sum) (S.unfold FH.reader inh)
224228
225229-- XXX investigate why we need an INLINE in this case (GHC)
226230-- Even though allocations remain the same in both cases inlining improves time
227231-- by 4x.
228232-- | Slice in chunks of size n and get the count of chunks.
229−{-# INLINE chunksOf #-}
230−chunksOf :: Int -> Handle -> IO Int
231−chunksOf n inh =
233+{-# INLINE groupsOf #-}
234+groupsOf :: Int -> Handle -> IO Int
235+groupsOf n inh =
232236 -- writeNUnsafe gives 2.5x boost here over writeN.
233− S.length $ S.chunksOf n (AT.writeNUnsafe n) (S.unfold FH.reader inh)
237+ S.fold Fold.length
238+ $ IP.groupsOf n (A.writeNUnsafe n) (S.unfold FH.reader inh)
234239
235240#ifdef INSPECTION
236−inspect $ hasNoTypeClasses 'chunksOf
237−inspect $ 'chunksOf `hasNoType` ''Step
238−inspect $ 'chunksOf `hasNoType` ''FoldMany
239−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
240245 -- FH.read/A.read
241−inspect $ 'chunksOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
246+inspect $ 'groupsOf `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
242247#endif
243248
244−{-# INLINE arraysOf #-}
245−arraysOf :: Int -> Handle -> IO Int
246−arraysOf n inh = S.length $ IP.arraysOf n (S.unfold FH.reader 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)
247253
248254o_1_space_reduce_read_grouped :: BenchEnv -> [Benchmark]
249255o_1_space_reduce_read_grouped env =
250256 [ bgroup "reduce/read/chunks"
251− [ mkBench ("S.chunksOf " ++ show (bigSize env) ++ " FL.sum") env $
257+ [ mkBench ("S.groupsOf " ++ show (bigSize env) ++ " FL.sum") env $
252258 \inh _ ->
253259 chunksOfSum (bigSize env) inh
254− , mkBench "S.chunksOf 1 FL.sum" env $ \inh _ ->
260+ , mkBench "S.groupsOf 1 FL.sum" env $ \inh _ ->
255261 chunksOfSum 1 inh
256262
257263 -- XXX investigate why we need inline/noinline in these cases (GHC)
@@ -274,20 +280,20 @@ o_1_space_reduce_read_grouped env =
274280 $ \inh _ -> inline foldManyChunksOfSum 1 inh
275281
276282 -- 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
277291 , mkBenchSmall "S.chunksOf 1" env $ \inh _ ->
278292 chunksOf 1 inh
279293 , mkBench "S.chunksOf 10" env $ \inh _ ->
280294 chunksOf 10 inh
281295 , mkBench "S.chunksOf 1000" env $ \inh _ ->
282296 chunksOf 1000 inh
283−
284− -- arraysOf may use a different impl than chunksOf
285− , mkBenchSmall "S.arraysOf 1" env $ \inh _ ->
286− arraysOf 1 inh
287− , mkBench "S.arraysOf 10" env $ \inh _ ->
288− arraysOf 10 inh
289− , mkBench "S.arraysOf 1000" env $ \inh _ ->
290− arraysOf 1000 inh
291297 ]
292298 ]
293299
benchmark/Streamly/Benchmark/FileSystem/Handle/ReadWrite.hs+12−13
@@ -32,18 +32,17 @@ import qualified Streamly.FileSystem.Handle as FH
3232import qualified Streamly.Internal.Data.Unfold as IUF
3333import qualified Streamly.Internal.FileSystem.Handle as IFH
3434import qualified Streamly.Data.Array as A
35−import qualified Streamly.Prelude as S
35+import qualified Streamly.Data.Stream.Prelude as S
3636
37−import Gauge hiding (env)
37+import Test.Tasty.Bench hiding (env)
3838import Streamly.Benchmark.Common.Handle
3939
4040#ifdef INSPECTION
41−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
41+import Streamly.Internal.Data.Stream (Step(..))
4242
43−import qualified Streamly.Internal.Data.Stream.StreamD.Type as D
43+import qualified Streamly.Internal.Data.Stream as D
4444import qualified Streamly.Internal.Data.Tuple.Strict as Strict
45−import qualified Streamly.Internal.Data.Array.Mut.Stream as MAS
46−import qualified Streamly.Internal.Data.Array.Type as AT
45+import qualified Streamly.Internal.Data.MutArray as MutArray
4746
4847import Test.Inspection
4948#endif
@@ -83,7 +82,7 @@ copyStream inh outh = S.fold (FH.write outh) (S.unfold FH.reader inh)
8382inspect $ hasNoTypeClasses 'copyStream
8483inspect $ 'copyStream `hasNoType` ''Step -- S.unfold
8584inspect $ 'copyStream `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
86−inspect $ 'copyStream `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
85+inspect $ 'copyStream `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
8786 -- FH.read/A.read
8887inspect $ 'copyStream `hasNoType` ''Strict.Tuple3' -- FH.write/chunksOf
8988#endif
@@ -109,8 +108,8 @@ readFromBytesNull inh devNull = IFH.putBytes devNull $ S.unfold FH.reader inh
109108#ifdef INSPECTION
110109inspect $ hasNoTypeClasses 'readFromBytesNull
111110inspect $ 'readFromBytesNull `hasNoType` ''Step
112−inspect $ 'readFromBytesNull `hasNoType` ''MAS.SpliceState
113−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
114113inspect $ 'readFromBytesNull `hasNoType` ''D.FoldMany
115114#endif
116115
@@ -123,8 +122,8 @@ readWithFromBytesNull inh devNull =
123122#ifdef INSPECTION
124123inspect $ hasNoTypeClasses 'readWithFromBytesNull
125124inspect $ 'readWithFromBytesNull `hasNoType` ''Step
126−inspect $ 'readWithFromBytesNull `hasNoType` ''MAS.SpliceState
127−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
128127inspect $ 'readWithFromBytesNull `hasNoType` ''D.FoldMany
129128#endif
130129
@@ -171,7 +170,7 @@ writeReadWith inh devNull = IUF.fold fld unf (defaultChunkSize, inh)
171170inspect $ hasNoTypeClasses 'writeReadWith
172171inspect $ 'writeReadWith `hasNoType` ''Step
173172inspect $ 'writeReadWith `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
174−inspect $ 'writeReadWith `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
173+inspect $ 'writeReadWith `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
175174 -- FH.read/A.read
176175#endif
177176
@@ -188,7 +187,7 @@ writeRead inh devNull = IUF.fold fld unf inh
188187inspect $ hasNoTypeClasses 'writeRead
189188inspect $ 'writeRead `hasNoType` ''Step
190189inspect $ 'writeRead `hasNoType` ''IUF.ConcatState -- FH.read/UF.many
191−inspect $ 'writeRead `hasNoType` ''AT.ArrayUnsafe -- FH.write/writeNUnsafe
190+inspect $ 'writeRead `hasNoType` ''MutArray.ArrayUnsafe -- FH.write/writeNUnsafe
192191 -- FH.read/A.read
193192#endif
194193
benchmark/Streamly/Benchmark/Prelude/Adaptive.hs+1−1
@@ -10,7 +10,7 @@
1010import Control.Concurrent (threadDelay)
1111import Control.Monad (when)
1212import Control.Monad.IO.Class (liftIO)
13−import Gauge
13+import Test.Tasty.Bench
1414import Streamly.Prelude as S
1515import System.Random (randomRIO)
1616
benchmark/Streamly/Benchmark/Prelude/Ahead.hs+1−1
@@ -15,7 +15,7 @@ import qualified Streamly.Prelude as S
1515import Streamly.Benchmark.Common
1616import Streamly.Benchmark.Prelude
1717
18−import Gauge
18+import Test.Tasty.Bench
1919
2020moduleName :: String
2121moduleName = "Prelude.Ahead"
benchmark/Streamly/Benchmark/Prelude/Async.hs+1−1
@@ -16,7 +16,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream.Transform as Transform
1616import Streamly.Benchmark.Common
1717import Streamly.Benchmark.Prelude
1818
19−import Gauge
19+import Test.Tasty.Bench
2020
2121moduleName :: String
2222moduleName = "Prelude.Async"
benchmark/Streamly/Benchmark/Prelude/Concurrent.hs+1−1
@@ -15,7 +15,7 @@ import Streamly.Prelude
1515 , fromWAsync, parallel, fromParallel
1616 )
1717
18−import Gauge
18+import Test.Tasty.Bench
1919import qualified Streamly.Prelude as S
2020
2121-------------------------------------------------------------------------------
benchmark/Streamly/Benchmark/Prelude/Merge.hs+2−2
@@ -30,13 +30,13 @@ import qualified Streamly.Internal.Data.Stream.IsStream as Stream
3030import Streamly.Benchmark.Common
3131import Streamly.Benchmark.Prelude
3232
33−import Gauge
33+import Test.Tasty.Bench
3434
3535#ifdef INSPECTION
3636import GHC.Types (SPEC(..))
3737import Test.Inspection
3838
39−import qualified Streamly.Internal.Data.Stream.StreamD as D
39+import qualified Streamly.Internal.Data.Stream as D
4040#endif
4141
4242moduleName :: String
benchmark/Streamly/Benchmark/Prelude/Parallel.hs+1−1
@@ -22,7 +22,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream as Internal
2222import Streamly.Benchmark.Common
2323import Streamly.Benchmark.Prelude
2424
25−import Gauge
25+import Test.Tasty.Bench
2626
2727moduleName :: String
2828moduleName = "Prelude.Parallel"
benchmark/Streamly/Benchmark/Prelude/Rate.hs+1−1
@@ -14,7 +14,7 @@ import qualified Streamly.Prelude as S
1414import Streamly.Benchmark.Common
1515import Streamly.Benchmark.Prelude
1616
17−import Gauge
17+import Test.Tasty.Bench
1818
1919moduleName :: String
2020moduleName = "Prelude.Rate"
benchmark/Streamly/Benchmark/Prelude/WAsync.hs+1−1
@@ -15,7 +15,7 @@ import qualified Streamly.Prelude as S
1515import Streamly.Benchmark.Common
1616import Streamly.Benchmark.Prelude
1717
18−import Gauge
18+import Test.Tasty.Bench
1919
2020moduleName :: String
2121moduleName = "Prelude.WAsync"
benchmark/Streamly/Benchmark/Prelude/WSerial.hs+2−2
@@ -29,13 +29,13 @@ import qualified Streamly.Internal.Data.Unfold as UF
2929import Streamly.Benchmark.Common
3030import Streamly.Benchmark.Prelude
3131
32−import Gauge
32+import Test.Tasty.Bench
3333
3434#ifdef INSPECTION
3535import GHC.Types (SPEC(..))
3636import Test.Inspection
3737
38−import qualified Streamly.Internal.Data.Stream.StreamD as D
38+import qualified Streamly.Internal.Data.Stream as D
3939#endif
4040
4141moduleName :: String
benchmark/Streamly/Benchmark/Prelude/ZipAsync.hs+1−1
@@ -15,7 +15,7 @@ import qualified Streamly.Prelude as S
1515import Streamly.Benchmark.Common
1616import Streamly.Benchmark.Prelude
1717
18−import Gauge
18+import Test.Tasty.Bench
1919
2020moduleName :: String
2121moduleName = "Prelude.ZipAsync"
benchmark/Streamly/Benchmark/Prelude/ZipSerial.hs+2−2
@@ -29,13 +29,13 @@ import qualified Streamly.Prelude as S
2929import Streamly.Benchmark.Common
3030import Streamly.Benchmark.Prelude hiding (sourceUnfoldrM)
3131
32−import Gauge
32+import Test.Tasty.Bench
3333
3434#ifdef INSPECTION
3535import GHC.Types (SPEC(..))
3636import Test.Inspection
3737
38−import qualified Streamly.Internal.Data.Stream.StreamD as D
38+import qualified Streamly.Internal.Data.Stream as D
3939#endif
4040
4141moduleName :: String
benchmark/Streamly/Benchmark/Unicode/Char.hs+2−2
@@ -16,7 +16,7 @@ import Control.DeepSeq (NFData(..))
1616import Streamly.Internal.Data.Array (Array)
1717import System.FilePath (dropExtensions, takeFileName)
1818import System.FilePath.Posix ((</>))
19−import Gauge.Main (Benchmark, bench, bgroup, defaultMain, env, nfIO)
19+import Test.Tasty.Bench (Benchmark, bench, bgroup, defaultMain, env, nfIO)
2020import Streamly.Internal.Unicode.Char
2121 ( NormalizationMode(NFC, NFD, NFKC, NFKD)
2222 , normalize
@@ -24,7 +24,7 @@ import Streamly.Internal.Unicode.Char
2424import Streamly.Benchmark.Common (o_1_space_prefix)
2525
2626import qualified Streamly.Internal.Data.Array as Array
27−import qualified Streamly.Internal.Data.Stream.IsStream as IsStream
27+import qualified Streamly.Internal.Data.Stream as IsStream
2828import qualified System.Directory as Dir
2929
3030--------------------------------------------------------------------------------
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+39−13
@@ -11,6 +11,11 @@
1111{-# LANGUAGE CPP #-}
1212{-# LANGUAGE ScopedTypeVariables #-}
1313
14+#undef FUSION_CHECK
15+#ifdef FUSION_CHECK
16+{-# OPTIONS_GHC -ddump-simpl -ddump-to-file -dsuppress-all #-}
17+#endif
18+
1419#ifdef __HADDOCK_VERSION__
1520#undef INSPECTION
1621#endif
@@ -20,27 +25,30 @@
2025{-# OPTIONS_GHC -fplugin Test.Inspection.Plugin #-}
2126#endif
2227
28+import Streamly.Data.Stream (Stream)
29+import Streamly.Data.Fold (Fold)
2330import Prelude hiding (last, length)
2431import System.IO (Handle)
2532
2633import qualified Streamly.Data.Array as Array
2734import qualified Streamly.Data.Fold as Fold
28−import qualified Streamly.Internal.Data.Stream.IsStream as Stream
35+import qualified Streamly.Internal.Data.Stream as Stream
2936import qualified Streamly.Internal.Data.Unfold as Unfold
3037import qualified Streamly.Internal.FileSystem.Handle as Handle
3138import qualified Streamly.Internal.Unicode.Array as UnicodeArr
3239import qualified Streamly.Internal.Unicode.Stream as Unicode
3340
34−import Gauge hiding (env)
41+import Test.Tasty.Bench hiding (env)
3542import Streamly.Benchmark.Common
3643import Streamly.Benchmark.Common.Handle
3744
3845#ifdef INSPECTION
39−import Streamly.Internal.Data.Unboxed (Unbox)
40−import Streamly.Internal.Data.Stream.StreamD.Type (Step(..))
41−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
4251import qualified Streamly.Internal.Data.Tuple.Strict as Strict
43−import qualified Streamly.Internal.Data.Array.Type as Array
4452
4553import Test.Inspection
4654#endif
@@ -54,7 +62,7 @@ copyCodecUtf8ArraysLenient :: Handle -> Handle -> IO ()
5462copyCodecUtf8ArraysLenient inh outh =
5563 Stream.fold (Handle.write outh)
5664 $ Unicode.encodeUtf8'
57− $ Unicode.decodeUtf8Arrays
65+ $ Unicode.decodeUtf8Chunks
5866 $ Handle.readChunks inh
5967
6068#ifdef INSPECTION
@@ -75,13 +83,19 @@ o_1_space_decode_encode_chunked env =
7583-- copy with group/ungroup transformations
7684-------------------------------------------------------------------------------
7785
86+{-# INLINE splitOnSuffix #-}
87+splitOnSuffix
88+ :: (Monad m)
89+ => (a -> Bool) -> Fold m a b -> Stream m a -> Stream m b
90+splitOnSuffix predicate f = Stream.foldMany (Fold.takeEndBy_ predicate f)
91+
7892{-# NOINLINE linesUnlinesCopy #-}
7993linesUnlinesCopy :: Handle -> Handle -> IO ()
8094linesUnlinesCopy inh outh =
8195 Stream.fold (Handle.write outh)
8296 $ Unicode.encodeLatin1'
8397 $ Unicode.unlines Unfold.fromList
84− $ Stream.splitOnSuffix (== '\n') Fold.toList
98+ $ splitOnSuffix (== '\n') Fold.toList
8599 $ Unicode.decodeLatin1
86100 $ Stream.unfold Handle.reader inh
87101
@@ -90,7 +104,7 @@ linesUnlinesArrayWord8Copy :: Handle -> Handle -> IO ()
90104linesUnlinesArrayWord8Copy inh outh =
91105 Stream.fold (Handle.write outh)
92106 $ Stream.interposeSuffix 10 Array.reader
93− $ Stream.splitOnSuffix (== 10) Array.write
107+ $ splitOnSuffix (== 10) Array.write
94108 $ Stream.unfold Handle.reader inh
95109
96110-- XXX splitSuffixOn requires -funfolding-use-threshold=150 for better fusion
@@ -210,7 +224,7 @@ inspect $ 'copyStreamLatin1' `hasNoType` ''Step
210224inspect $ 'copyStreamLatin1' `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.many
211225
212226inspect $ 'copyStreamLatin1' `hasNoType` ''Fold.Step
213−inspect $ 'copyStreamLatin1' `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
227+inspect $ 'copyStreamLatin1' `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
214228 -- Handle.read/Array.read
215229inspect $ 'copyStreamLatin1' `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
216230#endif
@@ -231,7 +245,7 @@ inspect $ 'copyStreamLatin1 `hasNoType` ''Unfold.ConcatState -- Handle.read/UF.m
231245
232246inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.ManyState
233247inspect $ 'copyStreamLatin1 `hasNoType` ''Fold.Step
234−inspect $ 'copyStreamLatin1 `hasNoType` ''Array.ArrayUnsafe -- Handle.write/writeNUnsafe
248+inspect $ 'copyStreamLatin1 `hasNoType` ''MutArray.ArrayUnsafe -- Handle.write/writeNUnsafe
235249 -- Handle.read/Array.read
236250inspect $ 'copyStreamLatin1 `hasNoType` ''Strict.Tuple3' -- Handle.write/chunksOf
237251#endif
@@ -272,7 +286,8 @@ _copyStreamUtf8'Fold :: Handle -> Handle -> IO ()
272286_copyStreamUtf8'Fold inh outh =
273287 Stream.fold (Handle.write outh)
274288 $ Unicode.encodeUtf8
275− $ Stream.foldMany Unicode.writeCharUtf8'
289+ $ Stream.catRights
290+ $ Stream.parseMany Unicode.writeCharUtf8'
276291 $ Stream.unfold Handle.reader inh
277292
278293{-# NOINLINE _copyStreamUtf8Parser #-}
@@ -280,7 +295,7 @@ _copyStreamUtf8Parser :: Handle -> Handle -> IO ()
280295_copyStreamUtf8Parser inh outh =
281296 Stream.fold (Handle.write outh)
282297 $ Unicode.encodeUtf8
283− $ Stream.rights $ Stream.parseMany
298+ $ Stream.catRights $ Stream.parseMany
284299 (Unicode.parseCharUtf8With Unicode.TransliterateCodingFailure)
285300 $ Stream.unfold Handle.reader inh
286301
@@ -309,6 +324,7 @@ o_1_space_decode_encode_read env =
309324
310325main :: IO ()
311326main = do
327+#ifndef FUSION_CHECK
312328 env <- mkHandleBenchEnv
313329 defaultMain (allBenchmarks env)
314330
@@ -321,3 +337,13 @@ main = do
321337 , o_1_space_decode_encode_read env
322338 ]
323339 ]
340+#else
341+ -- Enable FUSION_CHECK macro at the beginning of the file
342+ -- Enable one benchmark below, and run the benchmark
343+ -- Check the .dump-simpl output
344+ env <- mkHandleBenchEnv
345+ let mkHandles (RefHandles {bigInH = inh, outputH = outh}) = Handles inh outh
346+ (Handles inh outh) <- getHandles env mkHandles
347+ copyStreamLatin1' inh outh
348+ return ()
349+#endif
benchmark/Streamly/Benchmark/Unicode/Utf8.hs+1−1
@@ -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
benchmark/bench-runner/Main.hs+88−42
@@ -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,25 +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"
54− | "Data.Stream.ConcurrentInterleaved/o-1-space.monad-outer-product.toNullAp" `isPrefixOf` benchName = "-M32M"
55− | "Data.Stream.ConcurrentEager/o-1-space.monad-outer-product.toNullAp" `isPrefixOf` benchName = "-M1024M -K4M"
56− | "Data.Stream.ConcurrentEager/o-1-space." `isPrefixOf` benchName = "-M512M -K4M"
5750 | "Prelude.WSerial/o-n-space." `isPrefixOf` benchName = "-K4M"
5851 | "Prelude.Async/o-n-space.monad-outer-product." `isPrefixOf` benchName =
5952 "-K4M"
@@ -66,27 +59,80 @@ rtsOpts exeName benchName0 = unwords [general, exeSpecific, benchSpecific]
6659 "-M64M"
6760 | "Prelude.WAsync/o-n-space.monad-outer-product." `isPrefixOf` benchName =
6861 "-K4M"
69− | "Data.Parser.ParserD/o-1-space.some" == benchName = "-K8M"
70− | "Data.Parser/o-1-space.some" == benchName = "-K8M"
71− | "Data.Parser.ParserD/o-1-space.manyTill" == benchName = "-K4M"
72− | "Data.Parser/o-1-space.manyTill" == benchName = "-K4M"
73− | "Data.Parser/o-n-heap.manyAlt" == benchName = "-K4M -M128M"
74− | "Data.Parser/o-n-heap.someAlt" == benchName = "-K4M -M128M"
75− | "Data.Parser/o-n-heap.choice" == benchName = "-K16M -M32M"
76− | "Data.Parser.ParserK/o-n-heap.manyAlt" == benchName = "-K4M -M128M"
77− | "Data.Parser.ParserK/o-n-heap.someAlt" == benchName = "-K4M -M128M"
78− | "Data.Parser.ParserK/o-n-heap.sequence" == benchName = "-M64M"
79− | "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+
80113 | "Data.Array" `isPrefixOf` benchName
81114 && "/o-1-space.generation.read" `isSuffixOf` benchName = "-M32M"
115+ -- XXX GHC 9.6 onwards needs 64M, earlier it was 32M
82116 | "Data.Array" `isPrefixOf` benchName
83− && "/o-1-space.generation.show" `isSuffixOf` benchName = "-M32M"
84− | "Data.Array.Generic/o-1-space.transformationX4.map" == benchName = "-M32M"
85− | "Data.Array/o-1-space.elimination.foldable.foldl"
86− `isPrefixOf` benchName = "-K8M"
87− | "Data.Array/o-1-space.elimination.foldable.sum" == benchName =
88− "-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+
89134 | "Unicode.Char/o-1-space." `isPrefixOf` benchName = "-M32M"
135+
90136 | otherwise = ""
91137
92138speedOpts :: 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+1−1
@@ -82,7 +82,7 @@ import qualified Streamly.Internal.Data.Stream.IsStream.Type as IsStream
8282import qualified Streamly.Internal.Data.Pipe as Pipe
8383import qualified Streamly.Internal.Data.Stream.Serial as Serial
8484
85−import Gauge
85+import Test.Tasty.Bench
8686import Streamly.Internal.Data.Time.Units
8787
8888-- Common polymorphic stream APIs used across multiple stream modules
benchmark/streamly-benchmarks.cabal+255−162
@@ -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,12 +258,38 @@ benchmark Data.Stream
232258 Stream.Transform
233259 Stream.Reduce
234260 Stream.Expand
261+ Stream.Lift
262+ Stream.Common
263+ if !flag(use-streamly-core)
264+ other-modules:
235265 Stream.Exceptions
266+ if flag(limit-build-mem)
267+ if flag(dev)
268+ ghc-options: +RTS -M3500M -RTS
269+ else
270+ ghc-options: +RTS -M2500M -RTS
271+
272+-- Use StreamK functions where possible, converting to StreaK to StreamD
273+benchmark Data.Stream.StreamDK
274+ import: bench-options
275+ type: exitcode-stdio-1.0
276+ hs-source-dirs: Streamly/Benchmark/Data
277+ main-is: Stream.hs
278+ other-modules:
279+ Stream.Generate
280+ Stream.Eliminate
281+ Stream.Transform
282+ Stream.Reduce
283+ Stream.Expand
236284 Stream.Lift
237285 Stream.Common
238− if flag(use-prelude)
286+ if !flag(use-streamly-core)
239287 other-modules:
240− Stream.Split
288+ Stream.Exceptions
289+ -- Cannot use USE_STREAMK and USE_PRELUDE together
290+ if flag(use-prelude)
291+ buildable: False
292+ cpp-options: -DUSE_STREAMK
241293 if flag(limit-build-mem)
242294 if flag(dev)
243295 ghc-options: +RTS -M3500M -RTS
@@ -296,93 +348,35 @@ benchmark Data.Stream.ConcurrentOrdered
296348 else
297349 buildable: True
298350
299−benchmark Prelude.WSerial
300− import: bench-options
301− type: exitcode-stdio-1.0
302− hs-source-dirs: Streamly/Benchmark/Prelude
303− main-is: WSerial.hs
304− if flag(use-streamly-core) || impl(ghcjs)
305− buildable: False
306− else
307− buildable: True
308− if flag(limit-build-mem)
309− ghc-options: +RTS -M750M -RTS
310−
311−benchmark Prelude.Merge
351+benchmark Data.Unbox
312352 import: bench-options
313353 type: exitcode-stdio-1.0
314− hs-source-dirs: Streamly/Benchmark/Prelude
315− main-is: Merge.hs
316− if flag(use-streamly-core) || impl(ghcjs)
317− buildable: False
318− else
319− buildable: True
354+ hs-source-dirs: .
355+ cpp-options: -DUSE_UNBOX
356+ main-is: Streamly/Benchmark/Data/Serialize.hs
320357
321−benchmark Prelude.ZipSerial
358+benchmark Data.Unbox.Derive.TH
322359 import: bench-options
323360 type: exitcode-stdio-1.0
324− hs-source-dirs: Streamly/Benchmark/Prelude
325− main-is: ZipSerial.hs
326− if flag(use-streamly-core) || impl(ghcjs)
327− buildable: False
328− else
329− buildable: True
361+ hs-source-dirs: .
362+ cpp-options: -DUSE_UNBOX
363+ cpp-options: -DUSE_TH
364+ main-is: Streamly/Benchmark/Data/Serialize.hs
330365
331−benchmark Prelude.ZipAsync
366+benchmark Data.Serialize
332367 import: bench-options
333368 type: exitcode-stdio-1.0
334− hs-source-dirs: Streamly/Benchmark/Prelude
335− main-is: ZipAsync.hs
336− if flag(use-streamly-core) || impl(ghcjs)
337− buildable: False
338− else
339− 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
340377 if flag(limit-build-mem)
341378 ghc-options: +RTS -M1000M -RTS
342379
343−benchmark Prelude.Ahead
344− import: bench-options-threaded
345− type: exitcode-stdio-1.0
346− hs-source-dirs: Streamly/Benchmark/Prelude
347− main-is: Ahead.hs
348− if flag(use-streamly-core) || impl(ghcjs)
349− buildable: False
350− else
351− buildable: True
352−
353−benchmark Prelude.Async
354− import: bench-options-threaded
355− type: exitcode-stdio-1.0
356− hs-source-dirs: Streamly/Benchmark/Prelude
357− main-is: Async.hs
358− if flag(use-streamly-core) || impl(ghcjs)
359− buildable: False
360− else
361− buildable: True
362−
363−benchmark Prelude.WAsync
364− import: bench-options-threaded
365− type: exitcode-stdio-1.0
366− hs-source-dirs: Streamly/Benchmark/Prelude
367− main-is: WAsync.hs
368− if flag(use-streamly-core) || impl(ghcjs)
369− buildable: False
370− else
371− buildable: True
372−
373−benchmark Prelude.Parallel
374− import: bench-options-threaded
375− type: exitcode-stdio-1.0
376− hs-source-dirs: Streamly/Benchmark/Prelude
377− main-is: Parallel.hs
378− if flag(use-streamly-core) || impl(ghcjs)
379− buildable: False
380− else
381− buildable: True
382− if flag(limit-build-mem)
383− ghc-options: +RTS -M2000M -RTS
384−
385−
386380benchmark Data.Unfold
387381 import: bench-options
388382 type: exitcode-stdio-1.0
@@ -413,12 +407,12 @@ benchmark Data.Fold.Window
413407 else
414408 buildable: True
415409
416−benchmark Data.Parser.ParserD
410+benchmark Data.Parser
417411 import: bench-options
418412 type: exitcode-stdio-1.0
419− hs-source-dirs: Streamly/Benchmark/Data/Parser
420− main-is: ParserD.hs
421− if flag(use-streamly-core) || impl(ghcjs)
413+ hs-source-dirs: Streamly/Benchmark/Data
414+ main-is: Parser.hs
415+ if impl(ghcjs)
422416 buildable: False
423417 else
424418 buildable: True
@@ -427,90 +421,77 @@ benchmark Data.Parser.ParserD
427421 if flag(dev)
428422 ghc-options: +RTS -M3000M -RTS
429423 else
430− ghc-options: +RTS -M750M -RTS
424+ ghc-options: +RTS -M2000M -RTS
431425
432−benchmark Data.Parser.ParserK
426+benchmark Data.ParserK
433427 import: bench-options
434428 type: exitcode-stdio-1.0
435− hs-source-dirs: Streamly/Benchmark/Data/Parser
429+ hs-source-dirs: Streamly/Benchmark/Data
430+ cpp-options: -DBENCH_SINGULAR
436431 main-is: ParserK.hs
437− if flag(use-streamly-core) || impl(ghcjs)
432+ if impl(ghcjs)
438433 buildable: False
439434 else
440435 buildable: True
441436 build-depends: exceptions >= 0.8 && < 0.11
442437
443−-- Note: to use this we have to set DISABLE_FUSION in ParserD.hs so that
444−-- the rewrite rules are disabled. We can also use the "no-fusion" build
445−-- flag but we need to keep in mind that it disables fusion for streams
446−-- as well.
447−benchmark Data.Parser.FromParserK
438+benchmark Data.ParserK.Chunked
448439 import: bench-options
449440 type: exitcode-stdio-1.0
450− hs-source-dirs: Streamly/Benchmark/Data/Parser
451− cpp-options: -DFROM_PARSERK
441+ hs-source-dirs: Streamly/Benchmark/Data
442+ cpp-options: -DBENCH_CHUNKED
452443 main-is: ParserK.hs
453− if flag(use-streamly-core) || impl(ghcjs)
444+ if impl(ghcjs)
454445 buildable: False
455446 else
456447 buildable: True
457448 build-depends: exceptions >= 0.8 && < 0.11
458449
459−benchmark Data.Parser
450+benchmark Data.ParserK.Chunked.Generic
460451 import: bench-options
461452 type: exitcode-stdio-1.0
462453 hs-source-dirs: Streamly/Benchmark/Data
463− main-is: Parser.hs
464− if flag(use-streamly-core) || impl(ghcjs)
454+ cpp-options: -DBENCH_CHUNKED_GENERIC
455+ main-is: ParserK.hs
456+ if impl(ghcjs)
465457 buildable: False
466458 else
467459 buildable: True
468460 build-depends: exceptions >= 0.8 && < 0.11
469− if flag(limit-build-mem)
470− if flag(dev)
471− ghc-options: +RTS -M3000M -RTS
472− else
473− ghc-options: +RTS -M1000M -RTS
474461
475462-------------------------------------------------------------------------------
476463-- Raw Streams
477464-------------------------------------------------------------------------------
478465
479−benchmark Data.Stream.StreamD
466+benchmark Data.StreamD
480467 import: bench-options
481468 type: exitcode-stdio-1.0
482469 hs-source-dirs: Streamly/Benchmark/Data/Stream
483470 main-is: StreamD.hs
484471 if impl(ghcjs)
485472 buildable: False
486− else
487− buildable: True
488473
489−benchmark Data.Stream.StreamK
474+benchmark Data.StreamK
490475 import: bench-options
491476 type: exitcode-stdio-1.0
492477 hs-source-dirs: Streamly/Benchmark/Data/Stream
493478 main-is: StreamK.hs
494479 if impl(ghcjs)
495480 buildable: False
496− else
497− buildable: True
498481
499482benchmark Data.Stream.ToStreamK
500483 import: bench-options
501484 type: exitcode-stdio-1.0
502485 hs-source-dirs: Streamly/Benchmark/Data/Stream
503486 main-is: ToStreamK.hs
504− if impl(ghcjs)
487+ if !flag(dev) || impl(ghcjs)
505488 buildable: False
506− else
507− buildable: True
508489
509−benchmark Data.Stream.StreamDK
490+benchmark Data.StreamK.Alt
510491 import: bench-options
511492 type: exitcode-stdio-1.0
512493 hs-source-dirs: Streamly/Benchmark/Data/Stream
513− main-is: StreamDK.hs
494+ main-is: StreamKAlt.hs
514495 if !flag(dev) || impl(ghcjs)
515496 buildable: False
516497
@@ -518,11 +499,115 @@ executable nano-bench
518499 import: bench-options
519500 hs-source-dirs: .
520501 main-is: NanoBenchmarks.hs
521− if flag(dev)
522− buildable: True
523− else
502+ if !flag(dev)
524503 buildable: False
525504
505+-------------------------------------------------------------------------------
506+-- Streamly.Prelude
507+-------------------------------------------------------------------------------
508+
509+benchmark Prelude
510+ import: bench-options
511+ type: exitcode-stdio-1.0
512+ hs-source-dirs: Streamly/Benchmark/Data
513+ main-is: Stream.hs
514+ other-modules:
515+ Stream.Generate
516+ Stream.Eliminate
517+ Stream.Transform
518+ Stream.Reduce
519+ Stream.Expand
520+ Stream.Lift
521+ Stream.Common
522+ Stream.Split
523+ Stream.Exceptions
524+ cpp-options: -DUSE_PRELUDE
525+ if !flag(use-prelude)
526+ buildable: False
527+ if flag(limit-build-mem)
528+ if flag(dev)
529+ ghc-options: +RTS -M3500M -RTS
530+ else
531+ ghc-options: +RTS -M2500M -RTS
532+
533+benchmark Prelude.WSerial
534+ import: bench-options
535+ type: exitcode-stdio-1.0
536+ hs-source-dirs: Streamly/Benchmark/Prelude
537+ main-is: WSerial.hs
538+ cpp-options: -DUSE_PRELUDE
539+ if !flag(use-prelude)
540+ buildable: False
541+ if flag(limit-build-mem)
542+ ghc-options: +RTS -M750M -RTS
543+
544+benchmark Prelude.Merge
545+ import: bench-options
546+ type: exitcode-stdio-1.0
547+ hs-source-dirs: Streamly/Benchmark/Prelude
548+ main-is: Merge.hs
549+ cpp-options: -DUSE_PRELUDE
550+ if !flag(use-prelude)
551+ buildable: False
552+
553+benchmark Prelude.ZipSerial
554+ import: bench-options
555+ type: exitcode-stdio-1.0
556+ hs-source-dirs: Streamly/Benchmark/Prelude
557+ main-is: ZipSerial.hs
558+ cpp-options: -DUSE_PRELUDE
559+ if !flag(use-prelude)
560+ buildable: False
561+
562+benchmark Prelude.ZipAsync
563+ import: bench-options
564+ type: exitcode-stdio-1.0
565+ hs-source-dirs: Streamly/Benchmark/Prelude
566+ main-is: ZipAsync.hs
567+ cpp-options: -DUSE_PRELUDE
568+ if !flag(use-prelude)
569+ buildable: False
570+ if flag(limit-build-mem)
571+ ghc-options: +RTS -M1000M -RTS
572+
573+benchmark Prelude.Ahead
574+ import: bench-options-threaded
575+ type: exitcode-stdio-1.0
576+ hs-source-dirs: Streamly/Benchmark/Prelude
577+ main-is: Ahead.hs
578+ cpp-options: -DUSE_PRELUDE
579+ if !flag(use-prelude)
580+ buildable: False
581+
582+benchmark Prelude.Async
583+ import: bench-options-threaded
584+ type: exitcode-stdio-1.0
585+ hs-source-dirs: Streamly/Benchmark/Prelude
586+ main-is: Async.hs
587+ cpp-options: -DUSE_PRELUDE
588+ if !flag(use-prelude)
589+ buildable: False
590+
591+benchmark Prelude.WAsync
592+ import: bench-options-threaded
593+ type: exitcode-stdio-1.0
594+ hs-source-dirs: Streamly/Benchmark/Prelude
595+ main-is: WAsync.hs
596+ cpp-options: -DUSE_PRELUDE
597+ if !flag(use-prelude)
598+ buildable: False
599+
600+benchmark Prelude.Parallel
601+ import: bench-options-threaded
602+ type: exitcode-stdio-1.0
603+ hs-source-dirs: Streamly/Benchmark/Prelude
604+ main-is: Parallel.hs
605+ cpp-options: -DUSE_PRELUDE
606+ if !flag(use-prelude)
607+ buildable: False
608+ if flag(limit-build-mem)
609+ ghc-options: +RTS -M2000M -RTS
610+
526611-------------------------------------------------------------------------------
527612-- Concurrent Streams
528613-------------------------------------------------------------------------------
@@ -532,30 +617,27 @@ benchmark Prelude.Concurrent
532617 type: exitcode-stdio-1.0
533618 hs-source-dirs: Streamly/Benchmark/Prelude
534619 main-is: Concurrent.hs
535− if flag(use-streamly-core)
620+ cpp-options: -DUSE_PRELUDE
621+ if !flag(use-prelude)
536622 buildable: False
537− else
538− buildable: True
539623
540624benchmark Prelude.Adaptive
541625 import: bench-options-threaded
542626 type: exitcode-stdio-1.0
543627 hs-source-dirs: Streamly/Benchmark/Prelude
544628 main-is: Adaptive.hs
545− if flag(use-streamly-core) || impl(ghcjs)
629+ cpp-options: -DUSE_PRELUDE
630+ if !flag(use-prelude)
546631 buildable: False
547− else
548− buildable: True
549632
550633benchmark Prelude.Rate
551634 import: bench-options-threaded
552635 type: exitcode-stdio-1.0
553636 hs-source-dirs: Streamly/Benchmark/Prelude
554637 main-is: Rate.hs
555− if flag(use-streamly-core) || impl(ghcjs)
638+ cpp-options: -DUSE_PRELUDE
639+ if !flag(use-prelude)
556640 buildable: False
557− else
558− buildable: True
559641
560642-------------------------------------------------------------------------------
561643-- Array Benchmarks
@@ -564,8 +646,10 @@ benchmark Prelude.Rate
564646benchmark Data.Array.Generic
565647 import: bench-options
566648 type: exitcode-stdio-1.0
567− hs-source-dirs: .
649+ hs-source-dirs: ., Streamly/Benchmark/Data
568650 main-is: Streamly/Benchmark/Data/Array/Generic.hs
651+ other-modules:
652+ Stream.Common
569653 if flag(use-streamly-core)
570654 buildable: False
571655 else
@@ -585,7 +669,10 @@ benchmark Data.SmallArray
585669benchmark Data.Array
586670 import: bench-options
587671 type: exitcode-stdio-1.0
672+ hs-source-dirs: ., Streamly/Benchmark/Data
588673 main-is: Streamly/Benchmark/Data/Array.hs
674+ other-modules:
675+ Stream.Common
589676 if flag(use-streamly-core)
590677 buildable: False
591678 else
@@ -593,10 +680,10 @@ benchmark Data.Array
593680 if flag(limit-build-mem)
594681 ghc-options: +RTS -M1500M -RTS
595682
596−benchmark Data.Array.Mut
683+benchmark Data.MutArray
597684 import: bench-options
598685 type: exitcode-stdio-1.0
599− main-is: Streamly/Benchmark/Data/Array/Mut.hs
686+ main-is: Streamly/Benchmark/Data/MutArray.hs
600687 if flag(limit-build-mem)
601688 ghc-options: +RTS -M1500M -RTS
602689 if flag(use-streamly-core)
@@ -683,3 +770,9 @@ benchmark Unicode.Utf8
683770 buildable: False
684771 else
685772 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-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.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: 98201422ea62974400a910331928d71a5fc90801
9−
10−source-repository-package
11− type: git
12− location: https://github.com/composewell/streamly-shell.git
13− tag: b0c6318119d1cc5e2106343f17b5cff2ad94417f
14−
15−source-repository-package
16− type: git
17− location: https://github.com/composewell/streamly-coreutils.git
18− tag: 5dbb8bcefac3aefd5eb298dc410b11e36e79f35a
4+ tag: b11a50c9c0523382a19eebc0b12efdae194406a9
195
206source-repository-package
217 type: git
228 location: https://github.com/composewell/streamly-process.git
23− tag: 9fec548b25a56c5496aaefdf34ddab3bc172bfa0
9+ tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
cabal.project.report+2−4
@@ -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,7 +12,7 @@ package bench-show
1412source-repository-package
1513 type: git
1614 location: https://github.com/composewell/bench-report.git
17− tag: 11713fde39d9973d8210e84de801f250a05a6735
15+ tag: 3b50bf0ad06f746bca42f30c8d40a0426e159af3
1816
1917source-repository-package
2018 type: git
@@ -29,4 +27,4 @@ source-repository-package
2927source-repository-package
3028 type: git
3129 location: https://github.com/composewell/streamly-process.git
32− tag: 9fec548b25a56c5496aaefdf34ddab3bc172bfa0
30+ tag: d80b860d9d8ea98e4f7f63390442b3155c34dd08
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+-}
core/src/Streamly/Console/Stdio.hs+1−27
@@ -24,33 +24,7 @@ module Streamly.Console.Stdio
2424 -- * Write (stderr)
2525 , writeErr
2626 , writeErrChunks
27−
28− -- * Deprecated
29− , read
30− , readChunks
3127 )
3228where
3329
34−import Control.Monad.IO.Class (MonadIO(..))
35−import Data.Word (Word8)
36−import Streamly.Internal.Data.Array.Type (Array)
37−import Streamly.Internal.Data.Unfold (Unfold)
38−
39−import Streamly.Internal.Console.Stdio hiding (read, readChunks)
40−import Prelude hiding (read)
41−
42−-- Same as 'reader'
43−--
44−-- @since 0.8.0
45−{-# DEPRECATED read "Please use 'reader' instead" #-}
46−{-# INLINE read #-}
47−read :: MonadIO m => Unfold m () Word8
48−read = reader
49−
50−-- Same as 'chunkReader'
51−--
52−-- @since 0.8.0
53−{-# DEPRECATED readChunks "Please use 'chunkReader' instead" #-}
54−{-# INLINE readChunks #-}
55−readChunks :: MonadIO m => Unfold m () (Array Word8)
56−readChunks = chunkReader
30+import Streamly.Internal.Console.Stdio
core/src/Streamly/Data/Array.hs+115−111
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
12-- |
23-- Module : Streamly.Data.Array
34-- Copyright : (c) 2019 Composewell Technologies
@@ -7,157 +8,160 @@
78-- Stability : released
89-- Portability : GHC
910--
10−-- This module provides APIs to create and use unboxed immutable arrays. Once
11−-- created, their contents cannot be modified. Only types that are unboxable
12−-- via the 'Unbox' type class can be stored in these arrays.
13−--
14−-- = Folding Arrays
15−--
16−-- Convert array to stream, and fold the stream:
17−--
18−-- >>> fold f arr = Stream.unfold Array.reader arr & Stream.fold f
19−-- >>> fold Fold.sum (Array.fromList [1,2,3::Int])
20−-- 6
21−--
22−-- = Transforming Arrays
23−--
24−-- Convert array to stream, transform, and fold back to array:
25−--
26−-- >>> amap f arr = Stream.unfold Array.reader arr & fmap f & Stream.fold Array.write
27−-- >>> amap (+1) (Array.fromList [1,2,3::Int])
28−-- fromList [2,3,4]
29−--
30−-- = Pinned and Unpinned Arrays
31−--
32−-- The array type can use both pinned and unpinned memory under the hood.
33−-- Currently the array creation APIs create arrays in pinned memory but it will
34−-- change to unpinned in future releases. The change should not affect users
35−-- functionally unless they are directly accessing the internal memory of the
36−-- array via internal APIs. As of now unpinned arrays can be created using
37−-- unreleased APIs.
38−--
39−-- Unpinned arrays have the advantage of allowing automatic defragmentation of
40−-- the memory by GC. Whereas pinned arrays have the advantage of not requiring
41−-- a copy by GC. Normally you would want to use unpinned arrays. However, in
42−-- some cases, for example, for long lived large data storage, and for
43−-- interfacing with the operating system or foreign (non-Haskell) consumers you
44−-- may want to use pinned arrays.
45−--
46−-- = Creating Arrays from Non-IO Streams
47−--
48−-- Array creation folds require 'MonadIO' because they need to sequence effects
49−-- in IO streams. To operate on streams in pure Monads like 'Identity' you can
50−-- morph it to IO monad as follows:
51−--
52−-- The 'MonadIO' based folds can be morphed to 'Identity' stream folds:
53−--
54−-- >>> purely = Fold.morphInner (Identity . unsafePerformIO)
55−-- >>> Stream.fold (purely Array.write) $ Stream.fromList [1,2,3::Int]
56−-- Identity fromList [1,2,3]
57−--
58−-- Alternatively, 'Identity' streams can be generalized to IO streams:
59−--
60−-- >>> pure = Stream.fromList [1,2,3] :: Stream Identity Int
61−-- >>> generally = Stream.morphInner (return . runIdentity)
62−-- >>> Stream.fold Array.write (generally pure :: Stream IO Int)
63−-- fromList [1,2,3]
11+-- Unboxed immutable arrays with streaming interfaces.
6412--
65−-- Since it is a pure stream we can use 'unsafePerformIO' to extract the result
66−-- of fold from IO.
13+-- Please refer to "Streamly.Internal.Data.Array" for functions that have not
14+-- yet been released.
6715--
68−-- = Programming Tips
69−--
70−-- This module is designed to be imported qualified:
71−--
72−-- >>> import qualified Streamly.Data.Array as Array
73−--
74−-- Use @QuantifiedConstraints@ extension to avoid the 'Storable' constraint
75−-- when using the 'Unbox' constraint.
76−--
77−-- For experimental APIs see "Streamly.Internal.Data.Array".
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".
7819
7920module Streamly.Data.Array
8021 (
81− -- * Imports for Examples
22+ -- * Setup
23+ -- | To execute the code examples provided in this module in ghci, please
24+ -- run the following commands first.
25+ --
8226 -- $setup
8327
28+ -- * Overview
29+ -- $overview
30+
8431 -- * The Array Type
85− A.Array
32+ Array
33+
34+ -- * Pinning & Unpinning
35+ -- | Arrays are created unpinned by default unless pinned versions of
36+ -- creation APIs are used. Look for APIs with @pinned@ prefix in
37+ -- "Streamly.Internal.Data.Array" for some unreleased pinned creation APIs.
38+ -- If an array is to be sent to the OS without any further modification
39+ -- then it should be created pinned in the first place instead of pinning
40+ -- it later. Pinning an unpinned array has a copy overhead. OS interfacing
41+ -- APIs create a pinned array directly or convert an unpinned array to
42+ -- pinned array before sending it to the OS.
43+ , pin
44+ , unpin
45+ , isPinned
8646
8747 -- * Construction
8848 -- | When performance matters, the fastest way to generate an array is
89− -- 'writeN'. 'IsList' and 'IsString' instances can be
49+ -- 'createOf'. 'IsList' and 'IsString' instances can be
9050 -- used to conveniently construct arrays from literal values.
9151 -- 'OverloadedLists' extension or 'fromList' can be used to construct an
9252 -- array from a list literal. Similarly, 'OverloadedStrings' extension or
9353 -- 'fromList' can be used to construct an array from a string literal.
9454
95− -- Pure List APIs
96− , A.fromListN
97− , A.fromList
98−
99− -- Monadic APIs
100− , A.writeN -- drop new
101− , A.write -- full buffer
55+ -- ** From Stream
56+ , createOf
57+ , create
10258 , writeLastN -- drop old (ring buffer)
10359
104− -- * Conversion
60+ -- ** From List
61+ , fromListN
62+ , fromList
63+
64+ -- * To List
10565 -- 'GHC.Exts.toList' from "GHC.Exts" can be used to convert an array to a
10666 -- list.
107− , A.toList
67+ , toList
68+
69+ -- * To Stream
70+ , read
71+ , readRev
10872
10973 -- * Unfolds
110− , A.reader
111− , A.readerRev
74+ , reader
75+ , readerRev
11276
11377 -- * Casting
11478 , cast
11579 , asBytes
11680
11781 -- * Random Access
118− , A.length
82+ , length
11983 -- , (!!)
120− , A.getIndex
84+ , getIndex
85+
86+ -- * Serialization
87+ , pinnedSerialize
88+ , deserialize
12189
122− -- * Unbox Type Class
90+ -- * Re-exports
12391 , Unbox (..)
92+ , Serialize(..)
12493
12594 -- * Deprecated
126− , read
127− , readRev
95+ , writeN -- drop new
96+ , write -- full buffer
12897 )
12998where
13099
131100#include "inline.hs"
132101
133−import Streamly.Internal.Data.Unfold (Unfold)
134−import Streamly.Internal.Data.Array as A hiding (read, readRev)
102+import Streamly.Internal.Data.Array
103+import Streamly.Internal.Data.MutByteArray (Unbox(..), Serialize(..))
135104
136−import Streamly.Internal.Data.Unboxed (Unbox (..))
137−import Prelude hiding (read)
105+import Prelude hiding (read, length)
138106
139−-- $setup
140−-- >>> :m
141−-- >>> :set -XFlexibleContexts
142−-- >>> import Data.Function ((&))
143−-- >>> import Data.Functor.Identity (Identity(..))
144−-- >>> import Streamly.Data.Array (Array)
145−-- >>> import Streamly.Data.Stream (Stream)
146−-- >>> import System.IO.Unsafe (unsafePerformIO)
147−-- >>> import qualified Streamly.Data.Array as Array
148−-- >>> import qualified Streamly.Data.Fold as Fold
149−-- >>> import qualified Streamly.Data.Stream as Stream
107+#include "DocTestDataArray.hs"
150108
151−-- | Same as 'reader'
109+-- $overview
152110--
153−{-# DEPRECATED read "Please use 'reader' instead" #-}
154−{-# INLINE_NORMAL read #-}
155−read :: (Monad m, Unbox a) => Unfold m (Array a) a
156−read = reader
157−
158−-- | Same as 'readerRev'
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.
159147--
160−{-# DEPRECATED readRev "Please use 'readerRev' instead" #-}
161−{-# INLINE_NORMAL readRev #-}
162−readRev :: (Monad m, Unbox a) => Unfold m (Array a) a
163−readRev = readerRev
148+-- == Creating Arrays from Non-IO Streams
149+--
150+-- Array creation folds require 'MonadIO' otherwise the compiler may
151+-- incorrectly share the array memory thinking it is pure.
152+--
153+-- See the 'fromPureStream' unreleased API to generate an array from an
154+-- Identity stream safely without using MonadIO constraint.
155+--
156+-- Note that 'Identity' streams can be generalized to IO streams:
157+--
158+-- >>> stream = Stream.fromList [1,2,3] :: Stream Identity Int
159+-- >>> pure2IO s = Stream.morphInner (return . runIdentity) s :: Stream IO Int
160+-- >>> Stream.fold Array.create (pure2IO stream)
161+-- fromList [1,2,3]
162+--
163+-- == Programming Tips
164+--
165+-- This module is designed to be imported qualified:
166+--
167+-- >>> import qualified Streamly.Data.Array as Array
core/src/Streamly/Data/Array/Generic.hs+19−11
@@ -15,29 +15,37 @@ module Streamly.Data.Array.Generic
1515 ( Array
1616
1717 -- * Construction
18− , A.fromListN
19− , A.fromList
18+ , fromListN
19+ , fromList
2020
2121 -- MonadicAPIs
22− , A.writeN
23− , A.write
22+ , createOf
23+ , create
24+
25+ -- * Conversion
26+ , toList
2427
2528 -- * Streams
26− , A.read
27− , A.readRev
29+ , read
30+ , readRev
2831
2932 -- * Unfolds
30− , A.reader
33+ , reader
34+ -- , A.readerRev
3135
3236 -- * Random Access
33− , A.length
37+ , length
38+ , getIndex
3439
3540 -- -- * Folding Arrays
3641 -- , A.streamFold
3742 -- , A.fold
43+
44+ -- * Deprecated
45+ , writeN
46+ , write
3847 )
3948where
4049
41−import Streamly.Internal.Data.Array.Generic (Array)
42−
43−import qualified Streamly.Internal.Data.Array.Generic as A
50+import Streamly.Internal.Data.Array.Generic
51+import Prelude hiding (length, read)
core/src/Streamly/Data/Array/Generic/Mut.hsdeleted−38
@@ -1,38 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Array.Generic.Mut
3−-- Copyright : (c) 2020 Composewell Technologies
4−-- License : BSD3-3-Clause
5−-- Maintainer : streamly@composewell.com
6−-- Stability : experimental
7−-- Portability : GHC
8−--
9−-- Mutable variant of the "Streamly.Data.Array.Generic" module.
10−--
11−module Streamly.Data.Array.Generic.Mut
12−(
13− -- * Type
14− Array
15−
16− -- * Construction
17− , writeN
18−
19− -- * Appending elements
20− , new
21− , snoc
22−
23− -- * Conversion
24− , toList
25−
26− -- * Unfolds
27− , reader
28−
29− -- * Random reads
30− , getIndex
31−
32− -- * Inplace mutation
33− , putIndex
34− , modifyIndex
35− )
36−where
37−
38−import Streamly.Internal.Data.Array.Generic.Mut.Type
core/src/Streamly/Data/Array/Mut.hsdeleted−66
@@ -1,66 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Array.Mut
3−-- Copyright : (c) 2022 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−-- Stability : released
8−-- Portability : GHC
9−--
10−-- This module provides mutable arrays suitable for long lived data storage,
11−-- random access, and mutation.
12−--
13−
14−module Streamly.Data.Array.Mut
15− (
16− -- * Types
17− Array
18−
19− -- * Construction
20−
21− -- Uninitialized Arrays
22− , new
23− , newPinned
24−
25− -- From containers
26− , fromListN
27− , fromList
28− , writeN -- drop new
29− , write -- full buffer
30− -- writeLastN
31−
32− -- * Appending elements
33− , snoc
34−
35− -- * Appending streams
36− , writeAppendN
37− , writeAppend
38−
39− -- * Inplace mutation
40− , putIndex
41−
42− -- * Random access
43− , getIndex
44−
45− -- * Conversion
46− , toList
47−
48− -- * Unfolds
49− , reader
50− , readerRev
51−
52− -- * Casting
53− , cast
54− , asBytes
55−
56− -- * Size
57− , length
58−
59− -- * Unbox Type Class
60− , Unbox (..)
61− )
62−where
63−
64−import Prelude hiding (length, read)
65−import Streamly.Internal.Data.Array.Mut
66−import Streamly.Internal.Data.Unboxed (Unbox (..))
core/src/Streamly/Data/Fold.hs+105−54
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
12-- |
23-- Module : Streamly.Data.Fold
34-- Copyright : (c) 2019 Composewell Technologies
@@ -6,31 +7,45 @@
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 pushes values from a stream to the 'Fold' one at a time,
19−-- 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 'one' 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--
3550-- >>> Stream.fold Fold.one $ Stream.fromList [1..]
3651-- Just 1
@@ -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,6 +83,8 @@
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:
@@ -74,6 +93,8 @@
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,10 +107,7 @@
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.
@@ -125,18 +143,49 @@
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 -- (..)
134182 , Tee (..)
135183
136184 -- * Constructors
137185 , foldl'
138186 , foldlM'
139187 , foldl1'
188+ , foldlM1'
140189 , foldr'
141190
142191 -- * Folds
@@ -170,10 +219,6 @@ module Streamly.Data.Fold
170219 , toListRev
171220 , toSet
172221 , toIntSet
173− , toMap
174− , toMapIO
175− , demuxToMap
176− , demuxToMapIO
177222 , topBy
178223
179224 -- ** Non-Empty Accumulators
@@ -195,14 +240,8 @@ module Streamly.Data.Fold
195240 , uniqBy
196241 , nub
197242 , nubInt
198− , classify
199− , classifyIO
200− , demux
201− , demuxIO
202243
203244 -- ** Terminating Folds
204− -- | These are much like lazy right folds.
205−
206245 , one
207246 , null
208247 -- , satisfy
@@ -211,6 +250,7 @@ module Streamly.Data.Fold
211250 , index
212251 , the
213252 , find
253+ , findM
214254 , lookup
215255 , findIndex
216256 , elemIndex
@@ -221,15 +261,10 @@ module Streamly.Data.Fold
221261 , and
222262 , or
223263
224− -- * Running A Fold
225− , drive
226− -- XXX Should we have a stream returning function in fold module?
227− -- , breakStream
228−
229264 -- * Incremental builders
230− -- | Mutable arrays ("Streamly.Data.Array.Mut") are basic builders. You can
231− -- use the 'Streamly.Data.Array.Mut.snoc' or
232− -- 'Streamly.Data.Array.Mut.writeAppend' operations to incrementally build
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
233268 -- mutable arrays. The 'addOne' and 'addStream' combinators can be used to
234269 -- incrementally build any type of structure using a fold, including arrays
235270 -- or a stream of arrays.
@@ -297,8 +332,11 @@ module Streamly.Data.Fold
297332 , takeEndBy
298333 , takeEndBy_
299334
300− -- ** Serial Append
335+ -- ** Splitting
301336 , splitWith
337+ , many
338+ , groupsOf
339+ -- , intervalsOf
302340
303341 -- ** Parallel Distribution
304342 -- | For applicative composition using distribution see
@@ -320,14 +358,21 @@ module Streamly.Data.Fold
320358 --, partitionByMinM
321359 --, partitionBy
322360
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+
323373 -- ** Unzipping
324374 , unzip
325375
326− -- ** Splitting
327− , many
328− , chunksOf
329− -- , intervalsOf
330−
331376 -- ** Nesting
332377 , concatMap
333378
@@ -335,6 +380,7 @@ module Streamly.Data.Fold
335380 , morphInner
336381
337382 -- * Deprecated
383+ , chunksOf
338384 , foldr
339385 , drainBy
340386 , last
@@ -348,17 +394,22 @@ module Streamly.Data.Fold
348394where
349395
350396import Prelude
351− hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
352− foldl, map, mapM_, sequence, all, any, sum, product, elem,
353− notElem, maximum, minimum, head, last, tail, length, null,
354− reverse, iterate, init, and, or, lookup, foldr1, (!!),
355− scanl, scanl1, replicate, concatMap, mconcat, foldMap, unzip,
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,
356402 span, splitAt, break, mapM, maybe)
357403
358404import Streamly.Internal.Data.Fold
359−import Streamly.Internal.Data.Fold.Container
360405
361−-- $setup
362−-- >>> import Data.Function ((&))
363−-- >>> import qualified Streamly.Data.Fold as Fold
364−-- >>> 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/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+147−12
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
12-- |
23-- Module : Streamly.Data.Parser
34-- Copyright : (c) 2020 Composewell Technologies
@@ -6,19 +7,146 @@
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). This may 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.
1516--
16−-- mtl instances are not provided. If the 'Parser' type is the top most layer
17−-- (which should be the case almost always) you can just use 'fromEffect' to
18−-- execute the lower layer monad effects.
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.
19141--
20142module Streamly.Data.Parser
21143 (
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+
22150 -- * Parser Type
23151 Parser
24152
@@ -90,12 +218,17 @@ module Streamly.Data.Parser
90218
91219 -- ** Grouping
92220 , groupBy
93− -- , groupByRolling
94− -- , groupByRollingEither
221+ , groupByRolling
222+ , groupByRollingEither
95223
96224 -- ** Framing
97− , wordFramedBy
98− , wordQuotedBy
225+ -- , wordFramedBy
226+ , wordWithQuotes
227+ -- , wordProcessQuotes
228+ -- , wordKeepQuotes
229+
230+ -- -- * Alternative
231+ -- , alt
99232
100233 -- ** Splitting
101234 , many
@@ -110,3 +243,5 @@ where
110243
111244import Streamly.Internal.Data.Parser
112245import 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+373−132
@@ -1,3 +1,4 @@
1+{-# LANGUAGE CPP #-}
12-- |
23-- Module : Streamly.Data.Stream
34-- Copyright : (c) 2017 Composewell Technologies
@@ -7,108 +8,59 @@
78-- Stability : released
89-- Portability : GHC
910--
10−-- To run examples in this module:
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.
1115--
12−-- >>> import qualified Streamly.Data.Fold as Fold
13−-- >>> import qualified Streamly.Data.Stream as Stream
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'.
1421--
15−-- We will add some more imports in the examples as needed.
22+-- Please refer to "Streamly.Internal.Data.Stream" for more functions that have
23+-- not yet been released.
1624--
17−-- For effectful streams we will use the following IO action:
18−--
19−-- >>> effect n = print n >> return n
20−--
21−-- = Overview
22−--
23−-- Streamly is a framework for modular data flow based programming and
24−-- declarative concurrency. Powerful stream fusion framework in streamly
25−-- allows high performance combinatorial programming even when using byte level
26−-- streams. Streamly API is similar to Haskell lists.
27−--
28−-- Streams can be constructed like lists, except that they use 'nil' instead of
29−-- '[]' and 'cons' instead of ':'.
30−--
31−-- `cons` adds a pure value at the head of the stream:
32−--
33−-- >>> import Streamly.Data.Stream (Stream, cons, consM, nil)
34−-- >>> stream = 1 `cons` 2 `cons` nil :: Stream IO Int
35−-- >>> Stream.fold Fold.toList stream -- IO [Int]
36−-- [1,2]
37−--
38−-- `consM` adds an effect at the head of the stream:
39−--
40−-- >>> stream = effect 1 `consM` effect 2 `consM` nil
41−-- >>> Stream.fold Fold.toList stream
42−-- 1
43−-- 2
44−-- [1,2]
45−--
46−-- == Console Echo Example
47−--
48−-- In the following example, 'repeatM' generates an infinite stream of 'String'
49−-- by repeatedly performing the 'getLine' IO action. 'mapM' then applies
50−-- 'putStrLn' on each element in the stream converting it to stream of '()'.
51−-- Finally, 'drain' folds the stream to IO discarding the () values, thus
52−-- producing only effects.
53−--
54−-- >>> import Data.Function ((&))
55−--
56−-- >>> :{
57−-- echo =
58−-- Stream.repeatM getLine -- Stream IO String
59−-- & Stream.mapM putStrLn -- Stream IO ()
60−-- & Stream.fold Fold.drain -- IO ()
61−-- :}
62−--
63−-- This is a console echo program. It is an example of a declarative loop
64−-- written using streaming combinators. Compare it with an imperative @while@
65−-- loop.
66−--
67−-- Hopefully, this gives you an idea how we can program declaratively by
68−-- representing loops using streams. In this module, you can find all
69−-- "Data.List" like functions and many more powerful combinators to perform
70−-- common programming tasks.
71−--
72−-- == Useful Idioms
73−--
74−-- >>> fromListM = Stream.sequence . Stream.fromList
75−-- >>> fromFoldableM = Stream.sequence . Stream.fromFoldable
76−-- >>> fromIndices f = fmap f $ Stream.enumerateFrom 0
77−--
78−-- Also see "Streamly.Internal.Data.Stream" module for many more @Pre-release@
79−-- combinators. See the <https://github.com/composewell/streamly-examples>
25+-- Checkout the <https://github.com/composewell/streamly-examples>
8026-- repository for many more real world examples of stream programming.
81−--
82−-- == Performance Notes
83−--
84−-- Operations annotated as /CPS/ force the use of continuation passing style
85−-- streams. Therefore, such operations are not subjected to stream fusion.
86−-- However, for some of these operations you can find fusible alternatives in
87−-- the internal modules, which are perfectly fine to use but you need to
88−-- understand the implications especially the O(n^2) nature of those
89−-- operations..
90−--
27+
9128module Streamly.Data.Stream
9229 (
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
9340 Stream
41+
9442 -- * Construction
9543 -- | Functions ending in the general shape @b -> Stream m a@.
9644 --
97− -- See also: "Streamly.Internal.Data.Stream.Generate" for
98− -- @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
9952
10053 -- ** Primitives
101− -- | Primitives to construct a stream from pure values or monadic actions.
102− -- All other stream construction and generation combinators described later
103− -- can be expressed in terms of these primitives. However, the special
104− -- versions provided in this module can be much more efficient in most
105− -- 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.
10660 , nil
10761 , nilM
10862 , cons
10963 , consM
110− -- , cons2 -- fused version
111− -- , consM2 -- fused version
11264
11365 -- ** Unfolding
11466 -- | 'unfoldrM' is the most general way of generating a stream efficiently.
@@ -118,6 +70,15 @@ module Streamly.Data.Stream
11870
11971 -- ** From Values
12072 -- | 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+ --
12182 , fromPure
12283 , fromEffect
12384 , repeat
@@ -152,7 +113,6 @@ module Streamly.Data.Stream
152113 -- | Convert an input structure, container or source into a stream. All of
153114 -- these can be expressed in terms of primitives.
154115 , fromList
155− , fromFoldable
156116
157117 -- ** From Unfolds
158118 -- | Most of the above stream generation operations can also be expressed
@@ -163,8 +123,6 @@ module Streamly.Data.Stream
163123 -- | Functions ending in the general shape @Stream m a -> m b@ or @Stream m
164124 -- a -> m (b, Stream m a)@
165125 --
166− -- See also: "Streamly.Internal.Data.Stream.Eliminate" for @Pre-release@
167− -- functions.
168126
169127-- EXPLANATION: In imperative terms a fold can be considered as a loop over the stream
170128-- that reduces the stream to a single value.
@@ -238,7 +196,7 @@ module Streamly.Data.Stream
238196 -- ending in the general shape @Stream m a -> m (b, Stream m a)@
239197 , uncons
240198
241− -- ** Folding
199+ -- ** Strict Left Folds
242200 -- XXX Need to have a general parse operation here which can be used to
243201 -- express all others.
244202 , fold -- XXX rename to run? We can have a Stream.run and Fold.run.
@@ -252,17 +210,69 @@ module Streamly.Data.Stream
252210
253211 -- ** Parsing
254212 , parse
255− , parseBreak
213+ -- , parseBreak
256214
257− -- -- ** Lazy Right Folds
258− -- 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
259217 -- for lazy evaluation. Evaluation of the input happens when the output of
260218 -- the fold is evaluated, the fold output is a lazy thunk.
261219 --
262220 -- This is suitable for stream transformation operations, for example,
263221 -- operations like mapping a function over the stream.
264− -- , foldrM
265− -- , 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
266276
267277 -- * Mapping
268278 -- | Stateless one-to-one transformations. Use 'fmap' for mapping a pure
@@ -282,24 +292,58 @@ module Streamly.Data.Stream
282292 -- the stream, it can merely transform them.
283293 , sequence
284294 , mapM
285− -- , trace -- XXX Use "tracing" map instead?
295+ , trace
286296 , tap
287297 , delay
288298
289299 -- * Scanning
290300 -- | Stateful one-to-one transformations.
291301 --
292− -- See also: "Streamly.Internal.Data.Stream.Transform" for
293− -- @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)
294325 , scan
295326 , postscan
296327 -- 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
297339 -- Indexing can be considered as a special type of zipping where we zip a
298340 -- stream with an index stream.
299341 , indexed
300342
301343 -- * Insertion
302344 -- | Add elements to the stream.
345+ --
346+ -- >>> insert = Stream.insertBy compare
303347
304348 -- Inserting elements is a special case of interleaving/merging streams.
305349 , insertBy
@@ -334,6 +378,16 @@ module Streamly.Data.Stream
334378 -- filtering folds (folds returning a 'Maybe' type) in
335379 -- "Streamly.Internal.Data.Fold" can be used along with 'scanMaybe' to
336380 -- 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)
337391 , scanMaybe
338392 , take
339393 , takeWhile
@@ -341,6 +395,8 @@ module Streamly.Data.Stream
341395 , drop
342396 , dropWhile
343397 , dropWhileM
398+ -- XXX write to an array in reverse and then read in reverse
399+ -- > dropWhileEnd = reverse . dropWhile p . reverse
344400
345401 -- XXX These are available as scans in folds. We need to check the
346402 -- performance though. If these are common and we need convenient stream
@@ -362,32 +418,43 @@ module Streamly.Data.Stream
362418 -- , elemIndices
363419
364420 -- * 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+
365435 -- ** Appending
436+ -- | Equivalent of Data.List append:
437+ --
438+ -- >>> (++) = Stream.append
366439 , append
367440
368441 -- ** Interleaving
369442 , interleave
370− -- , interleave2
371443
372444 -- ** Merging
373− -- | Merging of @n@ streams can be performed by combining the streams pair
374− -- wise using 'mergeMapWith' to give O(n * log n) time complexity. If used
375− -- with 'concatMapWith' it will have O(n^2) performance.
376−
377445 , mergeBy
378446 , mergeByM
379− -- , mergeBy2
380− -- , mergeByM2
381447
382448 -- ** Zipping
383− -- | Zipping of @n@ streams can be performed by combining the streams pair
384− -- wise using 'mergeMapWith' with O(n * log n) time complexity. If used
385− -- 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)
386453 , zipWith
387454 , zipWithM
388− -- , zipWith2
389− -- , zipWithM2
390− , ZipStream (..)
455+ -- XXX zipWith3,4,5,6,7
456+ -- XXX unzip3,4,5,6,7
457+ -- , ZipStream (..)
391458
392459 -- ** Cross Product
393460 -- XXX The argument order in this operation is such that it seems we are
@@ -399,7 +466,7 @@ module Streamly.Data.Stream
399466 , crossWith
400467 -- , cross
401468 -- , joinInner
402− , CrossStream (..)
469+ -- , CrossStream (..)
403470
404471 -- * Unfold Each
405472 , unfoldMany
@@ -419,54 +486,109 @@ module Streamly.Data.Stream
419486 -- One dimension loops are just a special case of nested loops. For
420487 -- example, 'concatMap' can degenerate to a simple map operation:
421488 --
422− -- > map f m = S.concatMap (\x -> S.fromPure (f x)) m
489+ -- >>> map f m = Stream.concatMap (\x -> Stream.fromPure (f x)) m
423490 --
424491 -- Similarly, 'concatMap' can perform filtering by mapping an element to a
425492 -- 'nil' stream:
426493 --
427− -- > 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:
428497 --
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 " "
429503
430504 , concatEffect
431− , concatMapWith
432505 , concatMap
433506 , concatMapM
434− , mergeMapWith
435507
436508 -- * 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 (==)
437516 , foldMany -- XXX Rename to foldRepeat
517+ , groupsOf
438518 , parseMany
439− , arraysOf
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
440532
441533 -- * Buffered Operations
442534 -- | Operations that require buffering of the stream.
443535 -- 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+ --
444550 , reverse
445− , sortBy
551+ -- XXX transpose: write the streams to arrays and then stream transposed.
552+ -- XXX subsequences
553+ -- XXX permutations
554+ -- , nub
555+ -- , ordNub
556+ -- , nubBy
446557
447558 -- * Multi-Stream folds
448559 -- | Operations that consume multiple streams at the same time.
449560 , eqBy
450561 , cmpBy
451562 , isPrefixOf
563+ , isInfixOf
564+ -- , isSuffixOf
565+ -- , isSuffixOfUnbox
452566 , isSubsequenceOf
453567
454568 -- trimming sequences
455− , stripPrefix
569+ -- , stripPrefix
570+ -- , stripSuffix
571+ -- , stripSuffixUnbox
456572
457573 -- Exceptions and resource management depend on the "exceptions" package
458574 -- XXX We can have IO Stream operations not depending on "exceptions"
459575 -- in Exception.Base
460576
461577 -- * Exceptions
462− -- | 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
463588 -- possible, they should be called in an outer loop to mitigate the cost.
464589 -- For example, instead of calling them on a stream of chars call them on a
465590 -- stream of arrays before flattening it to a stream of chars.
466591 --
467− -- See also: "Streamly.Internal.Data.Stream.Exception" for
468− -- @Pre-release@ functions.
469−
470592 , onException
471593 , handle
472594
@@ -474,8 +596,19 @@ module Streamly.Data.Stream
474596 -- | 'bracket' is the most general resource management operation, all other
475597 -- operations can be expressed using it. These functions have IO suffix
476598 -- because the allocation and cleanup functions are IO actions. For
477− -- generalized allocation and cleanup functions see the functions without
599+ -- generalized allocation and cleanup functions, see the functions without
478600 -- 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.
479612 , before
480613 , afterIO
481614 , finallyIO
@@ -489,17 +622,125 @@ module Streamly.Data.Stream
489622 , runReaderT
490623 , runStateT
491624
492− -- -- * Stream Types
493− -- $serial
494− -- , Interleave
495− -- , 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
496629 )
497630where
498631
499632import Streamly.Internal.Data.Stream
500633import Prelude
501634 hiding (filter, drop, dropWhile, take, takeWhile, zipWith, foldr,
502− foldl, map, mapM, mapM_, sequence, all, any, sum, product, elem,
503− notElem, maximum, minimum, head, last, tail, length, null,
504− reverse, iterate, init, and, or, lookup, foldr1, (!!),
505− 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/Stream/Zip.hsdeleted−16
@@ -1,16 +0,0 @@
1−-- |
2−-- Module : Streamly.Data.Stream.Zip
3−-- Copyright : (c) 2017 Composewell Technologies
4−--
5−-- License : BSD3
6−-- Maintainer : streamly@composewell.com
7−-- Stability : released
8−-- Portability : GHC
9−--
10−module Streamly.Data.Stream.Zip
11− (
12− ZipStream (..)
13− )
14−where
15−
16−import Streamly.Internal.Data.Stream.Zip
core/src/Streamly/Data/StreamK.hsnew file+194
@@ -0,0 +1,194 @@
1+{-# LANGUAGE CPP #-}
2+-- |
3+-- Module : Streamly.Data.StreamK
4+-- Copyright : (c) 2017 Composewell Technologies
5+--
6+-- License : BSD3
7+-- Maintainer : streamly@composewell.com
8+-- Stability : released
9+-- Portability : GHC
10+--
11+-- Streams represented as chains of functions calls using Continuation Passing
12+-- Style (CPS), suitable for dynamically composing potentially large number of
13+-- streams.
14+--
15+-- Unlike the statically fused operations in "Streamly.Data.Stream", StreamK
16+-- operations are less efficient, involving a function call overhead for each
17+-- element, but they exhibit linear O(n) time complexity wrt to the number of
18+-- stream compositions. Therefore, they are suitable for dynamically composing
19+-- streams e.g. appending potentially infinite streams in recursive loops.
20+-- While fused streams can be used to efficiently process elements as small as
21+-- a single byte, CPS streams are typically used on bigger chunks of data to
22+-- avoid the larger overhead per element. For more details See the @Stream vs
23+-- StreamK@ section in the "Streamly.Data.Stream" module.
24+--
25+-- In addition to the combinators in this module, you can use operations from
26+-- "Streamly.Data.Stream" for StreamK as well by converting StreamK to Stream
27+-- ('toStream'), and vice-versa ('fromStream'). Please refer to
28+-- "Streamly.Internal.Data.StreamK" for more functions that have not yet been
29+-- released.
30+--
31+-- For documentation see the corresponding combinators in
32+-- "Streamly.Data.Stream". Documentation has been omitted in this module unless
33+-- there is a difference worth mentioning or if the combinator does not exist
34+-- in "Streamly.Data.Stream".
35+
36+-- Notes:
37+--
38+-- primitive/open loop operations that can be used recursively e.g. uncons,
39+-- foldBreak, parseBreak should not be converted from StreamD for use in
40+-- StreamK, instead native StreamK impl should be used.
41+--
42+-- Closed loop operations like repeat, replicate, iterate etc can be converted
43+-- from StreamD.
44+--
45+-- In the last phase any operation like (toStreamK . f . toStreamD) should be
46+-- rewritten to a K version of f.
47+-- XXX Need to add rewrite rules for all missing StreamD operations.
48+--
49+module Streamly.Data.StreamK
50+ (
51+ -- * Setup
52+ -- | To execute the code examples provided in this module in ghci, please
53+ -- run the following commands first.
54+ --
55+ -- $setup
56+
57+ -- * Overview
58+ -- $overview
59+
60+ -- * Type
61+ StreamK
62+
63+ -- * Construction
64+ -- ** Primitives
65+ -- | Primitives to construct a stream from pure values or monadic actions.
66+ -- All other stream construction and generation combinators described later
67+ -- can be expressed in terms of these primitives. However, the special
68+ -- versions provided in this module can be much more efficient in some
69+ -- cases. Users can create custom combinators using these primitives.
70+ , nil
71+ , nilM
72+ , cons
73+ , consM
74+
75+ -- ** From Values
76+ , fromPure
77+ , fromEffect
78+
79+ -- ** From Stream
80+ -- | Please note that 'Stream' type does not observe any exceptions from
81+ -- the consumer of the stream whereas 'StreamK' does.
82+ , fromStream
83+ , toStream
84+
85+ -- ** From Containers
86+ , fromFoldable
87+
88+ -- * Elimination
89+
90+ -- ** Primitives
91+ , uncons
92+ , drain
93+
94+ -- -- ** Folding
95+ -- , foldBreak
96+
97+ -- ** Parsing
98+ , parse
99+ , parseBreak
100+ , parseBreakChunks
101+ , parseChunks
102+
103+ -- * Transformation
104+ , mapM
105+ , dropWhile
106+ , take
107+
108+ -- * Combining Two Streams
109+ -- | Unlike the operations in "Streamly.Data.Stream", these operations can
110+ -- be used to dynamically compose large number of streams e.g. using the
111+ -- 'concatMapWith' and 'mergeMapWith' operations. They have a linear O(n)
112+ -- time complexity wrt to the number of streams being composed.
113+
114+ -- ** Appending
115+ , append
116+
117+ -- ** Interleaving
118+ , interleave
119+
120+ -- ** Merging
121+ , mergeBy
122+ , mergeByM
123+
124+ -- ** Zipping
125+ , zipWith
126+ , zipWithM
127+
128+ -- ** Cross Product
129+ -- XXX is "bind/concatFor" better to have than crossWith?
130+ -- crossWith f xs1 xs2 = concatFor xs1 (\x -> fmap (f x) xs2)
131+ , crossWith
132+ -- , cross
133+ -- , joinInner
134+ -- , CrossStreamK (..)
135+
136+ -- * Stream of streams
137+ -- | Some useful idioms:
138+ --
139+ -- >>> concatFoldableWith f = Prelude.foldr f StreamK.nil
140+ -- >>> concatMapFoldableWith f g = Prelude.foldr (f . g) StreamK.nil
141+ -- >>> concatForFoldableWith f xs g = Prelude.foldr (f . g) StreamK.nil xs
142+ --
143+ , concatEffect
144+ -- , concatMap
145+ , concatMapWith
146+ , mergeMapWith
147+
148+ -- * Buffered Operations
149+ , reverse
150+ , sortBy
151+
152+ -- * Exceptions
153+ -- | Please note that 'Stream' type does not observe any exceptions from
154+ -- the consumer of the stream whereas 'StreamK' does.
155+ , handle
156+
157+ -- * Resource Management
158+ -- | Please note that 'Stream' type does not observe any exceptions from
159+ -- the consumer of the stream whereas 'StreamK' does.
160+ , bracketIO
161+ )
162+where
163+
164+import Streamly.Internal.Data.StreamK
165+import Prelude hiding (reverse, zipWith, mapM, dropWhile, take)
166+
167+#include "DocTestDataStreamK.hs"
168+
169+-- $overview
170+--
171+-- Continuation passing style (CPS) stream implementation. The 'K' in 'StreamK'
172+-- stands for Kontinuation.
173+--
174+-- StreamK can be constructed like lists, except that they use 'nil' instead of
175+-- '[]' and 'cons' instead of ':'.
176+--
177+-- `cons` adds a pure value at the head of the stream:
178+--
179+-- >>> import Streamly.Data.StreamK (StreamK, cons, consM, nil)
180+-- >>> stream = 1 `cons` 2 `cons` nil :: StreamK IO Int
181+--
182+-- You can use operations from "Streamly.Data.Stream" for StreamK as well by
183+-- converting StreamK to Stream ('toStream'), and vice-versa ('fromStream').
184+--
185+-- >>> Stream.fold Fold.toList $ StreamK.toStream stream -- IO [Int]
186+-- [1,2]
187+--
188+-- `consM` adds an effect at the head of the stream:
189+--
190+-- >>> stream = effect 1 `consM` effect 2 `consM` nil
191+-- >>> Stream.fold Fold.toList $ StreamK.toStream stream
192+-- 1
193+-- 2
194+-- [1,2]
core/src/Streamly/Data/Unfold.hs+98−85
@@ -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,81 +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− -- Exception combinators are not exposed, we would like to encourage the
210− -- use of Stream type instead where exception handling is required. We can
211− -- consider exposing the unfold exception functions if there is a
212− -- compelling use case to use unfolds instead of stream.
213− )
214−where
215−
216−import Prelude hiding
217− ( concat, map, mapM, takeWhile, take, filter, const, drop, dropWhile
218− , zipWith
219− )
220−import Streamly.Internal.Data.Unfold
core/src/Streamly/FileSystem/Handle.hs+15−29
@@ -1,4 +1,4 @@
1−#include "inline.hs"
1+{-# LANGUAGE CPP #-}
22
33-- |
44-- Module : Streamly.FileSystem.Handle
@@ -40,6 +40,12 @@
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,13 +81,13 @@ module Streamly.FileSystem.Handle
7581 -- position of the file handle. The stream ends as soon as EOF is
7682 -- encountered.
7783
78− -- -- *** Streams
79− -- , read
80− -- , readWith
81− -- , readChunks
82− -- , readChunksWith
84+ -- *** Streams
85+ , read
86+ , readWith
87+ , readChunks
88+ , readChunksWith
8389
84− -- -- *** Unfolds
90+ -- *** Unfolds
8591 , reader
8692 , readerWith
8793 , chunkReader
@@ -98,34 +104,14 @@ module Streamly.FileSystem.Handle
98104 , writeChunks
99105
100106 -- * Deprecated
101− , read
102107 , readWithBufferOf
103− , readChunks
104108 , readChunksWithBufferOf
105109 , writeChunksWithBufferOf
106110 , writeWithBufferOf
107111 )
108112where
109113
110−import Control.Monad.IO.Class (MonadIO(..))
111−import Data.Word (Word8)
112−import Streamly.Internal.Data.Array.Type (Array)
113−import Streamly.Internal.Data.Unfold.Type (Unfold)
114−import System.IO (Handle)
115−
116−import Streamly.Internal.FileSystem.Handle hiding (read, readChunks)
114+import Streamly.Internal.FileSystem.Handle
117115import Prelude hiding (read)
118116
119−-- | Same as 'reader'
120−--
121−{-# DEPRECATED read "Please use 'reader' instead" #-}
122−{-# INLINE read #-}
123−read :: MonadIO m => Unfold m Handle Word8
124−read = reader
125−
126−-- | Same as 'chunkReader'
127−--
128−{-# DEPRECATED readChunks "Please use 'chunkReader' instead" #-}
129−{-# INLINE readChunks #-}
130−readChunks :: MonadIO m => Unfold m Handle (Array Word8)
131−readChunks = chunkReader
117+#include "DocTestFileSystemHandle.hs"
core/src/Streamly/Internal/Console/Stdio.hs+2−1
@@ -52,7 +52,8 @@ import Streamly.Internal.Data.Unfold (Unfold)
5252import Streamly.Internal.Data.Fold (Fold)
5353
5454import qualified Streamly.Internal.Data.Array as Array
55−import qualified Streamly.Internal.Data.Stream as Stream (intersperseMSuffix)
55+import qualified Streamly.Internal.Data.Stream as Stream
56+ (intersperseMSuffix)
5657import qualified Streamly.Internal.Data.Unfold as Unfold
5758import qualified Streamly.Internal.FileSystem.Handle as Handle
5859import qualified Streamly.Internal.Unicode.Stream as Unicode
core/src/Streamly/Internal/Data/Array.hs+645−190
@@ -1,88 +1,48 @@
1+{-# LANGUAGE CPP #-}
12-- |
23-- Module : Streamly.Internal.Data.Array
34-- Copyright : (c) 2019 Composewell Technologies
4−--
55-- License : BSD3
66-- Maintainer : streamly@composewell.com
77-- Stability : experimental
88-- Portability : GHC
99--
10−-- To summarize:
11−--
12−-- * Arrays are finite and fixed in size
13−-- * provide /O(1)/ access to elements
14−-- * store only data and not functions
15−-- * provide efficient IO interfacing
16−--
17−-- 'Foldable' instance is not provided because the implementation would be much
18−-- less efficient compared to folding via streams. 'Semigroup' and 'Monoid'
19−-- instances should be used with care; concatenating arrays using binary
20−-- operations can be highly inefficient. Instead, use
21−-- 'Streamly.Internal.Data.Stream.Chunked.toArray' to concatenate N
22−-- arrays at once.
23−--
24−-- Each array is one pointer visible to the GC. Too many small arrays (e.g.
25−-- single byte) are only as good as holding those elements in a Haskell list.
26−-- However, small arrays can be compacted into large ones to reduce the
27−-- overhead. To hold 32GB memory in 32k sized buffers we need 1 million arrays
28−-- if we use one array for each chunk. This is still significant to add
29−-- pressure to GC.
30−
3110module Streamly.Internal.Data.Array
3211 (
33− Array
12+ -- * Setup
13+ -- $setup
3414
35− -- * Construction
15+ -- * Design Notes
16+ -- $design
3617
37− -- Pure List APIs
38− , A.fromListN
39− , A.fromList
40−
41− -- Stream Folds
42− , fromStreamN
43− , fromStream
18+ -- * The Array Type
19+ module Streamly.Internal.Data.Array.Type
4420
21+ -- * Construction
4522 -- Monadic Folds
46− , A.writeN -- drop new
47− , A.writeNAligned
48− , A.write -- full buffer
4923 , writeLastN
5024
51− -- * Elimination
52− -- ** Conversion
53− , A.toList
54−
55− -- ** Streams
56− , A.read
57− , A.readRev
58−
59− -- ** Unfolds
60− , reader
61− , readerUnsafe
62− , A.readerRev
63− , producer -- experimental
64−
6525 -- * Random Access
6626 -- , (!!)
6727 , getIndex
68− , A.unsafeIndex -- XXX Rename to getIndexUnsafe??
6928 , getIndexRev
70− , last -- XXX getIndexLast?
71− , getIndices
72− , getIndicesFromThenTo
29+ , last -- XXX getLastIndex?
7330 -- , getIndicesFrom -- read from a given position to the end of file
7431 -- , getIndicesUpto -- read from beginning up to the given position
7532 -- , getIndicesFromTo
7633 -- , getIndicesFromRev -- read from a given position to the beginning of file
7734 -- , getIndicesUptoRev -- read from end to the given position in file
35+ , indexReader
36+ , indexReaderFromThenTo
7837
7938 -- * Size
80− , length
8139 , null
8240
8341 -- * Search
8442 , binarySearch
8543 , findIndicesOf
44+ -- getIndicesOf
45+ , indexFinder -- see splitOn
8646 -- , findIndexOf
8747 -- , find
8848
@@ -90,157 +50,134 @@ module Streamly.Internal.Data.Array
9050 , cast
9151 , asBytes
9252 , castUnsafe
93− , asPtrUnsafe
9453 , asCStringUnsafe
95− , A.unsafeFreeze -- asImmutableUnsafe?
96− , A.unsafeThaw -- asMutableUnsafe?
9754
9855 -- * Subarrays
9956 , getSliceUnsafe
10057 -- , getSlice
101− , genSlicesFromLen
102− , getSlicesFromLen
58+ , sliceIndexerFromLen
59+ , slicerFromLen
10360 , splitOn
10461
10562 -- * Streaming Operations
10663 , streamTransform
10764
108− -- ** Folding
65+ -- * Folding
10966 , streamFold
11067 , fold
11168
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+
11293 -- * Deprecated
113− , A.toStream
114− , A.toStreamRev
94+ , genSlicesFromLen
95+ , getSlicesFromLen
96+ , getIndices
11597 )
11698where
11799
100+#include "assert.hs"
118101#include "inline.hs"
119102#include "ArrayMacros.h"
120103
121−import Control.Exception (assert)
122−import Control.Monad (when)
123104import Control.Monad.IO.Class (MonadIO(..))
105+-- import Data.Bifunctor (first)
106+-- import Data.Either (fromRight)
124107import Data.Functor.Identity (Identity)
125108import Data.Proxy (Proxy(..))
126109import Data.Word (Word8)
127110import Foreign.C.String (CString)
128111import Foreign.Ptr (castPtr)
129112import Foreign.Storable (Storable)
130−import Streamly.Internal.Data.Unboxed
131− ( Unbox
132− , peekWith
133− , sizeOf
134− )
113+import GHC.Types (SPEC(..))
114+import Streamly.Internal.Data.Unbox (Unbox(..))
135115import Prelude hiding (length, null, last, map, (!!), read, concat)
136116
137−import Streamly.Internal.Data.Array.Mut.Type (ArrayUnsafe(..))
138−import Streamly.Internal.Data.Array.Type
139− (Array(..), length, asPtrUnsafe)
117+import Streamly.Internal.Data.MutByteArray.Type (PinnedState(..), MutByteArray)
118+import Streamly.Internal.Data.Serialize.Type (Serialize)
140119import Streamly.Internal.Data.Fold.Type (Fold(..))
141−import Streamly.Internal.Data.Producer.Type (Producer(..))
142−import Streamly.Internal.Data.Stream (Stream)
143−import Streamly.Internal.Data.Tuple.Strict (Tuple3Fused'(..))
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'(..))
144125import Streamly.Internal.Data.Unfold.Type (Unfold(..))
145126import Streamly.Internal.System.IO (unsafeInlineIO)
146127
147−import qualified Streamly.Internal.Data.Array.Mut.Type as MA
148−import qualified Streamly.Internal.Data.Array.Mut as MA
149−import qualified Streamly.Internal.Data.Array.Type as A
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
150132import qualified Streamly.Internal.Data.Fold as FL
151−import qualified Streamly.Internal.Data.Producer.Type as Producer
152−import qualified Streamly.Internal.Data.Producer as Producer
153−import qualified Streamly.Internal.Data.Ring.Unboxed as RB
154−import qualified Streamly.Internal.Data.Stream.Common as P
155−import qualified Streamly.Internal.Data.Stream.StreamD as D
156−import qualified Streamly.Internal.Data.Stream.Type as Stream
133+import qualified Streamly.Internal.Data.Ring as RB
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
157139import qualified Streamly.Internal.Data.Unfold as Unfold
140+import qualified Prelude
158141
159−-------------------------------------------------------------------------------
160−-- Construction
161−-------------------------------------------------------------------------------
142+import Streamly.Internal.Data.Array.Type
162143
163−-- | Create an 'Array' from the first N elements of a stream. The array is
164−-- allocated to size N, if the stream terminates before N elements then the
165−-- array may hold less than N elements.
166−--
167−-- /Pre-release/
168−{-# INLINE fromStreamN #-}
169−fromStreamN :: (MonadIO m, Unbox a) => Int -> Stream m a -> m (Array a)
170−fromStreamN n m = do
171− when (n < 0) $ error "writeN: negative write count specified"
172− A.fromStreamDN n $ Stream.toStreamD m
144+#include "DocTestDataArray.hs"
173145
174−-- | Create an 'Array' from a stream. This is useful when we want to create a
175−-- single array from a stream of unknown size. 'writeN' is at least twice
176−-- as efficient when the size is already known.
146+-- $design
177147--
178−-- Note that if the input stream is too large memory allocation for the array
179−-- may fail. When the stream size is not known, `arraysOf` followed by
180−-- processing of indvidual arrays in the resulting stream should be preferred.
148+-- To summarize:
181149--
182−-- /Pre-release/
183−{-# INLINE fromStream #-}
184−fromStream :: (MonadIO m, Unbox a) => Stream m a -> m (Array a)
185−fromStream m = P.fold A.write $ Stream.toStreamK m
186−-- write m = A.fromStreamD $ D.fromStreamK m
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.
187168
188169-------------------------------------------------------------------------------
189170-- Elimination
190171-------------------------------------------------------------------------------
191172
192−{-# INLINE_NORMAL producer #-}
193−producer :: forall m a. (Monad m, Unbox a) => Producer m (Array a) a
194−producer =
195− Producer.translate A.unsafeThaw A.unsafeFreeze
196− $ MA.producerWith (return . unsafeInlineIO)
197−
198−-- | Unfold an array into a stream.
199−--
200−{-# INLINE_NORMAL reader #-}
201−reader :: forall m a. (Monad m, Unbox a) => Unfold m (Array a) a
202−reader = Producer.simplify producer
203−
204−-- | Unfold an array into a stream, does not check the end of the array, the
205−-- user is responsible for terminating the stream within the array bounds. For
206−-- high performance application where the end condition can be determined by
207−-- a terminating fold.
208−--
209−-- Written in the hope that it may be faster than "read", however, in the case
210−-- for which this was written, "read" proves to be faster even though the core
211−-- generated with unsafeRead looks simpler.
212−--
213−-- /Pre-release/
214−--
215−{-# INLINE_NORMAL readerUnsafe #-}
216−readerUnsafe :: forall m a. (Monad m, Unbox a) => Unfold m (Array a) a
217−readerUnsafe = Unfold step inject
218− where
219−
220− inject (Array contents start end) =
221− return (ArrayUnsafe contents end start)
222−
223− {-# INLINE_LATE step #-}
224− step (ArrayUnsafe contents end p) = do
225− -- unsafeInlineIO allows us to run this in Identity monad for pure
226− -- toList/foldr case which makes them much faster due to not
227− -- accumulating the list and fusing better with the pure consumers.
228− --
229− -- This should be safe as the array contents are guaranteed to be
230− -- evaluated/written to before we peek at them.
231− let !x = unsafeInlineIO $ peekWith contents p
232− let !p1 = INDEX_NEXT(p,a)
233− return $ D.Yield x (ArrayUnsafe contents end p1)
234−
235173-- |
236174--
237−-- >>> import qualified Streamly.Internal.Data.Array.Type as Array
238175-- >>> null arr = Array.byteLength arr == 0
239176--
240177-- /Pre-release/
241178{-# INLINE null #-}
242179null :: Array a -> Bool
243−null arr = A.byteLength arr == 0
180+null arr = byteLength arr == 0
244181
245182-- | Like 'getIndex' but indexes the array in reverse from the end.
246183--
@@ -252,12 +189,11 @@ getIndexRev i arr =
252189 $ do
253190 let elemPtr = RINDEX_OF(arrEnd arr, i, a)
254191 if i >= 0 && elemPtr >= arrStart arr
255− then Just <$> peekWith (arrContents arr) elemPtr
192+ then Just <$> peekAt elemPtr (arrContents arr)
256193 else return Nothing
257194
258195-- |
259196--
260−-- >>> import qualified Streamly.Internal.Data.Array as Array
261197-- >>> last arr = Array.getIndexRev arr 0
262198--
263199-- /Pre-release/
@@ -269,6 +205,8 @@ last = getIndexRev 0
269205-- Folds with Array as the container
270206-------------------------------------------------------------------------------
271207
208+-- XXX We should generate this from Ring.
209+
272210-- | @writeLastN n@ folds a maximum of @n@ elements from the end of the input
273211-- stream to an 'Array'.
274212--
@@ -277,7 +215,7 @@ writeLastN ::
277215 (Storable a, Unbox a, MonadIO m) => Int -> Fold m a (Array a)
278216writeLastN n
279217 | n <= 0 = fmap (const mempty) FL.drain
280− | otherwise = A.unsafeFreeze <$> Fold step initial done
218+ | otherwise = unsafeFreeze <$> Fold step initial done done
281219
282220 where
283221
@@ -290,11 +228,9 @@ writeLastN n
290228 in fmap f $ liftIO $ RB.new n
291229
292230 done (Tuple3Fused' rb rh i) = do
293− arr <- liftIO $ MA.newPinned n
294− foldFunc i rh snoc' arr rb
295−
296− -- XXX We should write a read unfold for ring.
297− snoc' b a = liftIO $ MA.snocUnsafe b a
231+ arr <- MA.new n
232+ -- XXX We should write a read unfold for ring.
233+ foldFunc i rh MA.snocUnsafe arr rb
298234
299235 foldFunc i
300236 | i < n = RB.unsafeFoldRingM
@@ -320,19 +256,26 @@ binarySearch = undefined
320256-- compared to streams by using SIMD instructions.
321257-- We can also return a bit array instead.
322258
259+-- Can use SIMD.
260+
323261-- | Perform a linear search to find all the indices where a given element is
324262-- present in an array.
325263--
326264-- /Unimplemented/
327−findIndicesOf :: (a -> Bool) -> Unfold Identity (Array a) Int
328−findIndicesOf = undefined
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)
329272
330273{-
331274findIndexOf :: (a -> Bool) -> Array a -> Maybe Int
332−findIndexOf p = Unfold.fold Fold.one . Stream.unfold (findIndicesOf p)
275+findIndexOf p = Unfold.fold Fold.one . Stream.unfold (indexFinder p)
333276
334277find :: (a -> Bool) -> Array a -> Bool
335−find = Unfold.fold Fold.null . Stream.unfold (findIndicesOf p)
278+find = Unfold.fold Fold.null . Stream.unfold (indexFinder p)
336279-}
337280
338281-------------------------------------------------------------------------------
@@ -373,31 +316,46 @@ getSliceUnsafe index len (Array contents start e) =
373316splitOn :: (Monad m, Unbox a) =>
374317 (a -> Bool) -> Array a -> Stream m (Array a)
375318splitOn predicate arr =
376− Stream.fromStreamD
377− $ fmap (\(i, len) -> getSliceUnsafe i len arr)
378− $ D.sliceOnSuffix predicate (A.toStreamD arr)
319+ fmap (\(i, len) -> getSliceUnsafe i len arr)
320+ $ D.indexOnSuffix predicate (read arr)
379321
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." #-}
380331{-# INLINE genSlicesFromLen #-}
381332genSlicesFromLen :: forall m a. (Monad m, Unbox a)
382333 => Int -- ^ from index
383334 -> Int -- ^ length of the slice
384335 -> Unfold m (Array a) (Int, Int)
385−genSlicesFromLen from len =
386− Unfold.lmap A.unsafeThaw (MA.genSlicesFromLen from len)
336+genSlicesFromLen = sliceIndexerFromLen
387337
388338-- | Generate a stream of slices of specified length from an array, starting
389339-- from the supplied array index. The last slice may be shorter than the
390340-- requested length.
391341--
392342-- /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." #-}
393353{-# INLINE getSlicesFromLen #-}
394354getSlicesFromLen :: forall m a. (Monad m, Unbox a)
395355 => Int -- ^ from index
396356 -> Int -- ^ length of the slice
397357 -> Unfold m (Array a) (Array a)
398−getSlicesFromLen from len =
399− fmap A.unsafeFreeze
400− $ Unfold.lmap A.unsafeThaw (MA.getSlicesFromLen from len)
358+getSlicesFromLen = slicerFromLen
401359
402360-------------------------------------------------------------------------------
403361-- Random reads and writes
@@ -415,7 +373,7 @@ getIndex i arr =
415373 $ do
416374 let elemPtr = INDEX_OF(arrStart arr, i, a)
417375 if i >= 0 && INDEX_VALID(elemPtr, arrEnd arr, a)
418− then Just <$> peekWith (arrContents arr) elemPtr
376+ then Just <$> peekAt elemPtr (arrContents arr)
419377 else return Nothing
420378
421379-- | Given a stream of array indices, read the elements on those indices from
@@ -427,19 +385,25 @@ getIndex i arr =
427385-- @
428386-- read =
429387-- let u = lmap (\arr -> (0, length arr - 1)) Unfold.enumerateFromTo
430−-- in Unfold.lmap f (getIndices arr)
388+-- in Unfold.lmap f (indexReader arr)
431389--
432390-- readRev =
433391-- let i = length arr - 1
434−-- in Unfold.lmap f (getIndicesFromThenTo i (i - 1) 0)
392+-- in Unfold.lmap f (indexReaderFromThenTo i (i - 1) 0)
435393-- @
436394--
437395-- /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." #-}
438404{-# INLINE getIndices #-}
439405getIndices :: (Monad m, Unbox a) => Stream m Int -> Unfold m (Array a) a
440−getIndices m =
441− let unf = MA.getIndicesD (return . unsafeInlineIO) $ D.fromStreamK $ Stream.toStreamK m
442− in Unfold.lmap A.unsafeThaw unf
406+getIndices = indexReader
443407
444408-- | Unfolds @(from, then, to, array)@ generating a finite stream whose first
445409-- element is the array value from the index @from@ and the successive elements
@@ -455,9 +419,9 @@ getIndices m =
455419-- @
456420--
457421-- /Unimplemented/
458−{-# INLINE getIndicesFromThenTo #-}
459−getIndicesFromThenTo :: Unfold m (Int, Int, Int, Array a) a
460−getIndicesFromThenTo = undefined
422+{-# INLINE indexReaderFromThenTo #-}
423+indexReaderFromThenTo :: Unfold m (Int, Int, Int, Array a) a
424+indexReaderFromThenTo = undefined
461425
462426-------------------------------------------------------------------------------
463427-- Transform via stream operations
@@ -474,7 +438,7 @@ getIndicesFromThenTo = undefined
474438{-# INLINE runPipe #-}
475439runPipe :: (MonadIO m, Unbox a, Unbox b)
476440 => Pipe m a b -> Array a -> m (Array b)
477−runPipe f arr = P.runPipe (toArrayMinChunk (length arr)) $ f (A.read arr)
441+runPipe f arr = P.runPipe (toArrayMinChunk (length arr)) $ f (read arr)
478442-}
479443
480444-- XXX For transformations that cannot change the number of elements e.g. "map"
@@ -488,7 +452,7 @@ runPipe f arr = P.runPipe (toArrayMinChunk (length arr)) $ f (A.read arr)
488452streamTransform :: forall m a b. (MonadIO m, Unbox a, Unbox b)
489453 => (Stream m a -> Stream m b) -> Array a -> m (Array b)
490454streamTransform f arr =
491− P.fold (A.writeWith (length arr)) $ Stream.toStreamK $ f (A.read arr)
455+ Stream.fold (createWith (length arr)) $ f (read arr)
492456
493457-------------------------------------------------------------------------------
494458-- Casts
@@ -522,13 +486,15 @@ asBytes = castUnsafe
522486--
523487cast :: forall a b. (Unbox b) => Array a -> Maybe (Array b)
524488cast arr =
525− let len = A.byteLength arr
489+ let len = byteLength arr
526490 r = len `mod` SIZE_OF(b)
527491 in if r /= 0
528492 then Nothing
529493 else Just $ castUnsafe arr
530494
531−-- | Convert an array of any type into a null terminated CString Ptr.
495+-- | Convert an array of any type into a null terminated CString Ptr. If the
496+-- array is unpinned it is first converted to a pinned array which requires a
497+-- copy.
532498--
533499-- /Unsafe/
534500--
@@ -538,9 +504,9 @@ cast arr =
538504--
539505asCStringUnsafe :: Array a -> (CString -> IO b) -> IO b
540506asCStringUnsafe arr act = do
541− -- XXX Ensure a pinned allocation here.
542− let arr1 = asBytes arr <> A.fromList [0]
543− asPtrUnsafe arr1 $ \ptr -> act (castPtr ptr)
507+ let arr1 = asBytes arr <> fromList [0]
508+ -- unsafePinnedAsPtr makes sure the array is pinned
509+ unsafePinnedAsPtr arr1 $ \ptr -> act (castPtr ptr)
544510
545511-------------------------------------------------------------------------------
546512-- Folds
@@ -553,11 +519,500 @@ asCStringUnsafe arr act = do
553519-- /Pre-release/
554520{-# INLINE fold #-}
555521fold :: forall m a b. (Monad m, Unbox a) => Fold m a b -> Array a -> m b
556−fold f arr = P.fold f (Stream.toStreamK (A.read arr))
522+fold f arr = Stream.fold f (read arr)
557523
558524-- | Fold an array using a stream fold operation.
559525--
560526-- /Pre-release/
561527{-# INLINE streamFold #-}
562528streamFold :: (Monad m, Unbox a) => (Stream m a -> m b) -> Array a -> m b
563−streamFold f arr = f (A.read arr)
529+streamFold f arr = f (read arr)
530+
531+--------------------------------------------------------------------------------
532+-- Serialization
533+--------------------------------------------------------------------------------
534+
535+{-# INLINE encodeAs #-}
536+encodeAs :: forall a. Serialize a => PinnedState -> a -> Array Word8
537+encodeAs ps a =
538+ unsafeInlineIO $ do
539+ let len = Serialize.addSizeTo 0 a
540+ mbarr <- MBA.newBytesAs ps len
541+ off <- Serialize.serializeAt 0 mbarr a
542+ assertM(len == off)
543+ pure $ Array mbarr 0 off
544+
545+-- |
546+-- Properties:
547+-- 1. Identity: @deserialize . serialize == id@
548+-- 2. Encoded equivalence: @serialize a == serialize a@
549+{-# INLINE serialize #-}
550+serialize :: Serialize a => a -> Array Word8
551+serialize = encodeAs Unpinned
552+
553+-- | Serialize a Haskell type to a pinned byte array. The array is allocated
554+-- using pinned memory so that it can be used directly in OS APIs for writing
555+-- to file or sending over the network.
556+--
557+-- Properties:
558+-- 1. Identity: @deserialize . pinnedSerialize == id@
559+-- 2. Encoded equivalence: @pinnedSerialize a == pinnedSerialize a@
560+{-# INLINE pinnedSerialize #-}
561+pinnedSerialize :: Serialize a => a -> Array Word8
562+pinnedSerialize = encodeAs Pinned
563+
564+-- | Decode a Haskell type from a byte array containing its serialized
565+-- representation.
566+{-# INLINE deserialize #-}
567+deserialize :: Serialize a => Array Word8 -> a
568+deserialize arr@(Array {..}) = unsafeInlineIO $ do
569+ let lenArr = length arr
570+ (off, val) <-
571+ Serialize.deserializeAt arrStart arrContents (arrStart + lenArr)
572+ assertM(off == arrStart + lenArr)
573+ pure val
574+
575+-------------------------------------------------------------------------------
576+-- Streams of Arrays
577+-------------------------------------------------------------------------------
578+
579+-- TODO: efficiently compare two streams of arrays. Two streams can have chunks
580+-- of different sizes, we can handle that in the stream comparison abstraction.
581+-- This could be useful e.g. to fast compare whether two files differ.
582+
583+-- | Insert the given element between arrays and flatten.
584+--
585+-- >>> interpose x = Stream.interpose x Array.reader
586+--
587+{-# INLINE interpose #-}
588+interpose :: (Monad m, Unbox a) => a -> Stream m (Array a) -> Stream m a
589+interpose x = D.interpose x reader
590+
591+data FlattenState s =
592+ OuterLoop s
593+ | InnerLoop s !MutByteArray !Int !Int
594+
595+-- | Insert the given element after each array and flatten. This is similar to
596+-- unlines.
597+--
598+-- >>> interposeSuffix x = Stream.interposeSuffix x Array.reader
599+--
600+{-# INLINE_NORMAL interposeSuffix #-}
601+interposeSuffix :: forall m a. (Monad m, Unbox a)
602+ => a -> Stream m (Array a) -> Stream m a
603+-- This does not require MonadIO constraint.
604+-- interposeSuffix x = D.interposeSuffix x reader
605+interposeSuffix sep (D.Stream step state) = D.Stream step' (OuterLoop state)
606+
607+ where
608+
609+ {-# INLINE_LATE step' #-}
610+ step' gst (OuterLoop st) = do
611+ r <- step (adaptState gst) st
612+ return $ case r of
613+ D.Yield Array{..} s ->
614+ D.Skip (InnerLoop s arrContents arrStart arrEnd)
615+ D.Skip s -> D.Skip (OuterLoop s)
616+ D.Stop -> D.Stop
617+
618+ step' _ (InnerLoop st _ p end) | p == end =
619+ return $ D.Yield sep $ OuterLoop st
620+
621+ step' _ (InnerLoop st contents p end) = do
622+ x <- pure $ unsafeInlineIO $ peekAt p contents
623+ return $ D.Yield x (InnerLoop st contents (INDEX_NEXT(p,a)) end)
624+
625+-- | Insert the given array after each array and flatten.
626+--
627+-- >>> intercalateSuffix = Stream.intercalateSuffix Array.reader
628+--
629+{-# INLINE intercalateSuffix #-}
630+intercalateSuffix :: (Monad m, Unbox a)
631+ => Array a -> Stream m (Array a) -> Stream m a
632+intercalateSuffix = D.intercalateSuffix reader
633+
634+-- | @compactLE n@ coalesces adjacent arrays in the input stream
635+-- only if the combined size would be less than or equal to n.
636+--
637+-- Generates unpinned arrays irrespective of the pinning status of input
638+-- arrays.
639+{-# INLINE_NORMAL compactLE #-}
640+compactLE :: (MonadIO m, Unbox a)
641+ => Int -> Stream m (Array a) -> Stream m (Array a)
642+compactLE n stream =
643+ D.map unsafeFreeze $ MA.compactLE n $ D.map unsafeThaw stream
644+
645+-- | Pinned version of 'compactLE'.
646+{-# INLINE_NORMAL pinnedCompactLE #-}
647+pinnedCompactLE :: (MonadIO m, Unbox a)
648+ => Int -> Stream m (Array a) -> Stream m (Array a)
649+pinnedCompactLE n stream =
650+ D.map unsafeFreeze $ MA.pinnedCompactLE n $ D.map unsafeThaw stream
651+
652+-- | Split a stream of arrays on a given separator byte, dropping the separator
653+-- and coalescing all the arrays between two separators into a single array.
654+--
655+{-# INLINE compactOnByte #-}
656+compactOnByte
657+ :: (MonadIO m)
658+ => Word8
659+ -> Stream m (Array Word8)
660+ -> Stream m (Array Word8)
661+compactOnByte byte =
662+ fmap unsafeFreeze . MA.compactOnByte byte . fmap unsafeThaw
663+
664+-- | Like 'compactOnByte' considers the separator in suffix position instead of
665+-- infix position.
666+{-# INLINE compactOnByteSuffix #-}
667+compactOnByteSuffix
668+ :: (MonadIO m)
669+ => Word8
670+ -> Stream m (Array Word8)
671+ -> Stream m (Array Word8)
672+compactOnByteSuffix byte =
673+ fmap unsafeFreeze . MA.compactOnByteSuffix byte . fmap unsafeThaw
674+
675+-------------------------------------------------------------------------------
676+-- Folding Streams of Arrays
677+-------------------------------------------------------------------------------
678+
679+-- XXX This should not be used for breaking a stream as the D.cons used in
680+-- reconstructing the stream could be very bad for performance. This can only
681+-- be useful in folding without breaking.
682+{-# INLINE_NORMAL foldBreakChunks #-}
683+foldBreakChunks :: forall m a b. (MonadIO m, Unbox a) =>
684+ Fold m a b -> Stream m (Array a) -> m (b, Stream m (Array a))
685+foldBreakChunks (Fold fstep initial _ final) stream@(Stream step state) = do
686+ res <- initial
687+ case res of
688+ Fold.Partial fs -> go SPEC state fs
689+ Fold.Done fb -> return $! (fb, stream)
690+
691+ where
692+
693+ {-# INLINE go #-}
694+ go !_ st !fs = do
695+ r <- step defState st
696+ case r of
697+ Stream.Yield (Array contents start end) s ->
698+ let fp = Tuple' end contents
699+ in goArray SPEC s fp start fs
700+ Stream.Skip s -> go SPEC s fs
701+ Stream.Stop -> do
702+ b <- final fs
703+ return (b, D.nil)
704+
705+ goArray !_ s (Tuple' end _) !cur !fs
706+ | cur == end = do
707+ go SPEC s fs
708+ goArray !_ st fp@(Tuple' end contents) !cur !fs = do
709+ x <- liftIO $ peekAt cur contents
710+ res <- fstep fs x
711+ let next = INDEX_NEXT(cur,a)
712+ case res of
713+ Fold.Done b -> do
714+ let arr = Array contents next end
715+ return $! (b, D.cons arr (D.Stream step st))
716+ Fold.Partial fs1 -> goArray SPEC st fp next fs1
717+
718+-- This may be more robust wrt fusion compared to unfoldMany?
719+
720+-- | Fold a stream of arrays using a 'Fold'. This is equivalent to the
721+-- following:
722+--
723+-- >>> foldChunks f = Stream.fold f . Stream.unfoldMany Array.reader
724+--
725+foldChunks :: (MonadIO m, Unbox a) => Fold m a b -> Stream m (Array a) -> m b
726+foldChunks f s = fmap fst (foldBreakChunks f s)
727+-- foldStream f = Stream.fold f . Stream.unfoldMany reader
728+
729+-- | Fold a stream of arrays using a 'Fold' and return the remaining stream.
730+--
731+-- The following alternative to this function allows composing the fold using
732+-- the parser Monad:
733+--
734+-- @
735+-- foldBreakStreamK f s =
736+-- fmap (first (fromRight undefined))
737+-- $ StreamK.parseBreakChunks (ParserK.adaptC (Parser.fromFold f)) s
738+-- @
739+--
740+-- We can compare perf and remove this one or define it in terms of that.
741+--
742+foldBreakChunksK :: forall m a b. (MonadIO m, Unbox a) =>
743+ Fold m a b -> StreamK m (Array a) -> m (b, StreamK m (Array a))
744+{-
745+foldBreakChunksK f s =
746+ fmap (first (fromRight undefined))
747+ $ StreamK.parseBreakChunks (ParserK.adaptC (Parser.fromFold f)) s
748+-}
749+foldBreakChunksK (Fold fstep initial _ final) stream = do
750+ res <- initial
751+ case res of
752+ Fold.Partial fs -> go fs stream
753+ Fold.Done fb -> return (fb, stream)
754+
755+ where
756+
757+ {-# INLINE go #-}
758+ go !fs st = do
759+ let stop = (, StreamK.nil) <$> final fs
760+ single a = yieldk a StreamK.nil
761+ yieldk (Array contents start end) r =
762+ let fp = Tuple' end contents
763+ in goArray fs r fp start
764+ in StreamK.foldStream defState yieldk single stop st
765+
766+ goArray !fs st (Tuple' end _) !cur
767+ | cur == end = do
768+ go fs st
769+ goArray !fs st fp@(Tuple' end contents) !cur = do
770+ x <- liftIO $ peekAt cur contents
771+ res <- fstep fs x
772+ let next = INDEX_NEXT(cur,a)
773+ case res of
774+ Fold.Done b -> do
775+ let arr = Array contents next end
776+ return $! (b, StreamK.cons arr st)
777+ Fold.Partial fs1 -> goArray fs1 st fp next
778+
779+{-
780+-- This can be generalized to any type provided it can be unfolded to a stream
781+-- and it can be combined using a semigroup operation.
782+--
783+{-# INLINE_NORMAL parseBreakD #-}
784+parseBreakD ::
785+ forall m a b. (MonadIO m, MonadThrow m, Unbox a)
786+ => PRD.Parser a m b
787+ -> D.Stream m (Array.Array a)
788+ -> m (b, D.Stream m (Array.Array a))
789+parseBreakD
790+ (PRD.Parser pstep initial extract) stream@(D.Stream step state) = do
791+
792+ res <- initial
793+ case res of
794+ PRD.IPartial s -> go SPEC state (List []) s
795+ PRD.IDone b -> return (b, stream)
796+ PRD.IError err -> throwM $ ParseError err
797+
798+ where
799+
800+ -- "backBuf" contains last few items in the stream that we may have to
801+ -- backtrack to.
802+ --
803+ -- XXX currently we are using a dumb list based approach for backtracking
804+ -- buffer. This can be replaced by a sliding/ring buffer using Data.Array.
805+ -- That will allow us more efficient random back and forth movement.
806+ go !_ st backBuf !pst = do
807+ r <- step defState st
808+ case r of
809+ D.Yield (Array contents start end) s ->
810+ gobuf SPEC s backBuf
811+ (Tuple' end contents) start pst
812+ D.Skip s -> go SPEC s backBuf pst
813+ D.Stop -> do
814+ b <- extract pst
815+ return (b, D.nil)
816+
817+ -- Use strictness on "cur" to keep it unboxed
818+ gobuf !_ s backBuf (Tuple' end _) !cur !pst
819+ | cur == end = do
820+ go SPEC s backBuf pst
821+ gobuf !_ s backBuf fp@(Tuple' end contents) !cur !pst = do
822+ x <- liftIO $ peekByteIndex contents cur
823+ pRes <- pstep pst x
824+ let next = INDEX_NEXT(cur,a)
825+ case pRes of
826+ PR.Partial 0 pst1 ->
827+ gobuf SPEC s (List []) fp next pst1
828+ PR.Partial n pst1 -> do
829+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
830+ let src0 = Prelude.take n (x:getList backBuf)
831+ arr0 = A.fromListN n (Prelude.reverse src0)
832+ arr1 = Array contents next end
833+ src = arr0 <> arr1
834+ let !(Array cont1 start end1) = src
835+ fp1 = Tuple' end1 cont1
836+ gobuf SPEC s (List []) fp1 start pst1
837+ PR.Continue 0 pst1 ->
838+ gobuf SPEC s (List (x:getList backBuf)) fp next pst1
839+ PR.Continue n pst1 -> do
840+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
841+ let (src0, buf1) = splitAt n (x:getList backBuf)
842+ arr0 = A.fromListN n (Prelude.reverse src0)
843+ arr1 = Array contents next end
844+ src = arr0 <> arr1
845+ let !(Array cont1 start end1) = src
846+ fp1 = Tuple' end1 cont1
847+ gobuf SPEC s (List buf1) fp1 start pst1
848+ PR.Done 0 b -> do
849+ let arr = Array contents next end
850+ return (b, D.cons arr (D.Stream step s))
851+ PR.Done n b -> do
852+ assert (n <= Prelude.length (x:getList backBuf)) (return ())
853+ let src0 = Prelude.take n (x:getList backBuf)
854+ -- XXX create the array in reverse instead
855+ arr0 = A.fromListN n (Prelude.reverse src0)
856+ arr1 = Array contents next end
857+ -- XXX Use StreamK to avoid adding arbitrary layers of
858+ -- constructors every time.
859+ str = D.cons arr0 (D.cons arr1 (D.Stream step s))
860+ return (b, str)
861+ PR.Error err -> throwM $ ParseError err
862+-}
863+
864+-- | Parse an array stream using the supplied 'Parser'. Returns the parse
865+-- result and the unconsumed stream. Throws 'ParseError' if the parse fails.
866+--
867+-- The following alternative to this function allows composing the parser using
868+-- the parser Monad:
869+--
870+-- >>> parseBreakStreamK p = StreamK.parseBreakChunks (ParserK.adaptC p)
871+--
872+-- We can compare perf and remove this one or define it in terms of that.
873+--
874+-- /Internal/
875+--
876+{-# INLINE_NORMAL parseBreakChunksK #-}
877+parseBreakChunksK ::
878+ forall m a b. (MonadIO m, Unbox a)
879+ => Parser a m b
880+ -> StreamK m (Array a)
881+ -> m (Either ParseError b, StreamK m (Array a))
882+-- parseBreakStreamK p = StreamK.parseBreakChunks (ParserK.adaptC p)
883+parseBreakChunksK (Parser pstep initial extract) stream = do
884+ res <- initial
885+ case res of
886+ IPartial s -> go s stream []
887+ IDone b -> return (Right b, stream)
888+ IError err -> return (Left (ParseError err), stream)
889+
890+ where
891+
892+ -- "backBuf" contains last few items in the stream that we may have to
893+ -- backtrack to.
894+ --
895+ -- XXX currently we are using a dumb list based approach for backtracking
896+ -- buffer. This can be replaced by a sliding/ring buffer using Data.Array.
897+ -- That will allow us more efficient random back and forth movement.
898+ go !pst st backBuf = do
899+ let stop = goStop pst backBuf -- (, K.nil) <$> extract pst
900+ single a = yieldk a StreamK.nil
901+ yieldk arr r = goArray pst backBuf r arr
902+ in StreamK.foldStream defState yieldk single stop st
903+
904+ -- Use strictness on "cur" to keep it unboxed
905+ goArray !pst backBuf st (Array _ cur end) | cur == end = go pst st backBuf
906+ goArray !pst backBuf st (Array contents cur end) = do
907+ x <- liftIO $ peekAt cur contents
908+ pRes <- pstep pst x
909+ let next = INDEX_NEXT(cur,a)
910+ case pRes of
911+ Parser.Partial 0 s ->
912+ goArray s [] st (Array contents next end)
913+ Parser.Partial n s -> do
914+ assert (n <= Prelude.length (x:backBuf)) (return ())
915+ let src0 = Prelude.take n (x:backBuf)
916+ arr0 = fromListN n (Prelude.reverse src0)
917+ arr1 = Array contents next end
918+ src = arr0 <> arr1
919+ goArray s [] st src
920+ Parser.Continue 0 s ->
921+ goArray s (x:backBuf) st (Array contents next end)
922+ Parser.Continue n s -> do
923+ assert (n <= Prelude.length (x:backBuf)) (return ())
924+ let (src0, buf1) = Prelude.splitAt n (x:backBuf)
925+ arr0 = fromListN n (Prelude.reverse src0)
926+ arr1 = Array contents next end
927+ src = arr0 <> arr1
928+ goArray s buf1 st src
929+ Parser.Done 0 b -> do
930+ let arr = Array contents next end
931+ return (Right b, StreamK.cons arr st)
932+ Parser.Done n b -> do
933+ assert (n <= Prelude.length (x:backBuf)) (return ())
934+ let src0 = Prelude.take n (x:backBuf)
935+ -- XXX Use fromListRevN once implemented
936+ -- arr0 = A.fromListRevN n src0
937+ arr0 = fromListN n (Prelude.reverse src0)
938+ arr1 = Array contents next end
939+ str = StreamK.cons arr0 (StreamK.cons arr1 st)
940+ return (Right b, str)
941+ Parser.Error err -> do
942+ let n = Prelude.length backBuf
943+ arr0 = fromListN n (Prelude.reverse backBuf)
944+ arr1 = Array contents cur end
945+ str = StreamK.cons arr0 (StreamK.cons arr1 stream)
946+ return (Left (ParseError err), str)
947+
948+ -- This is a simplified goArray
949+ goExtract !pst backBuf (Array _ cur end)
950+ | cur == end = goStop pst backBuf
951+ goExtract !pst backBuf (Array contents cur end) = do
952+ x <- liftIO $ peekAt cur contents
953+ pRes <- pstep pst x
954+ let next = INDEX_NEXT(cur,a)
955+ case pRes of
956+ Parser.Partial 0 s ->
957+ goExtract s [] (Array contents next end)
958+ Parser.Partial n s -> do
959+ assert (n <= Prelude.length (x:backBuf)) (return ())
960+ let src0 = Prelude.take n (x:backBuf)
961+ arr0 = fromListN n (Prelude.reverse src0)
962+ arr1 = Array contents next end
963+ src = arr0 <> arr1
964+ goExtract s [] src
965+ Parser.Continue 0 s ->
966+ goExtract s backBuf (Array contents next end)
967+ Parser.Continue n s -> do
968+ assert (n <= Prelude.length (x:backBuf)) (return ())
969+ let (src0, buf1) = Prelude.splitAt n (x:backBuf)
970+ arr0 = fromListN n (Prelude.reverse src0)
971+ arr1 = Array contents next end
972+ src = arr0 <> arr1
973+ goExtract s buf1 src
974+ Parser.Done 0 b -> do
975+ let arr = Array contents next end
976+ return (Right b, StreamK.fromPure arr)
977+ Parser.Done n b -> do
978+ assert (n <= Prelude.length backBuf) (return ())
979+ let src0 = Prelude.take n backBuf
980+ -- XXX Use fromListRevN once implemented
981+ -- arr0 = A.fromListRevN n src0
982+ arr0 = fromListN n (Prelude.reverse src0)
983+ arr1 = Array contents next end
984+ str = StreamK.cons arr0 (StreamK.fromPure arr1)
985+ return (Right b, str)
986+ Parser.Error err -> do
987+ let n = Prelude.length backBuf
988+ arr0 = fromListN n (Prelude.reverse backBuf)
989+ arr1 = Array contents cur end
990+ str = StreamK.cons arr0 (StreamK.cons arr1 stream)
991+ return (Left (ParseError err), str)
992+
993+ -- This is a simplified goExtract
994+ {-# INLINE goStop #-}
995+ goStop !pst backBuf = do
996+ pRes <- extract pst
997+ case pRes of
998+ Parser.Partial _ _ -> error "Bug: parseBreak: Partial in extract"
999+ Parser.Continue 0 s ->
1000+ goStop s backBuf
1001+ Parser.Continue n s -> do
1002+ assert (n <= Prelude.length backBuf) (return ())
1003+ let (src0, buf1) = Prelude.splitAt n backBuf
1004+ arr = fromListN n (Prelude.reverse src0)
1005+ goExtract s buf1 arr
1006+ Parser.Done 0 b ->
1007+ return (Right b, StreamK.nil)
1008+ Parser.Done n b -> do
1009+ assert (n <= Prelude.length backBuf) (return ())
1010+ let src0 = Prelude.take n backBuf
1011+ -- XXX Use fromListRevN once implemented
1012+ -- arr0 = A.fromListRevN n src0
1013+ arr0 = fromListN n (Prelude.reverse src0)
1014+ return (Right b, StreamK.fromPure arr0)
1015+ Parser.Error err -> do
1016+ let n = Prelude.length backBuf
1017+ arr0 = fromListN n (Prelude.reverse backBuf)
1018+ return (Left (ParseError err), StreamK.fromPure arr0)
core/src/Streamly/Internal/Data/Array/Generic.hs+151−184
@@ -4,7 +4,6 @@
44--
55-- License : BSD-3-Clause
66-- Maintainer : streamly@composewell.com
7−-- Stability : pre-release
87-- Portability : GHC
98--
109module Streamly.Internal.Data.Array.Generic
@@ -12,25 +11,26 @@ module Streamly.Internal.Data.Array.Generic
1211
1312 -- * Construction
1413 , nil
15− , writeN
16− , write
14+ , createOf
15+ , create
16+ , writeWith
1717 , writeLastN
1818
19− , fromStreamDN
20− , fromStreamD
2119 , fromStreamN
2220 , fromStream
21+ , fromPureStream
22+ , fromByteStr#
2323
2424 , fromListN
2525 , fromList
2626
27+ , chunksOf
28+
2729 -- * Elimination
2830 , length
2931 , reader
3032
3133 , toList
32− , readStreamD
33− , readRevStreamD
3434 , read
3535 , readRev
3636
@@ -41,36 +41,42 @@ module Streamly.Internal.Data.Array.Generic
4141
4242 -- * Random Access
4343 , getIndexUnsafe
44+ , getIndex
45+ , getSliceUnsafe
4446 , strip
45− , putIndices
47+
48+ -- * Deprecated
49+ , writeN
50+ , write
4651 )
4752where
4853
4954#include "inline.hs"
5055
51−import Control.Monad (when, replicateM)
52−import Control.Monad.IO.Class (liftIO, MonadIO)
56+import Control.Monad (replicateM)
57+import Control.Monad.IO.Class (MonadIO)
58+import Data.Functor.Identity (Identity(..))
59+import Data.Word (Word8)
5360import GHC.Base (MutableArray#, RealWorld)
61+import GHC.Exts (Addr#)
5462import GHC.IO (unsafePerformIO)
5563import Text.Read (readPrec)
5664
5765import Streamly.Internal.Data.Fold.Type (Fold(..))
5866import Streamly.Internal.Data.Stream.Type (Stream)
59−import Streamly.Internal.Data.Tuple.Strict (Tuple'(..), Tuple3'(..))
6067import Streamly.Internal.Data.Unfold.Type (Unfold(..))
6168import Streamly.Internal.System.IO (unsafeInlineIO)
6269
63−import qualified Streamly.Internal.Data.Array.Generic.Mut.Type as MArray
70+import qualified Streamly.Internal.Data.MutArray.Generic as MArray
6471import qualified Streamly.Internal.Data.Fold.Type as FL
6572import qualified Streamly.Internal.Data.Producer.Type as Producer
6673import qualified Streamly.Internal.Data.Producer as Producer
67−import 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
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
7077import qualified Text.ParserCombinators.ReadPrec as ReadPrec
7178
72−import Data.IORef
73−import Prelude hiding (foldr, length, read)
79+import Prelude hiding (Foldable(..), read)
7480
7581-------------------------------------------------------------------------------
7682-- Array Data Type
@@ -88,81 +94,87 @@ data Array a =
8894 -- ^ The length of this slice.
8995 }
9096
91−unsafeFreeze :: MArray.Array a -> Array a
92−unsafeFreeze (MArray.Array cont# arrS arrL _) = Array cont# arrS arrL
97+unsafeFreeze :: MArray.MutArray a -> Array a
98+unsafeFreeze (MArray.MutArray cont# arrS arrL _) = Array cont# arrS arrL
9399
94−unsafeThaw :: Array a -> MArray.Array a
95−unsafeThaw (Array cont# arrS arrL) = MArray.Array cont# arrS arrL arrL
100+unsafeThaw :: Array a -> MArray.MutArray a
101+unsafeThaw (Array cont# arrS arrL) = MArray.MutArray cont# arrS arrL arrL
96102
97103{-# NOINLINE nil #-}
98104nil :: Array a
99−nil = unsafePerformIO $ do
100− marr <- MArray.new 0
101− return $ unsafeFreeze marr
105+nil = unsafePerformIO $ unsafeFreeze <$> MArray.nil
102106
103107-------------------------------------------------------------------------------
104108-- Construction - Folds
105109-------------------------------------------------------------------------------
106110
107−{-# INLINE_NORMAL writeN #-}
111+{-# INLINE_NORMAL createOf #-}
112+createOf :: MonadIO m => Int -> Fold m a (Array a)
113+createOf = fmap unsafeFreeze <$> MArray.createOf
114+
115+-- XXX Deprecate in major
116+-- {-# DEPRECATED writeN "Please use createOf instead." #-}
117+{-# INLINE writeN #-}
108118writeN :: MonadIO m => Int -> Fold m a (Array a)
109−writeN = fmap unsafeFreeze <$> MArray.writeN
119+writeN = createOf
120+
121+{-# INLINE_NORMAL writeWith #-}
122+writeWith :: MonadIO m => Int -> Fold m a (Array a)
123+writeWith elemCount = unsafeFreeze <$> MArray.createWith elemCount
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
110132
111−{-# INLINE_NORMAL write #-}
133+-- XXX Deprecate in major
134+-- {-# DEPRECATED write "Please use create instead." #-}
135+{-# INLINE write #-}
112136write :: MonadIO m => Fold m a (Array a)
113−write = Fold step initial extract
114− where
115− initial = do
116− marr <- liftIO $ MArray.new 0
117− return $ FL.Partial (Tuple3' marr 0 0)
118− step (Tuple3' marr i capacity) x
119− | i == capacity =
120− let newCapacity = max (capacity * 2) 1
121− in do newMarr <- liftIO $ MArray.realloc newCapacity marr
122− marr1 <- liftIO $ MArray.snocUnsafe newMarr x
123− return $ FL.Partial $ Tuple3' marr1 (i + 1) newCapacity
124− | otherwise = do
125− marr1 <- liftIO $ MArray.snocUnsafe marr x
126− return $ FL.Partial $ Tuple3' marr1 (i + 1) capacity
127− extract (Tuple3' marr _ _) =
128− return $ unsafeFreeze marr
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)
129147
130148-------------------------------------------------------------------------------
131−-- Construction - from streams
149+-- Stream Ops
132150-------------------------------------------------------------------------------
133151
134−{-# INLINE_NORMAL fromStreamDN #-}
135−fromStreamDN :: MonadIO m => Int -> D.Stream m a -> m (Array a)
136−fromStreamDN limit str = do
137− marr <- liftIO $ MArray.new (max limit 0)
138− i <-
139− D.foldlM'
140− (\i x -> i `seq` liftIO $ MArray.putIndexUnsafe i marr x >> return (i + 1))
141− (return 0) $
142− D.take limit str
143− return $ unsafeFreeze $ marr { MArray.arrLen = i }
144−
145−{-# INLINE fromStreamD #-}
146−fromStreamD :: MonadIO m => D.Stream m a -> m (Array a)
147−fromStreamD = D.fold write
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+-------------------------------------------------------------------------------
148160
149161{-# INLINE fromStreamN #-}
150162fromStreamN :: MonadIO m => Int -> Stream m a -> m (Array a)
151−fromStreamN n m = do
152− when (n < 0) $ error "fromStreamN: negative write count specified"
153− fromStreamDN n $ Stream.toStreamD m
163+fromStreamN n = D.fold (writeN n)
154164
155165{-# INLINE fromStream #-}
156166fromStream :: MonadIO m => Stream m a -> m (Array a)
157−fromStream = fromStreamD . Stream.toStreamD
167+fromStream = D.fold write
168+
169+-- XXX Consider foldr/build fusion in toList/fromList
158170
159171{-# INLINABLE fromListN #-}
160172fromListN :: Int -> [a] -> Array a
161−fromListN n xs = unsafePerformIO $ fromStreamDN n $ D.fromList xs
173+fromListN n xs = unsafePerformIO $ fromStreamN n $ D.fromList xs
162174
163175{-# INLINABLE fromList #-}
164176fromList :: [a] -> Array a
165−fromList xs = unsafePerformIO $ fromStreamD $ D.fromList xs
177+fromList xs = unsafePerformIO $ fromStream $ D.fromList xs
166178
167179-------------------------------------------------------------------------------
168180-- Elimination - Unfolds
@@ -191,25 +203,18 @@ toList arr = loop 0
191203
192204 len = length arr
193205 loop i | i == len = []
194− loop i = getIndexUnsafe arr i : loop (i + 1)
195−
196−{-# INLINE_NORMAL readStreamD #-}
197−readStreamD :: MonadIO m => Array a -> D.Stream m a
198−readStreamD = MArray.toStreamD . unsafeThaw
199−
200−{-# INLINE_NORMAL readRevStreamD #-}
201−readRevStreamD :: Monad m => Array a -> D.Stream m a
202−readRevStreamD arr@Array{..} =
203− D.map (getIndexUnsafe arr)
204− $ D.enumerateFromThenToIntegral (arrLen - 1) (arrLen - 2) 0
206+ loop i = getIndexUnsafe i arr : loop (i + 1)
205207
206−{-# INLINE_EARLY read #-}
207−read :: MonadIO m => Array a -> Stream m a
208−read = Stream.fromStreamD . readStreamD
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)
209212
210−{-# INLINE_EARLY readRev #-}
213+{-# INLINE_NORMAL readRev #-}
211214readRev :: Monad m => Array a -> Stream m a
212−readRev = Stream.fromStreamD . readRevStreamD
215+readRev arr@Array{..} =
216+ D.map (`getIndexUnsafe` arr)
217+ $ D.enumerateFromThenToIntegral (arrLen - 1) (arrLen - 2) 0
213218
214219-------------------------------------------------------------------------------
215220-- Elimination - using Folds
@@ -217,18 +222,18 @@ readRev = Stream.fromStreamD . readRevStreamD
217222
218223{-# INLINE_NORMAL foldl' #-}
219224foldl' :: (b -> a -> b) -> b -> Array a -> b
220−foldl' f z arr = unsafePerformIO $ D.foldl' f z $ readStreamD arr
225+foldl' f z arr = unsafePerformIO $ D.foldl' f z $ read arr
221226
222227{-# INLINE_NORMAL foldr #-}
223228foldr :: (a -> b -> b) -> b -> Array a -> b
224−foldr f z arr = unsafePerformIO $ D.foldr f z $ readStreamD arr
229+foldr f z arr = unsafePerformIO $ D.foldr f z $ read arr
225230
226231{-# INLINE fold #-}
227−fold :: MonadIO m => Fold m a b -> Array a -> m b
228−fold f arr = D.fold f (readStreamD arr)
232+fold :: Monad m => Fold m a b -> Array a -> m b
233+fold f arr = D.fold f (read arr)
229234
230235{-# INLINE streamFold #-}
231−streamFold :: MonadIO m => (Stream m a -> m b) -> Array a -> m b
236+streamFold :: Monad m => (Stream m a -> m b) -> Array a -> m b
232237streamFold f arr = f (read arr)
233238
234239-------------------------------------------------------------------------------
@@ -240,134 +245,96 @@ streamFold f arr = f (read arr)
240245--
241246-- @since 0.8.0
242247{-# INLINE getIndexUnsafe #-}
243−getIndexUnsafe :: Array a -> Int -> a
244−getIndexUnsafe arr i =
248+getIndexUnsafe :: Int -> Array a -> a
249+getIndexUnsafe i arr =
245250 unsafePerformIO $ MArray.getIndexUnsafe i (unsafeThaw arr)
246251
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+--
247272{-# INLINE writeLastN #-}
248273writeLastN :: MonadIO m => Int -> Fold m a (Array a)
249−writeLastN n
250− | n <= 0 = fmap (const nil) FL.drain
251− | otherwise = Fold step initial done
274+writeLastN n = FL.rmapM f (RB.writeLastN n)
252275
253276 where
254277
255− initial = do
256− rb <- liftIO $ RB.createRing n
257− return $ FL.Partial $ Tuple' rb (0 :: Int)
278+ f rb = do
279+ arr <- RB.copyToMutArray 0 n rb
280+ return $ unsafeFreeze arr
258281
259− step (Tuple' rb rh) x = do
260− liftIO $ RB.unsafeInsertRing rb rh x
261− return $ FL.Partial $ Tuple' rb (rh + 1)
262−
263− done (Tuple' rb rh) = do
264− arr' <- liftIO $ MArray.new (min rh n)
265− ref <- liftIO $ readIORef $ RB.ringHead rb
266− if rh < n
267− then
268− MArray.putSliceUnsafe (RB.arr rb) 0 arr' 0 ref
269− else do
270− MArray.putSliceUnsafe (RB.arr rb) ref arr' 0 (n - ref)
271− MArray.putSliceUnsafe (RB.arr rb) 0 arr' (n - ref) ref
272− return $ unsafeFreeze arr'
273−
274−sliceUnsafe :: Int -> Int -> Array a -> Array a
275−sliceUnsafe offset len (Array cont off1 _) = Array cont (off1 + offset) len
282+{-# INLINE getSliceUnsafe #-}
283+getSliceUnsafe :: Int -> Int -> Array a -> Array a
284+getSliceUnsafe offset len (Array cont off1 _) = Array cont (off1 + offset) len
276285
277286-- XXX This is not efficient as it copies the array. We should support array
278287-- slicing so that we can just refer to the underlying array memory instead of
279288-- copying.
280−--
289+
281290-- | Truncate the array at the beginning and end as long as the predicate
282−-- holds true.
291+-- holds true. Returns a slice of the original array.
292+{-# INLINE strip #-}
283293strip :: (a -> Bool) -> Array a -> Array a
284−strip p arr =
285− let lastIndex = length arr - 1
286− indexR = getIndexR lastIndex -- last predicate failing index
287− in if indexR == -1
288− then nil
289− else
290− let indexL = getIndexL 0 -- first predicate failing index
291− in if indexL == 0 && indexR == lastIndex
292− then arr
293− else unsafeFreeze $ unsafePerformIO $ do
294− let newLen = indexR - indexL + 1
295− arrThawed = unsafeThaw (sliceUnsafe indexL newLen arr)
296− MArray.clone arrThawed
297−
298− where
299−
300− getIndexR idx
301− | idx < 0 = idx
302− | otherwise =
303− if p (getIndexUnsafe arr idx) then getIndexR (idx - 1) else idx
304−
305− getIndexL idx = if p (getIndexUnsafe arr idx)
306− then getIndexL (idx + 1)
307− else idx
308−
309−-- | Write an input stream of (index, value) pairs to an array. Throws an
310−-- error if any index is out of bounds.
311−--
312−-- /Pre-release/
313−{-# INLINE putIndices #-}
314−putIndices :: MonadIO m
315− => Array a -> Fold m (Int, a) ()
316−putIndices arr = FL.rmapM (\ _ -> return ()) (FL.foldlM' step initial)
317−
318− where
319−
320− initial = return $ unsafeThaw arr
321−
322− step marr (i, x) = do
323− MArray.putIndexUnsafe i marr x
324− return marr
294+strip p arr = unsafeFreeze $ unsafePerformIO $ MArray.strip p (unsafeThaw arr)
325295
326296-------------------------------------------------------------------------------
327297-- Instances
328298-------------------------------------------------------------------------------
329299
330300instance Eq a => Eq (Array a) where
331− a1 == a2 = lenA1 == lenA2 && loop (lenA1 - 1)
301+ {-# INLINE (==) #-}
302+ arr1 == arr2 =
303+ unsafeInlineIO $! unsafeThaw arr1 `MArray.eq` unsafeThaw arr2
332304
333− where
305+instance Ord a => Ord (Array a) where
306+ {-# INLINE compare #-}
307+ compare arr1 arr2 =
308+ unsafeInlineIO $! unsafeThaw arr1 `MArray.cmp` unsafeThaw arr2
334309
335− lenA1 = length a1
336− lenA2 = length a2
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 }
337314
338− loop i
339− | i < 0 = True
340− | otherwise =
341− let v1 = getIndexUnsafe a1 i
342− v2 = getIndexUnsafe a2 i
343− in v1 == v2 && loop (i - 1)
315+ {-# INLINE (<=) #-}
316+ x <= y = case compare x y of { GT -> False; _ -> True }
344317
345−instance Ord a => Ord (Array a) where
346− compare a1 a2 =
347− case compare lenA1 lenA2 of
348− LT -> LT
349− GT -> GT
350− EQ -> loop 0
351−
352− where
353−
354− lenA1 = length a1
355− lenA2 = length a2
356−
357− loop i
358− | i >= lenA1 = EQ
359− | otherwise =
360− let v1 = getIndexUnsafe a1 i
361− v2 = getIndexUnsafe a2 i
362− in case compare v1 v2 of
363− LT -> LT
364− GT -> GT
365− EQ -> loop (i + 1)
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
366331
367332instance Show a => Show (Array a) where
333+ {-# INLINE show #-}
368334 show arr = "fromList " ++ show (toList arr)
369335
370336instance Read a => Read (Array a) where
337+ {-# INLINE readPrec #-}
371338 readPrec = do
372339 fromListWord <- replicateM 9 ReadPrec.get
373340 if fromListWord == "fromList "
core/src/Streamly/Internal/Data/Array/Generic/Mut/Type.hsdeleted−607
@@ -1,607 +0,0 @@
1−{-# LANGUAGE UnboxedTuples #-}
2−
3−-- |
4−-- Module : Streamly.Internal.Data.Array.Generic.Mut.Type
5−-- Copyright : (c) 2020 Composewell Technologies
6−-- License : BSD3-3-Clause
7−-- Maintainer : streamly@composewell.com
8−-- Stability : experimental
9−-- Portability : GHC
10−--
11−module Streamly.Internal.Data.Array.Generic.Mut.Type
12−(
13− -- * Type
14− -- $arrayNotes
15− Array (..)
16−
17− -- * Constructing and Writing
18− -- ** Construction
19− -- , nil
20−
21− -- *** Uninitialized Arrays
22− , new
23− -- , newArrayWith
24−
25− -- *** From streams
26− , writeNUnsafe
27− , writeN
28−
29− -- , writeWith
30− -- , write
31−
32− -- , writeRevN
33− -- , writeRev
34−
35− -- ** From containers
36− -- , fromListN
37− -- , fromList
38− -- , fromStreamDN
39− -- , fromStreamD
40−
41− -- * Random writes
42− , putIndex
43− , putIndexUnsafe
44− -- , putIndices
45− -- , putFromThenTo
46− -- , putFrom -- start writing at the given position
47− -- , putUpto -- write from beginning up to the given position
48− -- , putFromTo
49− -- , putFromRev
50− -- , putUptoRev
51− , modifyIndexUnsafe
52− , modifyIndex
53− -- , modifyIndices
54− -- , modify
55− -- , swapIndices
56−
57− -- * Growing and Shrinking
58− -- Arrays grow only at the end, though it is possible to grow on both sides
59− -- and therefore have a cons as well as snoc. But that will require two
60− -- bounds in the array representation.
61−
62− -- ** Reallocation
63− , realloc
64−
65− -- ** Appending elements
66− , snocWith
67− , snoc
68− -- , snocLinear
69− -- , snocMay
70− , snocUnsafe
71−
72− -- ** Appending streams
73− -- , writeAppendNUnsafe
74− -- , writeAppendN
75− -- , writeAppendWith
76− -- , writeAppend
77−
78− -- ** Truncation
79− -- These are not the same as slicing the array at the beginning, they may
80− -- reduce the length as well as the capacity of the array.
81− -- , truncateWith
82− -- , truncate
83− -- , truncateExp
84−
85− -- * Eliminating and Reading
86−
87− -- ** Unfolds
88− , reader
89− -- , readerRev
90− , producerWith -- experimental
91− , producer -- experimental
92−
93− -- ** To containers
94− , toStreamD
95− -- , toStreamDRev
96− , toStreamK
97− -- , toStreamKRev
98− , toList
99−
100− -- ** Random reads
101− , getIndex
102− , getIndexUnsafe
103− -- , getIndices
104− -- , getFromThenTo
105− -- , getIndexRev
106−
107− -- * In-place Mutation Algorithms
108− -- , reverse
109− -- , permute
110− -- , partitionBy
111− -- , shuffleBy
112− -- , divideBy
113− -- , mergeBy
114−
115− -- * Folding
116− -- , foldl'
117− -- , foldr
118− -- , cmp
119−
120− -- * Arrays of arrays
121− -- We can add dimensionality parameter to the array type to get
122− -- multidimensional arrays. Multidimensional arrays would just be a
123− -- convenience wrapper on top of single dimensional arrays.
124−
125− -- | Operations dealing with multiple arrays, streams of arrays or
126− -- multidimensional array representations.
127−
128− -- ** Construct from streams
129− -- , arraysOf
130− -- , arrayStreamKFromStreamD
131− -- , writeChunks
132−
133− -- ** Eliminate to streams
134− -- , flattenArrays
135− -- , flattenArraysRev
136− -- , fromArrayStreamK
137−
138− -- ** Construct from arrays
139− -- get chunks without copying
140− , getSliceUnsafe
141− , getSlice
142− -- , getSlicesFromLenN
143− -- , splitAt -- XXX should be able to express using getSlice
144− -- , breakOn
145−
146− -- ** Appending arrays
147− -- , spliceCopy
148− -- , spliceWith
149− -- , splice
150− -- , spliceExp
151− , putSliceUnsafe
152− -- , appendSlice
153− -- , appendSliceFrom
154−
155− , clone
156− )
157−where
158−
159−#include "inline.hs"
160−#include "assert.hs"
161−
162−import Control.Monad.IO.Class (MonadIO(..))
163−import GHC.Base
164− ( MutableArray#
165− , RealWorld
166− , copyMutableArray#
167− , newArray#
168− , readArray#
169− , writeArray#
170− )
171−import GHC.IO (IO(..))
172−import GHC.Int (Int(..))
173−import Streamly.Internal.Data.Fold.Type (Fold(..))
174−import Streamly.Internal.Data.Producer.Type (Producer (..))
175−import Streamly.Internal.Data.Unfold.Type (Unfold(..))
176−
177−import qualified Streamly.Internal.Data.Fold.Type as FL
178−import qualified Streamly.Internal.Data.Producer as Producer
179−import qualified Streamly.Internal.Data.Stream.StreamD as D
180−import qualified Streamly.Internal.Data.Stream.StreamK as K
181−
182−import Prelude hiding (read)
183−
184−-- $setup
185−-- >>> :m
186−-- >>> import qualified Streamly.Internal.Data.Array.Generic.Mut.Type as Array
187−-- >>> import qualified Streamly.Internal.Data.Stream as Stream
188−-- >>> import qualified Streamly.Internal.Data.Stream.StreamD as StreamD
189−-- >>> import qualified Streamly.Internal.Data.Fold as Fold
190−-- >>> import qualified Streamly.Internal.Data.Fold.Type as Fold
191−
192−-------------------------------------------------------------------------------
193−-- Array Data Type
194−-------------------------------------------------------------------------------
195−
196−data Array a =
197− Array
198− { arrContents# :: MutableArray# RealWorld a
199− -- ^ The internal contents of the array representing the entire array.
200−
201− , arrStart :: {-# UNPACK #-}!Int
202− -- ^ The starting index of this slice.
203−
204− , arrLen :: {-# UNPACK #-}!Int
205− -- ^ The length of this slice.
206−
207− , arrTrueLen :: {-# UNPACK #-}!Int
208− -- ^ This is the true length of the array. Coincidentally, this also
209− -- represents the first index beyond the maximum acceptable index of
210− -- the array. This is specific to the array contents itself and not
211− -- dependent on the slice. This value should not change and is shared
212− -- across all the slices.
213− }
214−
215−{-# INLINE bottomElement #-}
216−bottomElement :: a
217−bottomElement =
218− error
219− $ unwords
220− [ funcName
221− , "This is the bottom element of the array."
222− , "This is a place holder and should never be reached!"
223− ]
224−
225− where
226−
227− funcName = "Streamly.Internal.Data.Array.Generic.Mut.Type.bottomElement:"
228−
229−-- XXX Would be nice if GHC can provide something like newUninitializedArray# so
230−-- that we do not have to write undefined or error in the whole array.
231−-- | @new count@ allocates an empty array that can hold 'count' items.
232−--
233−-- /Pre-release/
234−{-# INLINE new #-}
235−new :: forall m a. MonadIO m => Int -> m (Array a)
236−new n@(I# n#) =
237− liftIO
238− $ IO
239− $ \s# ->
240− case newArray# n# bottomElement s# of
241− (# s1#, arr# #) ->
242− let ma = Array arr# 0 0 n
243− in (# s1#, ma #)
244−
245−-------------------------------------------------------------------------------
246−-- Random writes
247−-------------------------------------------------------------------------------
248−
249−-- | Write the given element to the given index of the array. Does not check if
250−-- the index is out of bounds of the array.
251−--
252−-- /Pre-release/
253−{-# INLINE putIndexUnsafe #-}
254−putIndexUnsafe :: forall m a. MonadIO m => Int -> Array a -> a -> m ()
255−putIndexUnsafe i Array {..} x =
256− liftIO
257− $ IO
258− $ \s# ->
259− case i + arrStart of
260− I# n# ->
261− let s1# = writeArray# arrContents# n# x s#
262− in (# s1#, () #)
263−
264−invalidIndex :: String -> Int -> a
265−invalidIndex label i =
266− error $ label ++ ": invalid array index " ++ show i
267−
268−-- | /O(1)/ Write the given element at the given index in the array.
269−-- Performs in-place mutation of the array.
270−--
271−-- >>> putIndex ix arr val = Array.modifyIndex ix arr (const (val, ()))
272−--
273−-- /Pre-release/
274−{-# INLINE putIndex #-}
275−putIndex :: MonadIO m => Int -> Array a -> a -> m ()
276−putIndex i arr@Array {..} x =
277− if i >= 0 && i < arrLen
278− then putIndexUnsafe i arr x
279− else invalidIndex "putIndex" i
280−
281−-- | Modify a given index of an array using a modifier function without checking
282−-- the bounds.
283−--
284−-- Unsafe because it does not check the bounds of the array.
285−--
286−-- /Pre-release/
287−modifyIndexUnsafe :: MonadIO m => Int -> Array a -> (a -> (a, b)) -> m b
288−modifyIndexUnsafe i Array {..} f = do
289− liftIO
290− $ IO
291− $ \s# ->
292− case i + arrStart of
293− I# n# ->
294− case readArray# arrContents# n# s# of
295− (# s1#, a #) ->
296− let (a1, b) = f a
297− s2# = writeArray# arrContents# n# a1 s1#
298− in (# s2#, b #)
299−
300−-- | Modify a given index of an array using a modifier function.
301−--
302−-- /Pre-release/
303−modifyIndex :: MonadIO m => Int -> Array a -> (a -> (a, b)) -> m b
304−modifyIndex i arr@Array {..} f = do
305− if i >= 0 && i < arrLen
306− then modifyIndexUnsafe i arr f
307− else invalidIndex "modifyIndex" i
308−
309−-------------------------------------------------------------------------------
310−-- Resizing
311−-------------------------------------------------------------------------------
312−
313−-- | Reallocates the array according to the new size. This is a safe function
314−-- that always creates a new array and copies the old array into the new one. If
315−-- the reallocated size is less than the original array it results in a
316−-- truncated version of the original array.
317−--
318−realloc :: MonadIO m => Int -> Array a -> m (Array a)
319−realloc n arr = do
320− arr1 <- new n
321− let !newLen@(I# newLen#) = min n (arrLen arr)
322− !(I# arrS#) = arrStart arr
323− !(I# arr1S#) = arrStart arr1
324− arrC# = arrContents# arr
325− arr1C# = arrContents# arr1
326− liftIO
327− $ IO
328− $ \s# ->
329− let s1# = copyMutableArray# arrC# arrS# arr1C# arr1S# newLen# s#
330− in (# s1#, arr1 {arrLen = newLen, arrTrueLen = n} #)
331−
332−reallocWith ::
333− MonadIO m => String -> (Int -> Int) -> Int -> Array a -> m (Array a)
334−reallocWith label sizer reqSize arr = do
335− let oldSize = arrLen arr
336− newSize = sizer oldSize
337− safeSize = max newSize (oldSize + reqSize)
338− assert (newSize >= oldSize + reqSize || error badSize) (return ())
339− realloc safeSize arr
340−
341− where
342−
343− badSize = concat
344− [ label
345− , ": new array size is less than required size "
346− , show reqSize
347− , ". Please check the sizing function passed."
348− ]
349−
350−-------------------------------------------------------------------------------
351−-- Snoc
352−-------------------------------------------------------------------------------
353−
354−-- XXX Not sure of the behavior of writeArray# if we specify an index which is
355−-- out of bounds. This comment should be rewritten based on that.
356−-- | Really really unsafe, appends the element into the first array, may
357−-- cause silent data corruption or if you are lucky a segfault if the index
358−-- is out of bounds.
359−--
360−-- /Internal/
361−{-# INLINE snocUnsafe #-}
362−snocUnsafe :: MonadIO m => Array a -> a -> m (Array a)
363−snocUnsafe arr@Array {..} a = do
364− assert (arrStart + arrLen < arrTrueLen) (return ())
365− putIndexUnsafe arrLen arr a
366− return $ arr {arrLen = arrLen + 1}
367−
368−-- NOINLINE to move it out of the way and not pollute the instruction cache.
369−{-# NOINLINE snocWithRealloc #-}
370−snocWithRealloc :: MonadIO m => (Int -> Int) -> Array a -> a -> m (Array a)
371−snocWithRealloc sizer arr x = do
372− arr1 <- reallocWith "snocWithRealloc" sizer 1 arr
373− snocUnsafe arr1 x
374−
375−-- | @snocWith sizer arr elem@ mutates @arr@ to append @elem@. The length of
376−-- the array increases by 1.
377−--
378−-- If there is no reserved space available in @arr@ it is reallocated to a size
379−-- in bytes determined by the @sizer oldSize@ function, where @oldSize@ is the
380−-- original size of the array.
381−--
382−-- Note that the returned array may be a mutated version of the original array.
383−--
384−-- /Pre-release/
385−{-# INLINE snocWith #-}
386−snocWith :: MonadIO m => (Int -> Int) -> Array a -> a -> m (Array a)
387−snocWith sizer arr@Array {..} x = do
388− if arrStart + arrLen < arrTrueLen
389− then snocUnsafe arr x
390− else snocWithRealloc sizer arr x
391−
392−-- XXX round it to next power of 2.
393−--
394−-- | The array is mutated to append an additional element to it. If there is no
395−-- reserved space available in the array then it is reallocated to double the
396−-- original size.
397−--
398−-- This is useful to reduce allocations when appending unknown number of
399−-- elements.
400−--
401−-- Note that the returned array may be a mutated version of the original array.
402−--
403−-- >>> snoc = Array.snocWith (* 2)
404−--
405−-- Performs O(n * log n) copies to grow, but is liberal with memory allocation.
406−--
407−-- /Pre-release/
408−{-# INLINE snoc #-}
409−snoc :: MonadIO m => Array a -> a -> m (Array a)
410−snoc = snocWith (* 2)
411−
412−-------------------------------------------------------------------------------
413−-- Random reads
414−-------------------------------------------------------------------------------
415−
416−-- | Return the element at the specified index without checking the bounds.
417−--
418−-- Unsafe because it does not check the bounds of the array.
419−{-# INLINE_NORMAL getIndexUnsafe #-}
420−getIndexUnsafe :: MonadIO m => Int -> Array a -> m a
421−getIndexUnsafe n Array {..} =
422− liftIO
423− $ IO
424− $ \s# ->
425− let !(I# i#) = arrStart + n
426− in readArray# arrContents# i# s#
427−
428−-- | /O(1)/ Lookup the element at the given index. Index starts from 0.
429−--
430−{-# INLINE getIndex #-}
431−getIndex :: MonadIO m => Int -> Array a -> m a
432−getIndex i arr@Array {..} =
433− if i >= 0 && i < arrLen
434− then getIndexUnsafe i arr
435− else invalidIndex "getIndex" i
436−
437−-------------------------------------------------------------------------------
438−-- Subarrays
439−-------------------------------------------------------------------------------
440−
441−-- XXX We can also get immutable slices.
442−
443−-- | /O(1)/ Slice an array in constant time.
444−--
445−-- Unsafe: The bounds of the slice are not checked.
446−--
447−-- /Unsafe/
448−--
449−-- /Pre-release/
450−{-# INLINE getSliceUnsafe #-}
451−getSliceUnsafe
452− :: Int -- ^ from index
453− -> Int -- ^ length of the slice
454− -> Array a
455− -> Array a
456−getSliceUnsafe index len arr@Array {..} =
457− assert (index >= 0 && len >= 0 && index + len <= arrLen)
458− $ arr {arrStart = arrStart + index, arrLen = len}
459−
460−
461−-- | /O(1)/ Slice an array in constant time. Throws an error if the slice
462−-- extends out of the array bounds.
463−--
464−-- /Pre-release/
465−{-# INLINE getSlice #-}
466−getSlice
467− :: Int -- ^ from index
468− -> Int -- ^ length of the slice
469− -> Array a
470− -> Array a
471−getSlice index len arr@Array{..} =
472− if index >= 0 && len >= 0 && index + len <= arrLen
473− then arr {arrStart = arrStart + index, arrLen = len}
474− else error
475− $ "getSlice: invalid slice, index "
476− ++ show index ++ " length " ++ show len
477−
478−-------------------------------------------------------------------------------
479−-- to Lists and streams
480−-------------------------------------------------------------------------------
481−
482−-- | Convert an 'Array' into a list.
483−--
484−-- /Pre-release/
485−{-# INLINE toList #-}
486−toList :: MonadIO m => Array a -> m [a]
487−toList arr@Array{..} = mapM (`getIndexUnsafe` arr) [0 .. (arrLen - 1)]
488−
489−-- | Use the 'read' unfold instead.
490−--
491−-- @toStreamD = D.unfold read@
492−--
493−-- We can try this if the unfold has any performance issues.
494−{-# INLINE_NORMAL toStreamD #-}
495−toStreamD :: MonadIO m => Array a -> D.Stream m a
496−toStreamD arr@Array{..} =
497− D.mapM (`getIndexUnsafe` arr) $ D.enumerateFromToIntegral 0 (arrLen - 1)
498−
499−{-# INLINE toStreamK #-}
500−toStreamK :: MonadIO m => Array a -> K.Stream m a
501−toStreamK arr@Array{..} = K.unfoldrM step 0
502−
503− where
504−
505− step i
506− | i == arrLen = return Nothing
507− | otherwise = do
508− x <- getIndexUnsafe i arr
509− return $ Just (x, i + 1)
510−
511−
512−-------------------------------------------------------------------------------
513−-- Folds
514−-------------------------------------------------------------------------------
515−
516−-- | Like 'writeN' but does not check the array bounds when writing. The fold
517−-- driver must not call the step function more than 'n' times otherwise it will
518−-- corrupt the memory and crash. This function exists mainly because any
519−-- conditional in the step function blocks fusion causing 10x performance
520−-- slowdown.
521−--
522−-- /Pre-release/
523−{-# INLINE_NORMAL writeNUnsafe #-}
524−writeNUnsafe :: MonadIO m => Int -> Fold m a (Array a)
525−writeNUnsafe n = Fold step initial return
526−
527− where
528−
529− initial = FL.Partial <$> new (max n 0)
530−
531− step arr x = FL.Partial <$> snocUnsafe arr x
532−
533−-- | @writeN n@ folds a maximum of @n@ elements from the input stream to an
534−-- 'Array'.
535−--
536−-- >>> writeN n = Fold.take n (Array.writeNUnsafe n)
537−--
538−-- /Pre-release/
539−{-# INLINE_NORMAL writeN #-}
540−writeN :: MonadIO m => Int -> Fold m a (Array a)
541−writeN n = FL.take n $ writeNUnsafe n
542−
543−-------------------------------------------------------------------------------
544−-- Unfolds
545−-------------------------------------------------------------------------------
546−
547−-- | Resumable unfold of an array.
548−--
549−{-# INLINE_NORMAL producerWith #-}
550−producerWith :: Monad m => (forall b. IO b -> m b) -> Producer m (Array a) a
551−producerWith liftio = Producer step inject extract
552−
553− where
554−
555− {-# INLINE inject #-}
556− inject arr = return (arr, 0)
557−
558− {-# INLINE extract #-}
559− extract (arr, i) =
560− return $ arr {arrStart = arrStart arr + i, arrLen = arrLen arr - i}
561−
562− {-# INLINE_LATE step #-}
563− step (arr, i)
564− | assert (arrLen arr >= 0) (i == arrLen arr) = return D.Stop
565− step (arr, i) = do
566− x <- liftio $ getIndexUnsafe i arr
567− return $ D.Yield x (arr, i + 1)
568−
569−-- | Resumable unfold of an array.
570−--
571−{-# INLINE_NORMAL producer #-}
572−producer :: MonadIO m => Producer m (Array a) a
573−producer = producerWith liftIO
574−
575−-- | Unfold an array into a stream.
576−--
577−{-# INLINE_NORMAL reader #-}
578−reader :: MonadIO m => Unfold m (Array a) a
579−reader = Producer.simplify producer
580−
581−--------------------------------------------------------------------------------
582−-- Appending arrays
583−--------------------------------------------------------------------------------
584−
585−-- | Put a sub range of a source array into a subrange of a destination array.
586−-- This is not safe as it does not check the bounds.
587−{-# INLINE putSliceUnsafe #-}
588−putSliceUnsafe :: MonadIO m => Array a -> Int -> Array a -> Int -> Int -> m ()
589−putSliceUnsafe src srcStart dst dstStart len = liftIO $ do
590− assertM(len <= arrLen dst)
591− assertM(len <= arrLen src)
592− let !(I# srcStart#) = srcStart + arrStart src
593− !(I# dstStart#) = dstStart + arrStart dst
594− !(I# len#) = len
595− let arrS# = arrContents# src
596− arrD# = arrContents# dst
597− IO $ \s# -> (# copyMutableArray#
598− arrS# srcStart# arrD# dstStart# len# s#
599− , () #)
600−
601−{-# INLINE clone #-}
602−clone :: MonadIO m => Array a -> m (Array a)
603−clone src = liftIO $ do
604− let len = arrLen src
605− dst <- new len
606− putSliceUnsafe src 0 dst 0 len
607− return dst
core/src/Streamly/Internal/Data/Array/Mut.hsdeleted−103
@@ -1,103 +0,0 @@
1−#include "inline.hs"
2−
3−-- |
4−-- Module : Streamly.Internal.Data.Array.Mut
5−-- Copyright : (c) 2020 Composewell Technologies
6−-- License : BSD-3-Clause
7−-- Maintainer : streamly@composewell.com
8−-- Stability : experimental
9−-- Portability : GHC
10−--
11−-- Unboxed pinned mutable array type for 'Unboxed' types with an option to use
12−-- foreign (non-GHC) memory allocators. Fulfils the following goals:
13−--
14−-- * Random access (array)
15−-- * Efficient storage (unboxed)
16−-- * Performance (unboxed access)
17−-- * Performance - in-place operations (mutable)
18−-- * Performance - GC (pinned, mutable)
19−-- * interfacing with OS (pinned)
20−-- * Fragmentation control (foreign allocators)
21−--
22−-- Stream and Fold APIs allow easy, efficient and convenient operations on
23−-- arrays.
24−
25−module Streamly.Internal.Data.Array.Mut
26− (
27− module Streamly.Internal.Data.Array.Mut.Type
28− , splitOn
29− , genSlicesFromLen
30− , getSlicesFromLen
31− , fromStream
32− )
33−where
34−
35−import Control.Monad.IO.Class (MonadIO(..))
36−import Streamly.Internal.Data.Unboxed (Unbox)
37−import Streamly.Internal.Data.Stream (Stream)
38−import Streamly.Internal.Data.Unfold.Type (Unfold(..))
39−
40−import qualified Streamly.Internal.Data.Stream.StreamD as D
41−import qualified Streamly.Internal.Data.Stream.Type as Stream
42−import qualified Streamly.Internal.Data.Unfold as Unfold
43−-- import qualified Streamly.Internal.Data.Stream.Common as P
44−
45−import Prelude hiding (foldr, length, read, splitAt)
46−import Streamly.Internal.Data.Array.Mut.Type
47−
48−-- | Split the array into a stream of slices using a predicate. The element
49−-- matching the predicate is dropped.
50−--
51−-- /Pre-release/
52−{-# INLINE splitOn #-}
53−splitOn :: (MonadIO m, Unbox a) =>
54− (a -> Bool) -> Array a -> Stream m (Array a)
55−splitOn predicate arr =
56− Stream.fromStreamD
57− $ fmap (\(i, len) -> getSliceUnsafe i len arr)
58− $ D.sliceOnSuffix predicate (toStreamD arr)
59−
60−-- | Generate a stream of array slice descriptors ((index, len)) of specified
61−-- length from an array, starting from the supplied array index. The last slice
62−-- may be shorter than the requested length depending on the array length.
63−--
64−-- /Pre-release/
65−{-# INLINE genSlicesFromLen #-}
66−genSlicesFromLen :: forall m a. (Monad m, Unbox a)
67− => Int -- ^ from index
68− -> Int -- ^ length of the slice
69− -> Unfold m (Array a) (Int, Int)
70−genSlicesFromLen from len =
71− let fromThenTo n = (from, from + len, n - 1)
72− mkSlice n i = return (i, min len (n - i))
73− in Unfold.lmap length
74− $ Unfold.mapM2 mkSlice
75− $ Unfold.lmap fromThenTo Unfold.enumerateFromThenTo
76−
77−-- | Generate a stream of slices of specified length from an array, starting
78−-- from the supplied array index. The last slice may be shorter than the
79−-- requested length depending on the array length.
80−--
81−-- /Pre-release/
82−{-# INLINE getSlicesFromLen #-}
83−getSlicesFromLen :: forall m a. (Monad m, Unbox a)
84− => Int -- ^ from index
85− -> Int -- ^ length of the slice
86− -> Unfold m (Array a) (Array a)
87−getSlicesFromLen from len =
88− let mkSlice arr (i, n) = return $ getSliceUnsafe i n arr
89− in Unfold.mapM2 mkSlice (genSlicesFromLen from len)
90−
91−-- | Create an 'Array' from a stream. This is useful when we want to create a
92−-- single array from a stream of unknown size. 'writeN' is at least twice
93−-- as efficient when the size is already known.
94−--
95−-- Note that if the input stream is too large memory allocation for the array
96−-- may fail. When the stream size is not known, `arraysOf` followed by
97−-- processing of indvidual arrays in the resulting stream should be preferred.
98−--
99−-- /Pre-release/
100−{-# INLINE fromStream #-}
101−fromStream :: (MonadIO m, Unbox a) => Stream m a -> m (Array a)
102−fromStream = fromStreamD . Stream.toStreamD
103−-- fromStream (Stream m) = P.fold write m
core/src/Streamly/Internal/Data/Array/Mut/Stream.hsdeleted−326
@@ -1,326 +0,0 @@
1−-- |
2−-- Module : Streamly.Internal.Data.Array.Mut.Stream
3−-- Copyright : (c) 2019 Composewell Technologies
4−-- License : BSD3-3-Clause
5−-- Maintainer : streamly@composewell.com
6−-- Stability : experimental
7−-- Portability : GHC
8−--
9−-- Combinators to efficiently manipulate streams of mutable arrays.
10−--
11−module Streamly.Internal.Data.Array.Mut.Stream
12− (
13− -- * Generation
14− arraysOf
15−
16− -- * Compaction
17− , packArraysChunksOf
18− , SpliceState (..)
19− , lpackArraysChunksOf
20− , compact
21− , compactLE
22− , compactEQ
23− , compactGE
24− )
25−where
26−
27−#include "inline.hs"
28−#include "ArrayMacros.h"
29−
30−import Control.Monad.IO.Class (MonadIO(..))
31−import Control.Monad (when)
32−import Data.Bifunctor (first)
33−import Data.Proxy (Proxy(..))
34−import Streamly.Internal.Data.Unboxed (Unbox, sizeOf)
35−import Streamly.Internal.Data.Array.Mut.Type (Array(..))
36−import Streamly.Internal.Data.Fold.Type (Fold(..))
37−import Streamly.Internal.Data.Parser (ParseError)
38−import Streamly.Internal.Data.Stream.Type (Stream)
39−import Streamly.Internal.Data.Tuple.Strict (Tuple'(..))
40−
41−import qualified Streamly.Internal.Data.Array.Mut.Type as MArray
42−import qualified Streamly.Internal.Data.Fold.Type as FL
43−import qualified Streamly.Internal.Data.Stream.StreamD as D
44−import qualified Streamly.Internal.Data.Parser.ParserD as ParserD
45−import qualified Streamly.Internal.Data.Stream.Type as Stream
46−
47−-- | @arraysOf n stream@ groups the elements in the input stream into arrays of
48−-- @n@ elements each.
49−--
50−-- Same as the following but may be more efficient:
51−--
52−-- > arraysOf n = Stream.foldMany (MArray.writeN n)
53−--
54−-- /Pre-release/
55−{-# INLINE arraysOf #-}
56−arraysOf :: (MonadIO m, Unbox a)
57− => Int -> Stream m a -> Stream m (Array a)
58−arraysOf n = Stream.fromStreamD . MArray.arraysOf n . Stream.toStreamD
59−
60−-------------------------------------------------------------------------------
61−-- Compact
62−-------------------------------------------------------------------------------
63−
64−data SpliceState s arr
65− = SpliceInitial s
66− | SpliceBuffering s arr
67− | SpliceYielding arr (SpliceState s arr)
68− | SpliceFinish
69−
70−-- XXX This can be removed once compactLEFold/compactLE are implemented.
71−--
72−-- | This mutates the first array (if it has space) to append values from the
73−-- second one. This would work for immutable arrays as well because an
74−-- immutable array never has space so a new array is allocated instead of
75−-- mutating it.
76−--
77−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
78−-- maximum specified size. Note that if a single array is bigger than the
79−-- specified size we do not split it to fit. When we coalesce multiple arrays
80−-- if the size would exceed the specified size we do not coalesce therefore the
81−-- actual array size may be less than the specified chunk size.
82−--
83−-- @since 0.7.0
84−{-# INLINE_NORMAL packArraysChunksOf #-}
85−packArraysChunksOf :: (MonadIO m, Unbox a)
86− => Int -> D.Stream m (Array a) -> D.Stream m (Array a)
87−packArraysChunksOf n (D.Stream step state) =
88− D.Stream step' (SpliceInitial state)
89−
90− where
91−
92− {-# INLINE_LATE step' #-}
93− step' gst (SpliceInitial st) = do
94− when (n <= 0) $
95− -- XXX we can pass the module string from the higher level API
96− error $ "Streamly.Internal.Data.Array.Mut.Type.packArraysChunksOf: the size of "
97− ++ "arrays [" ++ show n ++ "] must be a natural number"
98− r <- step gst st
99− case r of
100− D.Yield arr s -> return $
101− let len = MArray.byteLength arr
102− in if len >= n
103− then D.Skip (SpliceYielding arr (SpliceInitial s))
104− else D.Skip (SpliceBuffering s arr)
105− D.Skip s -> return $ D.Skip (SpliceInitial s)
106− D.Stop -> return D.Stop
107−
108− step' gst (SpliceBuffering st buf) = do
109− r <- step gst st
110− case r of
111− D.Yield arr s -> do
112− let len = MArray.byteLength buf + MArray.byteLength arr
113− if len > n
114− then return $
115− D.Skip (SpliceYielding buf (SpliceBuffering s arr))
116− else do
117− buf' <- if MArray.byteCapacity buf < n
118− then liftIO $ MArray.realloc n buf
119− else return buf
120− buf'' <- MArray.splice buf' arr
121− return $ D.Skip (SpliceBuffering s buf'')
122− D.Skip s -> return $ D.Skip (SpliceBuffering s buf)
123− D.Stop -> return $ D.Skip (SpliceYielding buf SpliceFinish)
124−
125− step' _ SpliceFinish = return D.Stop
126−
127− step' _ (SpliceYielding arr next) = return $ D.Yield arr next
128−
129−-- XXX Remove this once compactLEFold is implemented
130−-- lpackArraysChunksOf = Fold.many compactLEFold
131−--
132−{-# INLINE_NORMAL lpackArraysChunksOf #-}
133−lpackArraysChunksOf :: (MonadIO m, Unbox a)
134− => Int -> Fold m (Array a) () -> Fold m (Array a) ()
135−lpackArraysChunksOf n (Fold step1 initial1 extract1) =
136− Fold step initial extract
137−
138− where
139−
140− initial = do
141− when (n <= 0) $
142− -- XXX we can pass the module string from the higher level API
143− error $ "Streamly.Internal.Data.Array.Mut.Type.packArraysChunksOf: the size of "
144− ++ "arrays [" ++ show n ++ "] must be a natural number"
145−
146− r <- initial1
147− return $ first (Tuple' Nothing) r
148−
149− extract (Tuple' Nothing r1) = extract1 r1
150− extract (Tuple' (Just buf) r1) = do
151− r <- step1 r1 buf
152− case r of
153− FL.Partial rr -> extract1 rr
154− FL.Done _ -> return ()
155−
156− step (Tuple' Nothing r1) arr =
157− let len = MArray.byteLength arr
158− in if len >= n
159− then do
160− r <- step1 r1 arr
161− case r of
162− FL.Done _ -> return $ FL.Done ()
163− FL.Partial s -> do
164− extract1 s
165− res <- initial1
166− return $ first (Tuple' Nothing) res
167− else return $ FL.Partial $ Tuple' (Just arr) r1
168−
169− step (Tuple' (Just buf) r1) arr = do
170− let len = MArray.byteLength buf + MArray.byteLength arr
171− buf' <- if MArray.byteCapacity buf < len
172− then liftIO $ MArray.realloc (max n len) buf
173− else return buf
174− buf'' <- MArray.splice buf' arr
175−
176− -- XXX this is common in both the equations of step
177− if len >= n
178− then do
179− r <- step1 r1 buf''
180− case r of
181− FL.Done _ -> return $ FL.Done ()
182− FL.Partial s -> do
183− extract1 s
184− res <- initial1
185− return $ first (Tuple' Nothing) res
186− else return $ FL.Partial $ Tuple' (Just buf'') r1
187−
188−-- XXX Same as compactLE, to be removed once that is implemented.
189−--
190−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
191−-- maximum specified size in bytes.
192−--
193−-- /Internal/
194−{-# INLINE compact #-}
195−compact :: (MonadIO m, Unbox a)
196− => Int -> Stream m (Array a) -> Stream m (Array a)
197−compact n = Stream.fromStreamD . packArraysChunksOf n . Stream.toStreamD
198−
199−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
200−-- maximum specified size. Note that if a single array is bigger than the
201−-- specified size we do not split it to fit. When we coalesce multiple arrays
202−-- if the size would exceed the specified size we do not coalesce therefore the
203−-- actual array size may be less than the specified chunk size.
204−--
205−-- /Internal/
206−{-# INLINE_NORMAL compactLEParserD #-}
207−compactLEParserD ::
208− forall m a. (MonadIO m, Unbox a)
209− => Int -> ParserD.Parser (Array a) m (Array a)
210−compactLEParserD n = ParserD.Parser step initial extract
211−
212− where
213−
214− nBytes = n * SIZE_OF(a)
215−
216− initial =
217− return
218− $ if n <= 0
219− then error
220− $ functionPath
221− ++ ": the size of arrays ["
222− ++ show n ++ "] must be a natural number"
223− else ParserD.IPartial Nothing
224−
225− step Nothing arr =
226− return
227− $ let len = MArray.byteLength arr
228− in if len >= nBytes
229− then ParserD.Done 0 arr
230− else ParserD.Partial 0 (Just arr)
231− step (Just buf) arr =
232− let len = MArray.byteLength buf + MArray.byteLength arr
233− in if len > nBytes
234− then return $ ParserD.Done 1 buf
235− else do
236− buf1 <-
237− if MArray.byteCapacity buf < nBytes
238− then liftIO $ MArray.realloc nBytes buf
239− else return buf
240− buf2 <- MArray.splice buf1 arr
241− return $ ParserD.Partial 0 (Just buf2)
242−
243− extract Nothing = return $ ParserD.Done 0 MArray.nil
244− extract (Just buf) = return $ ParserD.Done 0 buf
245−
246− functionPath =
247− "Streamly.Internal.Data.Array.Mut.Stream.compactLEParserD"
248−
249−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
250−-- minimum specified size. Note that if all the arrays in the stream together
251−-- are smaller than the specified size the resulting array will be smaller than
252−-- the specified size. When we coalesce multiple arrays if the size would exceed
253−-- the specified size we stop coalescing further.
254−--
255−-- /Internal/
256−{-# INLINE_NORMAL compactGEFold #-}
257−compactGEFold ::
258− forall m a. (MonadIO m, Unbox a)
259− => Int -> FL.Fold m (Array a) (Array a)
260−compactGEFold n = Fold step initial extract
261−
262− where
263−
264− nBytes = n * SIZE_OF(a)
265−
266− initial =
267− return
268− $ if n < 0
269− then error
270− $ functionPath
271− ++ ": the size of arrays ["
272− ++ show n ++ "] must be a natural number"
273− else FL.Partial Nothing
274−
275− step Nothing arr =
276− return
277− $ let len = MArray.byteLength arr
278− in if len >= nBytes
279− then FL.Done arr
280− else FL.Partial (Just arr)
281− step (Just buf) arr = do
282− let len = MArray.byteLength buf + MArray.byteLength arr
283− buf1 <-
284− if MArray.byteCapacity buf < len
285− then liftIO $ MArray.realloc (max len nBytes) buf
286− else return buf
287− buf2 <- MArray.splice buf1 arr
288− if len >= n
289− then return $ FL.Done buf2
290− else return $ FL.Partial (Just buf2)
291−
292− extract Nothing = return MArray.nil
293− extract (Just buf) = return buf
294−
295− functionPath =
296− "Streamly.Internal.Data.Array.Mut.Stream.compactGEFold"
297−
298−-- | Coalesce adjacent arrays in incoming stream to form bigger arrays of a
299−-- maximum specified size in bytes.
300−--
301−-- /Internal/
302−compactLE :: (Monad m, MonadIO m, Unbox a) =>
303− Int -> Stream m (Array a) -> Stream m (Either ParseError (Array a))
304−compactLE n =
305− Stream.fromStreamD . D.parseMany (compactLEParserD n) . Stream.toStreamD
306−
307−-- | Like 'compactLE' but generates arrays of exactly equal to the size
308−-- specified except for the last array in the stream which could be shorter.
309−--
310−-- /Unimplemented/
311−{-# INLINE compactEQ #-}
312−compactEQ :: -- (MonadIO m, Unbox a) =>
313− Int -> Stream m (Array a) -> Stream m (Array a)
314−compactEQ _n _xs = undefined
315− -- IsStream.fromStreamD $ D.foldMany (compactEQFold n) (IsStream.toStreamD xs)
316−
317−-- | Like 'compactLE' but generates arrays of size greater than or equal to the
318−-- specified except for the last array in the stream which could be shorter.
319−--
320−-- /Internal/
321−{-# INLINE compactGE #-}
322−compactGE ::
323− (MonadIO m, Unbox a)
324− => Int -> Stream m (Array a) -> Stream m (Array a)
325−compactGE n =
326− Stream.fromStreamD . D.foldMany (compactGEFold n) . Stream.toStreamD
core/src/Streamly/Internal/Data/Array/Mut/Type.hsdeleted−2351
@@ -1,2351 +0,0 @@
1−{-# LANGUAGE UnboxedTuples #-}
2−-- |
3−-- Module : Streamly.Internal.Data.Array.Mut.Type
4−-- Copyright : (c) 2020 Composewell Technologies
5−-- License : BSD3-3-Clause
6−-- Maintainer : streamly@composewell.com
7−-- Stability : experimental
8−-- Portability : GHC
9−--
10−-- Mutable arrays and file system files are quite similar, they can grow and
11−-- their content is mutable. Therefore, both have similar APIs as well. We
12−-- strive to keep the API consistent for both. Ideally, you should be able to
13−-- replace one with another with little changes to the code.
14−
15−module Streamly.Internal.Data.Array.Mut.Type
16− (
17− -- * Type
18− -- $arrayNotes
19− Array (..)
20− , MutableByteArray
21− , touch
22− , pin
23− , unpin
24−
25− -- * Constructing and Writing
26− -- ** Construction
27− , nil
28−
29− -- *** Uninitialized Arrays
30− , newPinned
31− , newPinnedBytes
32− , newAlignedPinned
33− , new
34− , newArrayWith
35−
36− -- *** Initialized Arrays
37− , withNewArrayUnsafe
38−
39− -- *** From streams
40− , ArrayUnsafe (..)
41− , writeNWithUnsafe
42− , writeNWith
43− , writeNUnsafe
44− , writeN
45− , writeNAligned
46−
47− , writeWith
48− , write
49−
50− , writeRevN
51− -- , writeRev
52−
53− -- ** From containers
54− , fromListN
55− , fromList
56− , fromListRevN
57− , fromListRev
58− , fromStreamDN
59− , fromStreamD
60−
61− -- * Random writes
62− , putIndex
63− , putIndexUnsafe
64− , putIndices
65− -- , putFromThenTo
66− -- , putFrom -- start writing at the given position
67− -- , putUpto -- write from beginning up to the given position
68− -- , putFromTo
69− -- , putFromRev
70− -- , putUptoRev
71− , modifyIndexUnsafe
72− , modifyIndex
73− , modifyIndices
74− , modify
75− , swapIndices
76− , unsafeSwapIndices
77−
78− -- * Growing and Shrinking
79− -- Arrays grow only at the end, though it is possible to grow on both sides
80− -- and therefore have a cons as well as snoc. But that will require two
81− -- bounds in the array representation.
82−
83− -- ** Appending elements
84− , snocWith
85− , snoc
86− , snocLinear
87− , snocMay
88− , snocUnsafe
89−
90− -- ** Appending streams
91− , writeAppendNUnsafe
92− , writeAppendN
93− , writeAppendWith
94− , writeAppend
95−
96− -- * Eliminating and Reading
97−
98− -- ** To streams
99− , reader
100− , readerRevWith
101− , readerRev
102−
103− -- ** To containers
104− , toStreamDWith
105− , toStreamDRevWith
106− , toStreamKWith
107− , toStreamKRevWith
108− , toStreamD
109− , toStreamDRev
110− , toStreamK
111− , toStreamKRev
112− , toList
113−
114− -- experimental
115− , producerWith
116− , producer
117−
118− -- ** Random reads
119− , getIndex
120− , getIndexUnsafe
121− , getIndices
122− , getIndicesD
123− -- , getFromThenTo
124− , getIndexRev
125−
126− -- * Memory Management
127− , blockSize
128− , arrayChunkBytes
129− , allocBytesToElemCount
130− , realloc
131− , resize
132− , resizeExp
133− , rightSize
134−
135− -- * Size
136− , length
137− , byteLength
138− -- , capacity
139− , byteCapacity
140− , bytesFree
141−
142− -- * In-place Mutation Algorithms
143− , strip
144− , reverse
145− , permute
146− , partitionBy
147− , shuffleBy
148− , divideBy
149− , mergeBy
150− , bubble
151−
152− -- * Casting
153− , cast
154− , castUnsafe
155− , asBytes
156− , asPtrUnsafe
157−
158− -- * Folding
159− , foldl'
160− , foldr
161− , cmp
162−
163− -- * Arrays of arrays
164− -- We can add dimensionality parameter to the array type to get
165− -- multidimensional arrays. Multidimensional arrays would just be a
166− -- convenience wrapper on top of single dimensional arrays.
167−
168− -- | Operations dealing with multiple arrays, streams of arrays or
169− -- multidimensional array representations.
170−
171− -- ** Construct from streams
172− , arraysOf
173− , arrayStreamKFromStreamD
174− , writeChunks
175−
176− -- ** Eliminate to streams
177− , flattenArrays
178− , flattenArraysRev
179− , fromArrayStreamK
180−
181− -- ** Construct from arrays
182− -- get chunks without copying
183− , getSliceUnsafe
184− , getSlice
185− -- , getSlicesFromLenN
186− , splitAt -- XXX should be able to express using getSlice
187− , breakOn
188−
189− -- ** Appending arrays
190− , spliceCopy
191− , spliceWith
192− , splice
193− , spliceExp
194− , spliceUnsafe
195− , putSliceUnsafe
196− -- , putSlice
197− -- , appendSlice
198− -- , appendSliceFrom
199−
200− -- * Utilities
201− , roundUpToPower2
202− , memcpy
203− , memcmp
204− , c_memchr
205− )
206−where
207−
208−-- Notes:
209−-- When we use a purely lazy Monad like Identity, we need to force ordering of
210−-- some actions for correctness.
211−
212−#include "assert.hs"
213−#include "inline.hs"
214−#include "ArrayMacros.h"
215−#include "MachDeps.h"
216−
217−import Control.Monad (when, void)
218−import Control.Monad.IO.Class (MonadIO(..))
219−import Data.Bits (shiftR, (.|.), (.&.))
220−import Data.Proxy (Proxy(..))
221−import Data.Word (Word8)
222−import Foreign.C.Types (CSize(..), CInt(..))
223−import Foreign.Ptr (plusPtr, minusPtr, nullPtr)
224−import Streamly.Internal.Data.Unboxed
225− ( MutableByteArray(..)
226− , Unbox
227− , getMutableByteArray#
228− , peekWith
229− , pokeWith
230− , sizeOf
231− , touch
232− )
233−import GHC.Base
234− ( IO(..)
235− , Int(..)
236− , byteArrayContents#
237− , compareByteArrays#
238− , copyMutableByteArray#
239− )
240−import GHC.Base (noinline)
241−import GHC.Exts (unsafeCoerce#)
242−import GHC.Ptr (Ptr(..))
243−
244−import Streamly.Internal.Data.Fold.Type (Fold(..))
245−import Streamly.Internal.Data.Producer.Type (Producer (..))
246−import Streamly.Internal.Data.Stream.Type (Stream)
247−import Streamly.Internal.Data.SVar.Type (adaptState, defState)
248−import Streamly.Internal.Data.Unfold.Type (Unfold(..))
249−import Streamly.Internal.System.IO (arrayPayloadSize, defaultChunkSize)
250−
251−import qualified Streamly.Internal.Data.Fold.Type as FL
252−import qualified Streamly.Internal.Data.Producer as Producer
253−import qualified Streamly.Internal.Data.Stream.StreamD.Type as D
254−import qualified Streamly.Internal.Data.Stream.StreamK.Type as K
255−import qualified Streamly.Internal.Data.Stream.Type as Stream
256−import qualified Streamly.Internal.Data.Unboxed as Unboxed
257−import qualified Prelude
258−
259−import Prelude hiding
260− (length, foldr, read, unlines, splitAt, reverse, truncate)
261−
262−-- $setup
263−-- >>> :m
264−-- >>> import qualified Streamly.Internal.Data.Array.Mut.Type as Array
265−-- >>> import qualified Streamly.Internal.Data.Stream as Stream
266−-- >>> import qualified Streamly.Internal.Data.Stream.StreamD as StreamD
267−-- >>> import qualified Streamly.Internal.Data.Fold as Fold
268−-- >>> import qualified Streamly.Internal.Data.Fold.Type as Fold
269−
270−-------------------------------------------------------------------------------
271−-- Foreign helpers
272−-------------------------------------------------------------------------------
273−
274−foreign import ccall unsafe "string.h memcpy" c_memcpy
275− :: Ptr Word8 -> Ptr Word8 -> CSize -> IO (Ptr Word8)
276−
277−foreign import ccall unsafe "string.h memchr" c_memchr
278− :: Ptr Word8 -> Word8 -> CSize -> IO (Ptr Word8)
279−
280−foreign import ccall unsafe "string.h memcmp" c_memcmp
281− :: Ptr Word8 -> Ptr Word8 -> CSize -> IO CInt
282−
283−-- | Given an 'Unboxed' type (unused first arg) and a number of bytes, return
284−-- how many elements of that type will completely fit in those bytes.
285−--
286−{-# INLINE bytesToElemCount #-}
287−bytesToElemCount :: forall a. Unbox a => a -> Int -> Int
288−bytesToElemCount _ n = n `div` SIZE_OF(a)
289−
290−-- XXX we are converting Int to CSize
291−memcpy :: Ptr Word8 -> Ptr Word8 -> Int -> IO ()
292−memcpy dst src len = void (c_memcpy dst src (fromIntegral len))
293−
294−-- XXX we are converting Int to CSize
295−-- return True if the memory locations have identical contents
296−{-# INLINE memcmp #-}
297−memcmp :: Ptr Word8 -> Ptr Word8 -> Int -> IO Bool
298−memcmp p1 p2 len = do
299− r <- c_memcmp p1 p2 (fromIntegral len)
300− return $ r == 0
301−
302−-------------------------------------------------------------------------------
303−-- Array Data Type
304−-------------------------------------------------------------------------------
305−
306−-- $arrayNotes
307−--
308−-- We can use an 'Unboxed' constraint in the Array type and the constraint can
309−-- be automatically provided to a function that pattern matches on the Array
310−-- type. However, it has huge performance cost, so we do not use it.
311−-- Investigate a GHC improvement possiblity.
312−
313−-- XXX Rename the fields to better names.
314−
315−-- | An unboxed, pinned mutable array. An array is created with a given length
316−-- and capacity. Length is the number of valid elements in the array. Capacity
317−-- is the maximum number of elements that the array can be expanded to without
318−-- having to reallocate the memory.
319−--
320−-- The elements in the array can be mutated in-place without changing the
321−-- reference (constructor). However, the length of the array cannot be mutated
322−-- in-place. A new array reference is generated when the length changes. When
323−-- the length is increased (upto the maximum reserved capacity of the array),
324−-- the array is not reallocated and the new reference uses the same underlying
325−-- memory as the old one.
326−--
327−-- Several routines in this module allow the programmer to control the capacity
328−-- of the array. The programmer can control the trade-off between memory usage
329−-- and performance impact due to reallocations when growing or shrinking the
330−-- array.
331−--
332−data Array a =
333−#ifdef DEVBUILD
334− Unbox a =>
335−#endif
336− -- The array is a range into arrContents. arrContents may be a superset of
337− -- the slice represented by the array. All offsets are in bytes.
338− Array
339− { arrContents :: {-# UNPACK #-} !MutableByteArray
340− , arrStart :: {-# UNPACK #-} !Int -- ^ index into arrContents
341− , arrEnd :: {-# UNPACK #-} !Int -- ^ index into arrContents
342− -- Represents the first invalid index of
343− -- the array.
344− , arrBound :: {-# UNPACK #-} !Int -- ^ first invalid index of arrContents.
345− }
346−
347−-------------------------------------------------------------------------------
348−-- Pinning & Unpinning
349−-------------------------------------------------------------------------------
350−
351−{-# INLINE pin #-}
352−pin :: Array a -> IO (Array a)
353−pin arr@Array{..} = do
354− contents <- Unboxed.pin arrContents
355− return $ arr {arrContents = contents}
356−
357−{-# INLINE unpin #-}
358−unpin :: Array a -> IO (Array a)
359−unpin arr@Array{..} = do
360− contents <- Unboxed.unpin arrContents
361− return $ arr {arrContents = contents}
362−
363−-------------------------------------------------------------------------------
364−-- Construction
365−-------------------------------------------------------------------------------
366−
367−-- XXX Change the names to use "new" instead of "newArray". That way we can use
368−-- the same names for managed file system objects as well. For unmanaged ones
369−-- we can use open/create etc as usual.
370−--
371−-- A new array is similar to "touch" creating a zero length file. An mmapped
372−-- array would be similar to a sparse file with holes. TBD: support mmapped
373−-- files and arrays.
374−
375−-- GHC always guarantees word-aligned memory, alignment is important only when
376−-- we need more than that. See stg_newAlignedPinnedByteArrayzh and
377−-- allocatePinned in GHC source.
378−
379−-- | @newArrayWith allocator alignment count@ allocates a new array of zero
380−-- length and with a capacity to hold @count@ elements, using @allocator
381−-- size alignment@ as the memory allocator function.
382−--
383−-- Alignment must be greater than or equal to machine word size and a power of
384−-- 2.
385−--
386−-- Alignment is ignored if the allocator allocates unpinned memory.
387−--
388−-- /Pre-release/
389−{-# INLINE newArrayWith #-}
390−newArrayWith :: forall m a. (MonadIO m, Unbox a)
391− => (Int -> Int -> m MutableByteArray) -> Int -> Int -> m (Array a)
392−newArrayWith alloc alignSize count = do
393− let size = max (count * SIZE_OF(a)) 0
394− contents <- alloc size alignSize
395− return $ Array
396− { arrContents = contents
397− , arrStart = 0
398− , arrEnd = 0
399− , arrBound = size
400− }
401−
402−nil ::
403−#ifdef DEVBUILD
404− Unbox a =>
405−#endif
406− Array a
407−nil = Array Unboxed.nil 0 0 0
408−
409−
410−-- | Allocates a pinned empty array that can hold 'count' items. The memory of
411−-- the array is uninitialized and the allocation is aligned as per the
412−-- 'Unboxed' instance of the type.
413−--
414−-- /Pre-release/
415−{-# INLINE newPinnedBytes #-}
416−newPinnedBytes :: MonadIO m =>
417−#ifdef DEVBUILD
418− Unbox a =>
419−#endif
420− Int -> m (Array a)
421−newPinnedBytes bytes = do
422− contents <- liftIO $ Unboxed.newPinnedBytes bytes
423− return $ Array
424− { arrContents = contents
425− , arrStart = 0
426− , arrEnd = 0
427− , arrBound = bytes
428− }
429−
430−-- | Like 'newArrayWith' but using an allocator is a pinned memory allocator and
431−-- the alignment is dictated by the 'Unboxed' instance of the type.
432−--
433−-- /Internal/
434−{-# INLINE newAlignedPinned #-}
435−newAlignedPinned :: (MonadIO m, Unbox a) => Int -> Int -> m (Array a)
436−newAlignedPinned =
437− newArrayWith (\s a -> liftIO $ Unboxed.newAlignedPinnedBytes s a)
438−
439−-- XXX can unaligned allocation be more efficient when alignment is not needed?
440−--
441−-- | Allocates an empty pinned array that can hold 'count' items. The memory of
442−-- the array is uninitialized and the allocation is aligned as per the 'Unboxed'
443−-- instance of the type.
444−--
445−{-# INLINE newPinned #-}
446−newPinned :: forall m a. (MonadIO m, Unbox a) => Int -> m (Array a)
447−newPinned =
448− newArrayWith
449− (\s _ -> liftIO $ Unboxed.newPinnedBytes s)
450− (error "newPinned: alignSize is not used")
451−
452−-- | Allocates an empty unpinned array that can hold 'count' items. The memory
453−-- of the array is uninitialized.
454−--
455−{-# INLINE new #-}
456−new :: (MonadIO m, Unbox a) => Int -> m (Array a)
457−new =
458− newArrayWith
459− (\s _ -> liftIO $ Unboxed.newUnpinnedBytes s)
460− (error "new: alignment is not used in unpinned arrays.")
461−
462−-- | Allocate an Array of the given size and run an IO action passing the array
463−-- start pointer.
464−--
465−-- /Internal/
466−{-# INLINE withNewArrayUnsafe #-}
467−withNewArrayUnsafe ::
468− (MonadIO m, Unbox a) => Int -> (Ptr a -> m ()) -> m (Array a)
469−withNewArrayUnsafe count f = do
470− arr <- newPinned count
471− asPtrUnsafe arr
472− $ \p -> f p >> return arr
473−
474−-------------------------------------------------------------------------------
475−-- Random writes
476−-------------------------------------------------------------------------------
477−
478−-- | Write the given element to the given index of the array. Does not check if
479−-- the index is out of bounds of the array.
480−--
481−-- /Pre-release/
482−{-# INLINE putIndexUnsafe #-}
483−putIndexUnsafe :: forall m a. (MonadIO m, Unbox a)
484− => Int -> Array a -> a -> m ()
485−putIndexUnsafe i Array{..} x = do
486− let index = INDEX_OF(arrStart, i, a)
487− assert (i >= 0 && INDEX_VALID(index, arrEnd, a)) (return ())
488− liftIO $ pokeWith arrContents index x
489−
490−invalidIndex :: String -> Int -> a
491−invalidIndex label i =
492− error $ label ++ ": invalid array index " ++ show i
493−
494−-- | /O(1)/ Write the given element at the given index in the array.
495−-- Performs in-place mutation of the array.
496−--
497−-- >>> putIndex ix arr val = Array.modifyIndex ix arr (const (val, ()))
498−-- >>> f = Array.putIndices
499−-- >>> putIndex ix arr val = Stream.fold (f arr) (Stream.fromPure (ix, val))
500−--
501−{-# INLINE putIndex #-}
502−putIndex :: forall m a. (MonadIO m, Unbox a) => Int -> Array a -> a -> m ()
503−putIndex i Array{..} x = do
504− let index = INDEX_OF(arrStart,i,a)
505− if i >= 0 && INDEX_VALID(index,arrEnd,a)
506− then liftIO $ pokeWith arrContents index x
507− else invalidIndex "putIndex" i
508−
509−-- | Write an input stream of (index, value) pairs to an array. Throws an
510−-- error if any index is out of bounds.
511−--
512−-- /Pre-release/
513−{-# INLINE putIndices #-}
514−putIndices :: forall m a. (MonadIO m, Unbox a)
515− => Array a -> Fold m (Int, a) ()
516−putIndices arr = FL.foldlM' step (return ())
517−
518− where
519−
520− step () (i, x) = liftIO (putIndex i arr x)
521−
522−-- | Modify a given index of an array using a modifier function.
523−--
524−-- /Pre-release/
525−modifyIndexUnsafe :: forall m a b. (MonadIO m, Unbox a) =>
526− Int -> Array a -> (a -> (a, b)) -> m b
527−modifyIndexUnsafe i Array{..} f = liftIO $ do
528− let index = INDEX_OF(arrStart,i,a)
529− assert (i >= 0 && INDEX_NEXT(index,a) <= arrEnd) (return ())
530− r <- peekWith arrContents index
531− let (x, res) = f r
532− pokeWith arrContents index x
533− return res
534−
535−-- | Modify a given index of an array using a modifier function.
536−--
537−-- /Pre-release/
538−modifyIndex :: forall m a b. (MonadIO m, Unbox a) =>
539− Int -> Array a -> (a -> (a, b)) -> m b
540−modifyIndex i Array{..} f = do
541− let index = INDEX_OF(arrStart,i,a)
542− if i >= 0 && INDEX_VALID(index,arrEnd,a)
543− then liftIO $ do
544− r <- peekWith arrContents index
545− let (x, res) = f r
546− pokeWith arrContents index x
547− return res
548− else invalidIndex "modifyIndex" i
549−
550−
551−-- | Modify the array indices generated by the supplied stream.
552−--
553−-- /Pre-release/
554−{-# INLINE modifyIndices #-}
555−modifyIndices :: forall m a . (MonadIO m, Unbox a)
556− => Array a -> (Int -> a -> a) -> Fold m Int ()
557−modifyIndices arr f = FL.foldlM' step initial
558−
559− where
560−
561− initial = return ()
562−
563− step () i =
564− let f1 x = (f i x, ())
565− in modifyIndex i arr f1
566−
567−-- | Modify each element of an array using the supplied modifier function.
568−--
569−-- /Pre-release/
570−modify :: forall m a. (MonadIO m, Unbox a)
571− => Array a -> (a -> a) -> m ()
572−modify Array{..} f = liftIO $
573− go arrStart
574−
575− where
576−
577− go i =
578− when (INDEX_VALID(i,arrEnd,a)) $ do
579− r <- peekWith arrContents i
580− pokeWith arrContents i (f r)
581− go (INDEX_NEXT(i,a))
582−
583−-- XXX We could specify the number of bytes to swap instead of Proxy. Need
584−-- to ensure that the memory does not overlap.
585−{-# INLINE swapArrayByteIndices #-}
586−swapArrayByteIndices ::
587− forall a. Unbox a
588− => Proxy a
589− -> MutableByteArray
590− -> Int
591− -> Int
592− -> IO ()
593−swapArrayByteIndices _ arrContents i1 i2 = do
594− r1 <- peekWith arrContents i1
595− r2 <- peekWith arrContents i2
596− pokeWith arrContents i1 (r2 :: a)
597− pokeWith arrContents i2 (r1 :: a)
598−
599−-- | Swap the elements at two indices without validating the indices.
600−--
601−-- /Unsafe/: This could result in memory corruption if indices are not valid.
602−--
603−-- /Pre-release/
604−{-# INLINE unsafeSwapIndices #-}
605−unsafeSwapIndices :: forall m a. (MonadIO m, Unbox a)
606− => Int -> Int -> Array a -> m ()
607−unsafeSwapIndices i1 i2 Array{..} = liftIO $ do
608− let t1 = INDEX_OF(arrStart,i1,a)
609− t2 = INDEX_OF(arrStart,i2,a)
610− swapArrayByteIndices (Proxy :: Proxy a) arrContents t1 t2
611−
612−-- | Swap the elements at two indices.
613−--
614−-- /Pre-release/
615−swapIndices :: forall m a. (MonadIO m, Unbox a)
616− => Int -> Int -> Array a -> m ()
617−swapIndices i1 i2 Array{..} = liftIO $ do
618− let t1 = INDEX_OF(arrStart,i1,a)
619− t2 = INDEX_OF(arrStart,i2,a)
620− when (i1 < 0 || INDEX_INVALID(t1,arrEnd,a))
621− $ invalidIndex "swapIndices" i1
622− when (i2 < 0 || INDEX_INVALID(t2,arrEnd,a))
623− $ invalidIndex "swapIndices" i2
624− swapArrayByteIndices (Proxy :: Proxy a) arrContents t1 t2
625−
626−-------------------------------------------------------------------------------
627−-- Rounding
628−-------------------------------------------------------------------------------
629−
630−-- XXX Should we use bitshifts in calculations or it gets optimized by the
631−-- compiler/processor itself?
632−--
633−-- | The page or block size used by the GHC allocator. Allocator allocates at
634−-- least a block and then allocates smaller allocations from within a block.
635−blockSize :: Int
636−blockSize = 4 * 1024
637−
638−-- | Allocations larger than 'largeObjectThreshold' are in multiples of block
639−-- size and are always pinned. The space beyond the end of a large object up to
640−-- the end of the block is unused.
641−largeObjectThreshold :: Int
642−largeObjectThreshold = (blockSize * 8) `div` 10
643−
644−-- XXX Should be done only when we are using the GHC allocator.
645−-- | Round up an array larger than 'largeObjectThreshold' to use the whole
646−-- block.
647−{-# INLINE roundUpLargeArray #-}
648−roundUpLargeArray :: Int -> Int
649−roundUpLargeArray size =
650− if size >= largeObjectThreshold
651− then
652− assert
653− (blockSize /= 0 && ((blockSize .&. (blockSize - 1)) == 0))
654− ((size + blockSize - 1) .&. negate blockSize)
655− else size
656−
657−{-# INLINE isPower2 #-}
658−isPower2 :: Int -> Bool
659−isPower2 n = n .&. (n - 1) == 0
660−
661−{-# INLINE roundUpToPower2 #-}
662−roundUpToPower2 :: Int -> Int
663−roundUpToPower2 n =
664−#if WORD_SIZE_IN_BITS == 64
665− 1 + z6
666−#else
667− 1 + z5
668−#endif
669−
670− where
671−
672− z0 = n - 1
673− z1 = z0 .|. z0 `shiftR` 1
674− z2 = z1 .|. z1 `shiftR` 2
675− z3 = z2 .|. z2 `shiftR` 4
676− z4 = z3 .|. z3 `shiftR` 8
677− z5 = z4 .|. z4 `shiftR` 16
678− z6 = z5 .|. z5 `shiftR` 32
679−
680−-- | @allocBytesToBytes elem allocatedBytes@ returns the array size in bytes
681−-- such that the real allocation is less than or equal to @allocatedBytes@,
682−-- unless @allocatedBytes@ is less than the size of one array element in which
683−-- case it returns one element's size.
684−--
685−{-# INLINE allocBytesToBytes #-}
686−allocBytesToBytes :: forall a. Unbox a => a -> Int -> Int
687−allocBytesToBytes _ n = max (arrayPayloadSize n) (SIZE_OF(a))
688−
689−-- | Given an 'Unboxed' type (unused first arg) and real allocation size
690−-- (including overhead), return how many elements of that type will completely
691−-- fit in it, returns at least 1.
692−--
693−{-# INLINE allocBytesToElemCount #-}
694−allocBytesToElemCount :: Unbox a => a -> Int -> Int
695−allocBytesToElemCount x bytes =
696− let n = bytesToElemCount x (allocBytesToBytes x bytes)
697− in assert (n >= 1) n
698−
699−-- | The default chunk size by which the array creation routines increase the
700−-- size of the array when the array is grown linearly.
701−arrayChunkBytes :: Int
702−arrayChunkBytes = 1024
703−
704−-------------------------------------------------------------------------------
705−-- Resizing
706−-------------------------------------------------------------------------------
707−
708−-- | Round the second argument down to multiples of the first argument.
709−{-# INLINE roundDownTo #-}
710−roundDownTo :: Int -> Int -> Int
711−roundDownTo elemSize size = size - (size `mod` elemSize)
712−
713−-- XXX See if resizing can be implemented by reading the old array as a stream
714−-- and then using writeN to the new array.
715−--
716−-- NOTE: we are passing elemSize explicitly to avoid an Unboxed constraint.
717−-- Since this is not inlined Unboxed consrraint leads to dictionary passing
718−-- which complicates some inspection tests.
719−--
720−{-# NOINLINE reallocExplicit #-}
721−reallocExplicit :: Int -> Int -> Array a -> IO (Array a)
722−reallocExplicit elemSize newCapacityInBytes Array{..} = do
723− assertM(arrEnd <= arrBound)
724−
725− -- Allocate new array
726− let newCapMaxInBytes = roundUpLargeArray newCapacityInBytes
727− contents <- Unboxed.newPinnedBytes newCapMaxInBytes
728− let !(MutableByteArray mbarrFrom#) = arrContents
729− !(MutableByteArray mbarrTo#) = contents
730−
731− -- Copy old data
732− let oldStart = arrStart
733− !(I# oldStartInBytes#) = oldStart
734− oldSizeInBytes = arrEnd - oldStart
735− newCapInBytes = roundDownTo elemSize newCapMaxInBytes
736− !newLenInBytes@(I# newLenInBytes#) = min oldSizeInBytes newCapInBytes
737− assert (oldSizeInBytes `mod` elemSize == 0) (return ())
738− assert (newLenInBytes >= 0) (return ())
739− assert (newLenInBytes `mod` elemSize == 0) (return ())
740− IO $ \s# -> (# copyMutableByteArray# mbarrFrom# oldStartInBytes#
741− mbarrTo# 0# newLenInBytes# s#, () #)
742−
743− return $ Array
744− { arrStart = 0
745− , arrContents = contents
746− , arrEnd = newLenInBytes
747− , arrBound = newCapInBytes
748− }
749−
750−-- | @realloc newCapacity array@ reallocates the array to the specified
751−-- capacity in bytes.
752−--
753−-- If the new size is less than the original array the array gets truncated.
754−-- If the new size is not a multiple of array element size then it is rounded
755−-- down to multiples of array size. If the new size is more than
756−-- 'largeObjectThreshold' then it is rounded up to the block size (4K).
757−--
758−{-# INLINABLE realloc #-}
759−realloc :: forall m a. (MonadIO m, Unbox a) => Int -> Array a -> m (Array a)
760−realloc bytes arr = liftIO $ reallocExplicit (SIZE_OF(a)) bytes arr
761−
762−-- | @reallocWith label capSizer minIncrBytes array@. The label is used
763−-- in error messages and the capSizer is used to determine the capacity of the
764−-- new array in bytes given the current byte length of the array.
765−reallocWith :: forall m a. (MonadIO m , Unbox a) =>
766− String
767− -> (Int -> Int)
768− -> Int
769− -> Array a
770− -> m (Array a)
771−reallocWith label capSizer minIncrBytes arr = do
772− let oldSizeBytes = arrEnd arr - arrStart arr
773− newCapBytes = capSizer oldSizeBytes
774− newSizeBytes = oldSizeBytes + minIncrBytes
775− safeCapBytes = max newCapBytes newSizeBytes
776− assertM(safeCapBytes >= newSizeBytes || error (badSize newSizeBytes))
777−
778− realloc safeCapBytes arr
779−
780− where
781−
782− badSize newSize =
783− concat
784− [ label
785− , ": new array size (in bytes) is less than required size "
786− , show newSize
787− , ". Please check the sizing function passed."
788− ]
789−
790−-- | @resize newCapacity array@ changes the total capacity of the array so that
791−-- it is enough to hold the specified number of elements. Nothing is done if
792−-- the specified capacity is less than the length of the array.
793−--
794−-- If the capacity is more than 'largeObjectThreshold' then it is rounded up to
795−-- the block size (4K).
796−--
797−-- /Pre-release/
798−{-# INLINE resize #-}
799−resize :: forall m a. (MonadIO m, Unbox a) =>
800− Int -> Array a -> m (Array a)
801−resize nElems arr@Array{..} = do
802− let req = SIZE_OF(a) * nElems
803− len = arrEnd - arrStart
804− if req < len
805− then return arr
806− else realloc req arr
807−
808−-- | Like 'resize' but if the byte capacity is more than 'largeObjectThreshold'
809−-- then it is rounded up to the closest power of 2.
810−--
811−-- /Pre-release/
812−{-# INLINE resizeExp #-}
813−resizeExp :: forall m a. (MonadIO m, Unbox a) =>
814− Int -> Array a -> m (Array a)
815−resizeExp nElems arr@Array{..} = do
816− let req = roundUpLargeArray (SIZE_OF(a) * nElems)
817− req1 =
818− if req > largeObjectThreshold
819− then roundUpToPower2 req
820− else req
821− len = arrEnd - arrStart
822− if req1 < len
823− then return arr
824− else realloc req1 arr
825−
826−-- | Resize the allocated memory to drop any reserved free space at the end of
827−-- the array and reallocate it to reduce wastage.
828−--
829−-- Up to 25% wastage is allowed to avoid reallocations. If the capacity is
830−-- more than 'largeObjectThreshold' then free space up to the 'blockSize' is
831−-- retained.
832−--
833−-- /Pre-release/
834−{-# INLINE rightSize #-}
835−rightSize :: forall m a. (MonadIO m, Unbox a) => Array a -> m (Array a)
836−rightSize arr@Array{..} = do
837− assert (arrEnd <= arrBound) (return ())
838− let start = arrStart
839− len = arrEnd - start
840− capacity = arrBound - start
841− target = roundUpLargeArray len
842− waste = arrBound - arrEnd
843− assert (target >= len) (return ())
844− assert (len `mod` SIZE_OF(a) == 0) (return ())
845− -- We trade off some wastage (25%) to avoid reallocations and copying.
846− if target < capacity && len < 3 * waste
847− then realloc target arr
848− else return arr
849−
850−-------------------------------------------------------------------------------
851−-- Snoc
852−-------------------------------------------------------------------------------
853−
854−-- XXX We can possibly use a smallMutableByteArray to hold the start, end,
855−-- bound pointers. Using fully mutable handle will ensure that we do not have
856−-- multiple references to the same array of different lengths lying around and
857−-- potentially misused. In that case "snoc" need not return a new array (snoc
858−-- :: Array a -> a -> m ()), it will just modify the old reference. The array
859−-- length will be mutable. This means the length function would also be
860−-- monadic. Mutable arrays would behave more like files that grow in that
861−-- case.
862−
863−-- | Snoc using a 'Ptr'. Low level reusable function.
864−--
865−-- /Internal/
866−{-# INLINE snocNewEnd #-}
867−snocNewEnd :: (MonadIO m, Unbox a) => Int -> Array a -> a -> m (Array a)
868−snocNewEnd newEnd arr@Array{..} x = liftIO $ do
869− assert (newEnd <= arrBound) (return ())
870− pokeWith arrContents arrEnd x
871− return $ arr {arrEnd = newEnd}
872−
873−-- | Really really unsafe, appends the element into the first array, may
874−-- cause silent data corruption or if you are lucky a segfault if the first
875−-- array does not have enough space to append the element.
876−--
877−-- /Internal/
878−{-# INLINE snocUnsafe #-}
879−snocUnsafe :: forall m a. (MonadIO m, Unbox a) =>
880− Array a -> a -> m (Array a)
881−snocUnsafe arr@Array{..} = snocNewEnd (INDEX_NEXT(arrEnd,a)) arr
882−
883−-- | Like 'snoc' but does not reallocate when pre-allocated array capacity
884−-- becomes full.
885−--
886−-- /Internal/
887−{-# INLINE snocMay #-}
888−snocMay :: forall m a. (MonadIO m, Unbox a) =>
889− Array a -> a -> m (Maybe (Array a))
890−snocMay arr@Array{..} x = liftIO $ do
891− let newEnd = INDEX_NEXT(arrEnd,a)
892− if newEnd <= arrBound
893− then Just <$> snocNewEnd newEnd arr x
894− else return Nothing
895−
896−-- NOINLINE to move it out of the way and not pollute the instruction cache.
897−{-# NOINLINE snocWithRealloc #-}
898−snocWithRealloc :: forall m a. (MonadIO m, Unbox a) =>
899− (Int -> Int)
900− -> Array a
901− -> a
902− -> m (Array a)
903−snocWithRealloc sizer arr x = do
904− arr1 <- liftIO $ reallocWith "snocWith" sizer (SIZE_OF(a)) arr
905− snocUnsafe arr1 x
906−
907−-- | @snocWith sizer arr elem@ mutates @arr@ to append @elem@. The length of
908−-- the array increases by 1.
909−--
910−-- If there is no reserved space available in @arr@ it is reallocated to a size
911−-- in bytes determined by the @sizer oldSizeBytes@ function, where
912−-- @oldSizeBytes@ is the original size of the array in bytes.
913−--
914−-- If the new array size is more than 'largeObjectThreshold' we automatically
915−-- round it up to 'blockSize'.
916−--
917−-- Note that the returned array may be a mutated version of the original array.
918−--
919−-- /Pre-release/
920−{-# INLINE snocWith #-}
921−snocWith :: forall m a. (MonadIO m, Unbox a) =>
922− (Int -> Int)
923− -> Array a
924− -> a
925− -> m (Array a)
926−snocWith allocSize arr x = liftIO $ do
927− let newEnd = INDEX_NEXT(arrEnd arr,a)
928− if newEnd <= arrBound arr
929− then snocNewEnd newEnd arr x
930− else snocWithRealloc allocSize arr x
931−
932−-- | The array is mutated to append an additional element to it. If there
933−-- is no reserved space available in the array then it is reallocated to grow
934−-- it by 'arrayChunkBytes' rounded up to 'blockSize' when the size becomes more
935−-- than 'largeObjectThreshold'.
936−--
937−-- Note that the returned array may be a mutated version of the original array.
938−--
939−-- Performs O(n^2) copies to grow but is thrifty on memory.
940−--
941−-- /Pre-release/
942−{-# INLINE snocLinear #-}
943−snocLinear :: forall m a. (MonadIO m, Unbox a) => Array a -> a -> m (Array a)
944−snocLinear = snocWith (+ allocBytesToBytes (undefined :: a) arrayChunkBytes)
945−
946−-- | The array is mutated to append an additional element to it. If there is no
947−-- reserved space available in the array then it is reallocated to double the
948−-- original size.
949−--
950−-- This is useful to reduce allocations when appending unknown number of
951−-- elements.
952−--
953−-- Note that the returned array may be a mutated version of the original array.
954−--
955−-- >>> snoc = Array.snocWith (* 2)
956−--
957−-- Performs O(n * log n) copies to grow, but is liberal with memory allocation.
958−--
959−{-# INLINE snoc #-}
960−snoc :: forall m a. (MonadIO m, Unbox a) => Array a -> a -> m (Array a)
961−snoc = snocWith f
962−
963− where
964−
965− f oldSize =
966− if isPower2 oldSize
967− then oldSize * 2
968− else roundUpToPower2 oldSize * 2
969−
970−-------------------------------------------------------------------------------
971−-- Random reads
972−-------------------------------------------------------------------------------
973−
974−-- XXX Can this be deduplicated with array/foreign
975−
976−-- | Return the element at the specified index without checking the bounds.
977−--
978−-- Unsafe because it does not check the bounds of the array.
979−{-# INLINE_NORMAL getIndexUnsafe #-}
980−getIndexUnsafe :: forall m a. (MonadIO m, Unbox a) => Int -> Array a -> m a
981−getIndexUnsafe i Array{..} = do
982− let index = INDEX_OF(arrStart,i,a)
983− assert (i >= 0 && INDEX_VALID(index,arrEnd,a)) (return ())
984− liftIO $ peekWith arrContents index
985−
986−-- | /O(1)/ Lookup the element at the given index. Index starts from 0.
987−--
988−{-# INLINE getIndex #-}
989−getIndex :: forall m a. (MonadIO m, Unbox a) => Int -> Array a -> m a
990−getIndex i Array{..} = do
991− let index = INDEX_OF(arrStart,i,a)
992− if i >= 0 && INDEX_VALID(index,arrEnd,a)
993− then liftIO $ peekWith arrContents index
994− else invalidIndex "getIndex" i
995−
996−-- | /O(1)/ Lookup the element at the given index from the end of the array.
997−-- Index starts from 0.
998−--
999−-- Slightly faster than computing the forward index and using getIndex.
1000−--
1001−{-# INLINE getIndexRev #-}
1002−getIndexRev :: forall m a. (MonadIO m, Unbox a) => Int -> Array a -> m a
1003−getIndexRev i Array{..} = do
1004− let index = RINDEX_OF(arrEnd,i,a)
1005− if i >= 0 && index >= arrStart
1006− then liftIO $ peekWith arrContents index
1007− else invalidIndex "getIndexRev" i
1008−
1009−data GetIndicesState contents start end st =
1010− GetIndicesState contents start end st
1011−
1012−-- | Given an unfold that generates array indices, read the elements on those
1013−-- indices from the supplied Array. An error is thrown if an index is out of
1014−-- bounds.
1015−--
1016−-- /Pre-release/
1017−{-# INLINE getIndicesD #-}
1018−getIndicesD :: (Monad m, Unbox a) =>
1019− (forall b. IO b -> m b) -> D.Stream m Int -> Unfold m (Array a) a
1020−getIndicesD liftio (D.Stream stepi sti) = Unfold step inject
1021−
1022− where
1023−
1024− inject (Array contents start end _) =
1025− return $ GetIndicesState contents start end sti
1026−
1027− {-# INLINE_LATE step #-}
1028− step (GetIndicesState contents start end st) = do
1029− r <- stepi defState st
1030− case r of
1031− D.Yield i s -> do
1032− x <- liftio $ getIndex i (Array contents start end undefined)
1033− return $ D.Yield x (GetIndicesState contents start end s)
1034− D.Skip s -> return $ D.Skip (GetIndicesState contents start end s)
1035− D.Stop -> return D.Stop
1036−
1037−{-# INLINE getIndices #-}
1038−getIndices :: (MonadIO m, Unbox a) => Stream m Int -> Unfold m (Array a) a
1039−getIndices = getIndicesD liftIO . Stream.toStreamD
1040−
1041−-------------------------------------------------------------------------------
1042−-- Subarrays
1043−-------------------------------------------------------------------------------
1044−
1045−-- XXX We can also get immutable slices.
1046−
1047−-- | /O(1)/ Slice an array in constant time.
1048−--
1049−-- Unsafe: The bounds of the slice are not checked.
1050−--
1051−-- /Unsafe/
1052−--
1053−-- /Pre-release/
1054−{-# INLINE getSliceUnsafe #-}
1055−getSliceUnsafe :: forall a. Unbox a
1056− => Int -- ^ from index
1057− -> Int -- ^ length of the slice
1058− -> Array a
1059− -> Array a
1060−getSliceUnsafe index len (Array contents start e _) =
1061− let fp1 = INDEX_OF(start,index,a)
1062− end = fp1 + (len * SIZE_OF(a))
1063− in assert
1064− (index >= 0 && len >= 0 && end <= e)
1065− -- Note: In a slice we always use bound = end so that the slice
1066− -- user cannot overwrite elements beyond the end of the slice.
1067− (Array contents fp1 end end)
1068−
1069−-- | /O(1)/ Slice an array in constant time. Throws an error if the slice
1070−-- extends out of the array bounds.
1071−--
1072−-- /Pre-release/
1073−{-# INLINE getSlice #-}
1074−getSlice :: forall a. Unbox a =>
1075− Int -- ^ from index
1076− -> Int -- ^ length of the slice
1077− -> Array a
1078− -> Array a
1079−getSlice index len (Array contents start e _) =
1080− let fp1 = INDEX_OF(start,index,a)
1081− end = fp1 + (len * SIZE_OF(a))
1082− in if index >= 0 && len >= 0 && end <= e
1083− -- Note: In a slice we always use bound = end so that the slice user
1084− -- cannot overwrite elements beyond the end of the slice.
1085− then Array contents fp1 end end
1086− else error
1087− $ "getSlice: invalid slice, index "
1088− ++ show index ++ " length " ++ show len
1089−
1090−-------------------------------------------------------------------------------
1091−-- In-place mutation algorithms
1092−-------------------------------------------------------------------------------
1093−
1094−-- XXX consider the bulk update/accumulation/permutation APIs from vector.
1095−
1096−-- | You may not need to reverse an array because you can consume it in reverse
1097−-- using 'readerRev'. To reverse large arrays you can read in reverse and write
1098−-- to another array. However, in-place reverse can be useful to take adavantage
1099−-- of cache locality and when you do not want to allocate additional memory.
1100−--
1101−{-# INLINE reverse #-}
1102−reverse :: forall m a. (MonadIO m, Unbox a) => Array a -> m ()
1103−reverse Array{..} = liftIO $ do
1104− let l = arrStart
1105− h = INDEX_PREV(arrEnd,a)
1106− in swap l h
1107−
1108− where
1109−
1110− swap l h = do
1111− when (l < h) $ do
1112− swapArrayByteIndices (Proxy :: Proxy a) arrContents l h
1113− swap (INDEX_NEXT(l,a)) (INDEX_PREV(h,a))
1114−
1115−-- | Generate the next permutation of the sequence, returns False if this is
1116−-- the last permutation.
1117−--
1118−-- /Unimplemented/
1119−{-# INLINE permute #-}
1120−permute :: Array a -> m Bool
1121−permute = undefined
1122−
1123−-- | Partition an array into two halves using a partitioning predicate. The
1124−-- first half retains values where the predicate is 'False' and the second half
1125−-- retains values where the predicate is 'True'.
1126−--
1127−-- /Pre-release/
1128−{-# INLINE partitionBy #-}
1129−partitionBy :: forall m a. (MonadIO m, Unbox a)
1130− => (a -> Bool) -> Array a -> m (Array a, Array a)
1131−partitionBy f arr@Array{..} = liftIO $ do
1132− if arrStart >= arrEnd
1133− then return (arr, arr)
1134− else do
1135− ptr <- go arrStart (INDEX_PREV(arrEnd,a))
1136− let pl = Array arrContents arrStart ptr ptr
1137− pr = Array arrContents ptr arrEnd arrEnd
1138− return (pl, pr)
1139−
1140− where
1141−
1142− -- Invariant low < high on entry, and on return as well
1143− moveHigh low high = do
1144− h <- peekWith arrContents high
1145− if f h
1146− then
1147− -- Correctly classified, continue the loop
1148− let high1 = INDEX_PREV(high,a)
1149− in if low == high1
1150− then return Nothing
1151− else moveHigh low high1
1152− else return (Just (high, h)) -- incorrectly classified
1153−
1154− -- Keep a low pointer starting at the start of the array (first partition)
1155− -- and a high pointer starting at the end of the array (second partition).
1156− -- Keep incrementing the low ptr and decrementing the high ptr until both
1157− -- are wrongly classified, at that point swap the two and continue until
1158− -- the two pointer cross each other.
1159− --
1160− -- Invariants when entering this loop:
1161− -- low <= high
1162− -- Both low and high are valid locations within the array
1163− go low high = do
1164− l <- peekWith arrContents low
1165− if f l
1166− then
1167− -- low is wrongly classified
1168− if low == high
1169− then return low
1170− else do -- low < high
1171− r <- moveHigh low high
1172− case r of
1173− Nothing -> return low
1174− Just (high1, h) -> do -- low < high1
1175− pokeWith arrContents low h
1176− pokeWith arrContents high1 l
1177− let low1 = INDEX_NEXT(low,a)
1178− high2 = INDEX_PREV(high1,a)
1179− if low1 <= high2
1180− then go low1 high2
1181− else return low1 -- low1 > high2
1182−
1183− else do
1184− -- low is correctly classified
1185− let low1 = INDEX_NEXT(low,a)
1186− if low == high
1187− then return low1
1188− else go low1 high
1189−
1190−-- | Shuffle corresponding elements from two arrays using a shuffle function.
1191−-- If the shuffle function returns 'False' then do nothing otherwise swap the
1192−-- elements. This can be used in a bottom up fold to shuffle or reorder the
1193−-- elements.
1194−--
1195−-- /Unimplemented/
1196−{-# INLINE shuffleBy #-}
1197−shuffleBy :: (a -> a -> m Bool) -> Array a -> Array a -> m ()
1198−shuffleBy = undefined
1199−
1200−-- XXX we can also make the folds partial by stopping at a certain level.
1201−--
1202−-- | @divideBy level partition array@ performs a top down hierarchical
1203−-- recursive partitioning fold of items in the container using the given
1204−-- function as the partition function. Level indicates the level in the tree
1205−-- where the fold would stop.
1206−--
1207−-- This performs a quick sort if the partition function is
1208−-- 'partitionBy (< pivot)'.
1209−--
1210−-- /Unimplemented/
1211−{-# INLINABLE divideBy #-}
1212−divideBy ::
1213− Int -> (Array a -> m (Array a, Array a)) -> Array a -> m ()
1214−divideBy = undefined
1215−
1216−-- | @mergeBy level merge array@ performs a pairwise bottom up fold recursively
1217−-- merging the pairs using the supplied merge function. Level indicates the
1218−-- level in the tree where the fold would stop.
1219−--
1220−-- This performs a random shuffle if the merge function is random. If we
1221−-- stop at level 0 and repeatedly apply the function then we can do a bubble
1222−-- sort.
1223−--
1224−-- /Unimplemented/
1225−mergeBy :: Int -> (Array a -> Array a -> m ()) -> Array a -> m ()
1226−mergeBy = undefined
1227−
1228−-------------------------------------------------------------------------------
1229−-- Size
1230−-------------------------------------------------------------------------------
1231−
1232−-- | /O(1)/ Get the byte length of the array.
1233−--
1234−{-# INLINE byteLength #-}
1235−byteLength :: Array a -> Int
1236−byteLength Array{..} =
1237− let len = arrEnd - arrStart
1238− in assert (len >= 0) len
1239−
1240−-- Note: try to avoid the use of length in performance sensitive internal
1241−-- routines as it involves a costly 'div' operation. Instead use the end ptr
1242−-- in the array to check the bounds etc.
1243−--
1244−-- | /O(1)/ Get the length of the array i.e. the number of elements in the
1245−-- array.
1246−--
1247−-- Note that 'byteLength' is less expensive than this operation, as 'length'
1248−-- involves a costly division operation.
1249−--
1250−{-# INLINE length #-}
1251−length :: forall a. Unbox a => Array a -> Int
1252−length arr =
1253− let elemSize = SIZE_OF(a)
1254− blen = byteLength arr
1255− in assert (blen `mod` elemSize == 0) (blen `div` elemSize)
1256−
1257−-- | Get the total capacity of an array. An array may have space reserved
1258−-- beyond the current used length of the array.
1259−--
1260−-- /Pre-release/
1261−{-# INLINE byteCapacity #-}
1262−byteCapacity :: Array a -> Int
1263−byteCapacity Array{..} =
1264− let len = arrBound - arrStart
1265− in assert (len >= 0) len
1266−
1267−-- | The remaining capacity in the array for appending more elements without
1268−-- reallocation.
1269−--
1270−-- /Pre-release/
1271−{-# INLINE bytesFree #-}
1272−bytesFree :: Array a -> Int
1273−bytesFree Array{..} =
1274− let n = arrBound - arrEnd
1275− in assert (n >= 0) n
1276−
1277−-------------------------------------------------------------------------------
1278−-- Streams of arrays - Creation
1279−-------------------------------------------------------------------------------
1280−
1281−data GroupState s contents start end bound
1282− = GroupStart s
1283− | GroupBuffer s contents start end bound
1284− | GroupYield
1285− contents start end bound (GroupState s contents start end bound)
1286− | GroupFinish
1287−
1288−-- | @arraysOf n stream@ groups the input stream into a stream of
1289−-- arrays of size n.
1290−--
1291−-- @arraysOf n = StreamD.foldMany (Array.writeN n)@
1292−--
1293−-- /Pre-release/
1294−{-# INLINE_NORMAL arraysOf #-}
1295−arraysOf :: forall m a. (MonadIO m, Unbox a)
1296− => Int -> D.Stream m a -> D.Stream m (Array a)
1297−-- XXX the idiomatic implementation leads to large regression in the D.reverse'
1298−-- benchmark. It seems it has difficulty producing optimized code when
1299−-- converting to StreamK. Investigate GHC optimizations.
1300−-- arraysOf n = D.foldMany (writeN n)
1301−arraysOf n (D.Stream step state) =
1302− D.Stream step' (GroupStart state)
1303−
1304− where
1305−
1306− {-# INLINE_LATE step' #-}
1307− step' _ (GroupStart st) = do
1308− when (n <= 0) $
1309− -- XXX we can pass the module string from the higher level API
1310− error $ "Streamly.Internal.Data.Array.Mut.Type.arraysOf: "
1311− ++ "the size of arrays [" ++ show n
1312− ++ "] must be a natural number"
1313− (Array contents start end bound :: Array a) <- liftIO $ newPinned n
1314− return $ D.Skip (GroupBuffer st contents start end bound)
1315−
1316− step' gst (GroupBuffer st contents start end bound) = do
1317− r <- step (adaptState gst) st
1318− case r of
1319− D.Yield x s -> do
1320− liftIO $ pokeWith contents end x
1321− let end1 = INDEX_NEXT(end,a)
1322− return $
1323− if end1 >= bound
1324− then D.Skip
1325− (GroupYield
1326− contents start end1 bound (GroupStart s))
1327− else D.Skip (GroupBuffer s contents start end1 bound)
1328− D.Skip s ->
1329− return $ D.Skip (GroupBuffer s contents start end bound)
1330− D.Stop ->
1331− return
1332− $ D.Skip (GroupYield contents start end bound GroupFinish)
1333−
1334− step' _ (GroupYield contents start end bound next) =
1335− return $ D.Yield (Array contents start end bound) next
1336−
1337− step' _ GroupFinish = return D.Stop
1338−
1339−-- XXX buffer to a list instead?
1340−-- | Buffer the stream into arrays in memory.
1341−{-# INLINE arrayStreamKFromStreamD #-}
1342−arrayStreamKFromStreamD :: forall m a. (MonadIO m, Unbox a) =>
1343− D.Stream m a -> m (K.Stream m (Array a))
1344−arrayStreamKFromStreamD =
1345− let n = allocBytesToElemCount (undefined :: a) defaultChunkSize
1346− in D.foldr K.cons K.nil . arraysOf n
1347−
1348−-------------------------------------------------------------------------------
1349−-- Streams of arrays - Flattening
1350−-------------------------------------------------------------------------------
1351−
1352−data FlattenState s contents a =
1353− OuterLoop s
1354− | InnerLoop s contents !Int !Int
1355−
1356−-- | Use the "reader" unfold instead.
1357−--
1358−-- @flattenArrays = unfoldMany reader@
1359−--
1360−-- We can try this if there are any fusion issues in the unfold.
1361−--
1362−{-# INLINE_NORMAL flattenArrays #-}
1363−flattenArrays :: forall m a. (MonadIO m, Unbox a)
1364− => D.Stream m (Array a) -> D.Stream m a
1365−flattenArrays (D.Stream step state) = D.Stream step' (OuterLoop state)
1366−
1367− where
1368−
1369− {-# INLINE_LATE step' #-}
1370− step' gst (OuterLoop st) = do
1371− r <- step (adaptState gst) st
1372− return $ case r of
1373− D.Yield Array{..} s ->
1374− D.Skip (InnerLoop s arrContents arrStart arrEnd)
1375− D.Skip s -> D.Skip (OuterLoop s)
1376− D.Stop -> D.Stop
1377−
1378− step' _ (InnerLoop st _ p end) | assert (p <= end) (p == end) =
1379− return $ D.Skip $ OuterLoop st
1380−
1381− step' _ (InnerLoop st contents p end) = do
1382− x <- liftIO $ peekWith contents p
1383− return $ D.Yield x (InnerLoop st contents (INDEX_NEXT(p,a)) end)
1384−
1385−-- | Use the "readerRev" unfold instead.
1386−--
1387−-- @flattenArrays = unfoldMany readerRev@
1388−--
1389−-- We can try this if there are any fusion issues in the unfold.
1390−--
1391−{-# INLINE_NORMAL flattenArraysRev #-}
1392−flattenArraysRev :: forall m a. (MonadIO m, Unbox a)
1393− => D.Stream m (Array a) -> D.Stream m a
1394−flattenArraysRev (D.Stream step state) = D.Stream step' (OuterLoop state)
1395−
1396− where
1397−
1398− {-# INLINE_LATE step' #-}
1399− step' gst (OuterLoop st) = do
1400− r <- step (adaptState gst) st
1401− return $ case r of
1402− D.Yield Array{..} s ->
1403− let p = INDEX_PREV(arrEnd,a)
1404− in D.Skip (InnerLoop s arrContents p arrStart)
1405− D.Skip s -> D.Skip (OuterLoop s)
1406− D.Stop -> D.Stop
1407−
1408− step' _ (InnerLoop st _ p start) | p < start =
1409− return $ D.Skip $ OuterLoop st
1410−
1411− step' _ (InnerLoop st contents p start) = do
1412− x <- liftIO $ peekWith contents p
1413− let cur = INDEX_PREV(p,a)
1414− return $ D.Yield x (InnerLoop st contents cur start)
1415−
1416−-------------------------------------------------------------------------------
1417−-- Unfolds
1418−-------------------------------------------------------------------------------
1419−
1420−data ArrayUnsafe a = ArrayUnsafe
1421− {-# UNPACK #-} !MutableByteArray -- contents
1422− {-# UNPACK #-} !Int -- index 1
1423− {-# UNPACK #-} !Int -- index 2
1424−
1425−toArrayUnsafe :: Array a -> ArrayUnsafe a
1426−toArrayUnsafe (Array contents start end _) = ArrayUnsafe contents start end
1427−
1428−fromArrayUnsafe ::
1429−#ifdef DEVBUILD
1430− Unbox a =>
1431−#endif
1432− ArrayUnsafe a -> Array a
1433−fromArrayUnsafe (ArrayUnsafe contents start end) =
1434− Array contents start end end
1435−
1436−{-# INLINE_NORMAL producerWith #-}
1437−producerWith ::
1438− forall m a. (Monad m, Unbox a)
1439− => (forall b. IO b -> m b) -> Producer m (Array a) a
1440−producerWith liftio = Producer step (return . toArrayUnsafe) extract
1441− where
1442−
1443− {-# INLINE_LATE step #-}
1444− step (ArrayUnsafe _ cur end)
1445− | assert (cur <= end) (cur == end) = return D.Stop
1446− step (ArrayUnsafe contents cur end) = do
1447− -- When we use a purely lazy Monad like Identity, we need to force a
1448− -- few actions for correctness and execution order sanity. We want
1449− -- the peek to occur right here and not lazily at some later point
1450− -- because we want the peek to be ordered with respect to the touch.
1451− !x <- liftio $ peekWith contents cur
1452− return $ D.Yield x (ArrayUnsafe contents (INDEX_NEXT(cur,a)) end)
1453−
1454− extract = return . fromArrayUnsafe
1455−
1456−-- | Resumable unfold of an array.
1457−--
1458−{-# INLINE_NORMAL producer #-}
1459−producer :: forall m a. (MonadIO m, Unbox a) => Producer m (Array a) a
1460−producer = producerWith liftIO
1461−
1462−-- | Unfold an array into a stream.
1463−--
1464−{-# INLINE_NORMAL reader #-}
1465−reader :: forall m a. (MonadIO m, Unbox a) => Unfold m (Array a) a
1466−reader = Producer.simplify producer
1467−
1468−{-# INLINE_NORMAL readerRevWith #-}
1469−readerRevWith ::
1470− forall m a. (Monad m, Unbox a)
1471− => (forall b. IO b -> m b) -> Unfold m (Array a) a
1472−readerRevWith liftio = Unfold step inject
1473− where
1474−
1475− inject (Array contents start end _) =
1476− let p = INDEX_PREV(end,a)
1477− in return $ ArrayUnsafe contents start p
1478−
1479− {-# INLINE_LATE step #-}
1480− step (ArrayUnsafe _ start p) | p < start = return D.Stop
1481− step (ArrayUnsafe contents start p) = do
1482− !x <- liftio $ peekWith contents p
1483− return $ D.Yield x (ArrayUnsafe contents start (INDEX_PREV(p,a)))
1484−
1485−-- | Unfold an array into a stream in reverse order.
1486−--
1487−{-# INLINE_NORMAL readerRev #-}
1488−readerRev :: forall m a. (MonadIO m, Unbox a) => Unfold m (Array a) a
1489−readerRev = readerRevWith liftIO
1490−
1491−-------------------------------------------------------------------------------
1492−-- to Lists and streams
1493−-------------------------------------------------------------------------------
1494−
1495−{-
1496−-- Use foldr/build fusion to fuse with list consumers
1497−-- This can be useful when using the IsList instance
1498−{-# INLINE_LATE toListFB #-}
1499−toListFB :: forall a b. Unbox a => (a -> b -> b) -> b -> Array a -> b
1500−toListFB c n Array{..} = go arrStart
1501− where
1502−
1503− go p | assert (p <= arrEnd) (p == arrEnd) = n
1504− go p =
1505− -- unsafeInlineIO allows us to run this in Identity monad for pure
1506− -- toList/foldr case which makes them much faster due to not
1507− -- accumulating the list and fusing better with the pure consumers.
1508− --
1509− -- This should be safe as the array contents are guaranteed to be
1510− -- evaluated/written to before we peek at them.
1511− -- XXX
1512− let !x = unsafeInlineIO $ do
1513− r <- peekWith arrContents p
1514− return r
1515− in c x (go (PTR_NEXT(p,a)))
1516−-}
1517−
1518−-- XXX Monadic foldr/build fusion?
1519−-- Reference: https://www.researchgate.net/publication/220676509_Monadic_augment_and_generalised_short_cut_fusion
1520−-- | Convert an 'Array' into a list.
1521−--
1522−{-# INLINE toList #-}
1523−toList :: forall m a. (MonadIO m, Unbox a) => Array a -> m [a]
1524−toList Array{..} = liftIO $ go arrStart
1525− where
1526−
1527− go p | assert (p <= arrEnd) (p == arrEnd) = return []
1528− go p = do
1529− x <- peekWith arrContents p
1530− (:) x <$> go (INDEX_NEXT(p,a))
1531−
1532−{-# INLINE_NORMAL toStreamDWith #-}
1533−toStreamDWith ::
1534− forall m a. (Monad m, Unbox a)
1535− => (forall b. IO b -> m b) -> Array a -> D.Stream m a
1536−toStreamDWith liftio Array{..} = D.Stream step arrStart
1537−
1538− where
1539−
1540− {-# INLINE_LATE step #-}
1541− step _ p | assert (p <= arrEnd) (p == arrEnd) = return D.Stop
1542− step _ p = liftio $ do
1543− r <- peekWith arrContents p
1544− return $ D.Yield r (INDEX_NEXT(p,a))
1545−
1546−-- | Use the 'reader' unfold instead.
1547−--
1548−-- @toStreamD = D.unfold reader@
1549−--
1550−-- We can try this if the unfold has any performance issues.
1551−{-# INLINE_NORMAL toStreamD #-}
1552−toStreamD :: forall m a. (MonadIO m, Unbox a) => Array a -> D.Stream m a
1553−toStreamD = toStreamDWith liftIO
1554−
1555−{-# INLINE toStreamKWith #-}
1556−toStreamKWith ::
1557− forall m a. (Monad m, Unbox a)
1558− => (forall b. IO b -> m b) -> Array a -> K.Stream m a
1559−toStreamKWith liftio Array{..} = go arrStart
1560−
1561− where
1562−
1563− go p | assert (p <= arrEnd) (p == arrEnd) = K.nil
1564− | otherwise =
1565− let elemM = peekWith arrContents p
1566− in liftio elemM `K.consM` go (INDEX_NEXT(p,a))
1567−
1568−{-# INLINE toStreamK #-}
1569−toStreamK :: forall m a. (MonadIO m, Unbox a) => Array a -> K.Stream m a
1570−toStreamK = toStreamKWith liftIO
1571−
1572−{-# INLINE_NORMAL toStreamDRevWith #-}
1573−toStreamDRevWith ::
1574− forall m a. (Monad m, Unbox a)
1575− => (forall b. IO b -> m b) -> Array a -> D.Stream m a
1576−toStreamDRevWith liftio Array{..} =
1577− let p = INDEX_PREV(arrEnd,a)
1578− in D.Stream step p
1579−
1580− where
1581−
1582− {-# INLINE_LATE step #-}
1583− step _ p | p < arrStart = return D.Stop
1584− step _ p = liftio $ do
1585− r <- peekWith arrContents p
1586− return $ D.Yield r (INDEX_PREV(p,a))
1587−
1588−-- | Use the 'readerRev' unfold instead.
1589−--
1590−-- @toStreamDRev = D.unfold readerRev@
1591−--
1592−-- We can try this if the unfold has any perf issues.
1593−{-# INLINE_NORMAL toStreamDRev #-}
1594−toStreamDRev :: forall m a. (MonadIO m, Unbox a) => Array a -> D.Stream m a
1595−toStreamDRev = toStreamDRevWith liftIO
1596−
1597−{-# INLINE toStreamKRevWith #-}
1598−toStreamKRevWith ::
1599− forall m a. (Monad m, Unbox a)
1600− => (forall b. IO b -> m b) -> Array a -> K.Stream m a
1601−toStreamKRevWith liftio Array {..} =
1602− let p = INDEX_PREV(arrEnd,a)
1603− in go p
1604−
1605− where
1606−
1607− go p | p < arrStart = K.nil
1608− | otherwise =
1609− let elemM = peekWith arrContents p
1610− in liftio elemM `K.consM` go (INDEX_PREV(p,a))
1611−
1612−{-# INLINE toStreamKRev #-}
1613−toStreamKRev :: forall m a. (MonadIO m, Unbox a) => Array a -> K.Stream m a
1614−toStreamKRev = toStreamKRevWith liftIO
1615−
1616−-------------------------------------------------------------------------------
1617−-- Folding
1618−-------------------------------------------------------------------------------
1619−
1620−-- XXX Need something like "Array m a" enforcing monadic action to avoid the
1621−-- possibility of such APIs.
1622−--
1623−-- | Strict left fold of an array.
1624−{-# INLINE_NORMAL foldl' #-}
1625−foldl' :: (MonadIO m, Unbox a) => (b -> a -> b) -> b -> Array a -> m b
1626−foldl' f z arr = D.foldl' f z $ toStreamD arr
1627−
1628−-- | Right fold of an array.
1629−{-# INLINE_NORMAL foldr #-}
1630−foldr :: (MonadIO m, Unbox a) => (a -> b -> b) -> b -> Array a -> m b
1631−foldr f z arr = D.foldr f z $ toStreamD arr
1632−
1633−-------------------------------------------------------------------------------
1634−-- Folds
1635−-------------------------------------------------------------------------------
1636−
1637−-- Note: Arrays may be allocated with a specific alignment at the beginning of
1638−-- the array. If you need to maintain that alignment on reallocations then you
1639−-- can resize the array manually before append, using an aligned resize
1640−-- operation.
1641−
1642−-- XXX Keep the bound intact to not lose any free space? Perf impact?
1643−
1644−-- | @writeAppendNUnsafe n alloc@ appends up to @n@ input items to the supplied
1645−-- array.
1646−--
1647−-- Unsafe: Do not drive the fold beyond @n@ elements, it will lead to memory
1648−-- corruption or segfault.
1649−--
1650−-- Any free space left in the array after appending @n@ elements is lost.
1651−--
1652−-- /Internal/
1653−{-# INLINE_NORMAL writeAppendNUnsafe #-}
1654−writeAppendNUnsafe :: forall m a. (MonadIO m, Unbox a) =>
1655− Int
1656− -> m (Array a)
1657− -> Fold m a (Array a)
1658−writeAppendNUnsafe n action =
1659− fmap fromArrayUnsafe $ FL.foldlM' step initial
1660−
1661− where
1662−
1663− initial = do
1664− assert (n >= 0) (return ())
1665− arr@(Array _ _ end bound) <- action
1666− let free = bound - end
1667− needed = n * SIZE_OF(a)
1668− -- XXX We can also reallocate if the array has too much free space,
1669− -- otherwise we lose that space.
1670− arr1 <-
1671− if free < needed
1672− then noinline reallocWith "writeAppendNUnsafeWith" (+ needed) needed arr
1673− else return arr
1674− return $ toArrayUnsafe arr1
1675−
1676− step (ArrayUnsafe contents start end) x = do
1677− liftIO $ pokeWith contents end x
1678− return $ ArrayUnsafe contents start (INDEX_NEXT(end,a))
1679−
1680−-- | Append @n@ elements to an existing array. Any free space left in the array
1681−-- after appending @n@ elements is lost.
1682−--
1683−-- >>> writeAppendN n initial = Fold.take n (Array.writeAppendNUnsafe n initial)
1684−--
1685−{-# INLINE_NORMAL writeAppendN #-}
1686−writeAppendN :: forall m a. (MonadIO m, Unbox a) =>
1687− Int -> m (Array a) -> Fold m a (Array a)
1688−writeAppendN n initial = FL.take n (writeAppendNUnsafe n initial)
1689−
1690−-- | @writeAppendWith realloc action@ mutates the array generated by @action@ to
1691−-- append the input stream. If there is no reserved space available in the
1692−-- array it is reallocated to a size in bytes determined by @realloc oldSize@,
1693−-- where @oldSize@ is the current size of the array in bytes.
1694−--
1695−-- Note that the returned array may be a mutated version of original array.
1696−--
1697−-- >>> writeAppendWith sizer = Fold.foldlM' (Array.snocWith sizer)
1698−--
1699−-- /Pre-release/
1700−{-# INLINE writeAppendWith #-}
1701−writeAppendWith :: forall m a. (MonadIO m, Unbox a) =>
1702− (Int -> Int) -> m (Array a) -> Fold m a (Array a)
1703−writeAppendWith sizer = FL.foldlM' (snocWith sizer)
1704−
1705−-- | @append action@ mutates the array generated by @action@ to append the
1706−-- input stream. If there is no reserved space available in the array it is
1707−-- reallocated to double the size.
1708−--
1709−-- Note that the returned array may be a mutated version of original array.
1710−--
1711−-- >>> writeAppend = Array.writeAppendWith (* 2)
1712−--
1713−{-# INLINE writeAppend #-}
1714−writeAppend :: forall m a. (MonadIO m, Unbox a) =>
1715− m (Array a) -> Fold m a (Array a)
1716−writeAppend = writeAppendWith (* 2)
1717−
1718−-- XXX We can carry bound as well in the state to make sure we do not lose the
1719−-- remaining capacity. Need to check perf impact.
1720−--
1721−-- | Like 'writeNUnsafe' but takes a new array allocator @alloc size@ function
1722−-- as argument.
1723−--
1724−-- >>> writeNWithUnsafe alloc n = Array.writeAppendNUnsafe (alloc n) n
1725−--
1726−-- /Pre-release/
1727−{-# INLINE_NORMAL writeNWithUnsafe #-}
1728−writeNWithUnsafe :: forall m a. (MonadIO m, Unbox a)
1729− => (Int -> m (Array a)) -> Int -> Fold m a (Array a)
1730−writeNWithUnsafe alloc n = fromArrayUnsafe <$> FL.foldlM' step initial
1731−
1732− where
1733−
1734− initial = toArrayUnsafe <$> alloc (max n 0)
1735−
1736− step (ArrayUnsafe contents start end) x = do
1737− liftIO $ pokeWith contents end x
1738− return
1739− $ ArrayUnsafe contents start (INDEX_NEXT(end,a))
1740−
1741−-- | Like 'writeN' but does not check the array bounds when writing. The fold
1742−-- driver must not call the step function more than 'n' times otherwise it will
1743−-- corrupt the memory and crash. This function exists mainly because any
1744−-- conditional in the step function blocks fusion causing 10x performance
1745−-- slowdown.
1746−--
1747−-- >>> writeNUnsafe = Array.writeNWithUnsafe Array.newPinned
1748−--
1749−{-# INLINE_NORMAL writeNUnsafe #-}
1750−writeNUnsafe :: forall m a. (MonadIO m, Unbox a)
1751− => Int -> Fold m a (Array a)
1752−writeNUnsafe = writeNWithUnsafe newPinned
1753−
1754−-- | @writeNWith alloc n@ folds a maximum of @n@ elements into an array
1755−-- allocated using the @alloc@ function.
1756−--
1757−-- >>> writeNWith alloc n = Fold.take n (Array.writeNWithUnsafe alloc n)
1758−-- >>> writeNWith alloc n = Array.writeAppendN (alloc n) n
1759−--
1760−{-# INLINE_NORMAL writeNWith #-}
1761−writeNWith :: forall m a. (MonadIO m, Unbox a)
1762− => (Int -> m (Array a)) -> Int -> Fold m a (Array a)
1763−writeNWith alloc n = FL.take n (writeNWithUnsafe alloc n)
1764−
1765−-- | @writeN n@ folds a maximum of @n@ elements from the input stream to an
1766−-- 'Array'.
1767−--
1768−-- >>> writeN = Array.writeNWith Array.newPinned
1769−-- >>> writeN n = Fold.take n (Array.writeNUnsafe n)
1770−-- >>> writeN n = Array.writeAppendN n (Array.newPinned n)
1771−--
1772−{-# INLINE_NORMAL writeN #-}
1773−writeN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1774−writeN = writeNWith newPinned
1775−
1776−-- | Like writeNWithUnsafe but writes the array in reverse order.
1777−--
1778−-- /Internal/
1779−{-# INLINE_NORMAL writeRevNWithUnsafe #-}
1780−writeRevNWithUnsafe :: forall m a. (MonadIO m, Unbox a)
1781− => (Int -> m (Array a)) -> Int -> Fold m a (Array a)
1782−writeRevNWithUnsafe alloc n = fromArrayUnsafe <$> FL.foldlM' step initial
1783−
1784− where
1785−
1786− toArrayUnsafeRev (Array contents _ _ bound) =
1787− ArrayUnsafe contents bound bound
1788−
1789− initial = toArrayUnsafeRev <$> alloc (max n 0)
1790−
1791− step (ArrayUnsafe contents start end) x = do
1792− let ptr = INDEX_PREV(start,a)
1793− liftIO $ pokeWith contents ptr x
1794− return
1795− $ ArrayUnsafe contents ptr end
1796−
1797−-- | Like writeNWith but writes the array in reverse order.
1798−--
1799−-- /Internal/
1800−{-# INLINE_NORMAL writeRevNWith #-}
1801−writeRevNWith :: forall m a. (MonadIO m, Unbox a)
1802− => (Int -> m (Array a)) -> Int -> Fold m a (Array a)
1803−writeRevNWith alloc n = FL.take n (writeRevNWithUnsafe alloc n)
1804−
1805−-- | Like writeN but writes the array in reverse order.
1806−--
1807−-- /Pre-release/
1808−{-# INLINE_NORMAL writeRevN #-}
1809−writeRevN :: forall m a. (MonadIO m, Unbox a) => Int -> Fold m a (Array a)
1810−writeRevN = writeRevNWith newPinned
1811−
1812−-- | @writeNAligned align n@ folds a maximum of @n@ elements from the input
1813−-- stream to an 'Array' aligned to the given size.
1814−--
1815−-- >>> writeNAligned align = Array.writeNWith (Array.newAlignedPinned align)
1816−-- >>> writeNAligned align n = Array.writeAppendN n (Array.newAlignedPinned align n)
1817−--
1818−-- /Pre-release/
1819−--
1820−{-# INLINE_NORMAL writeNAligned #-}
1821−writeNAligned :: forall m a. (MonadIO m, Unbox a)
1822− => Int -> Int -> Fold m a (Array a)
1823−writeNAligned align = writeNWith (newAlignedPinned align)
1824−
1825−-- XXX Buffer to a list instead?
1826−--
1827−-- | Buffer a stream into a stream of arrays.
1828−--
1829−-- >>> writeChunks n = Fold.many (Array.writeN n) Fold.toStreamK
1830−--
1831−-- Breaking an array into an array stream can be useful to consume a large
1832−-- array sequentially such that memory of the array is released incrementatlly.
1833−--
1834−-- See also: 'arrayStreamKFromStreamD'.
1835−--
1836−-- /Unimplemented/
1837−--
1838−{-# INLINE_NORMAL writeChunks #-}
1839−writeChunks :: (MonadIO m, Unbox a) =>
1840− Int -> Fold m a (K.Stream n (Array a))
1841−writeChunks n = FL.many (writeN n) FL.toStreamK
1842−
1843−-- XXX Compare writeWith with fromStreamD which uses an array of streams
1844−-- implementation. We can write this using writeChunks above if that is faster.
1845−-- If writeWith is faster then we should use that to implement
1846−-- fromStreamD.
1847−--
1848−-- XXX The realloc based implementation needs to make one extra copy if we use
1849−-- shrinkToFit. On the other hand, the stream of arrays implementation may
1850−-- buffer the array chunk pointers in memory but it does not have to shrink as
1851−-- we know the exact size in the end. However, memory copying does not seem to
1852−-- be as expensive as the allocations. Therefore, we need to reduce the number
1853−-- of allocations instead. Also, the size of allocations matters, right sizing
1854−-- an allocation even at the cost of copying sems to help. Should be measured
1855−-- on a big stream with heavy calls to toArray to see the effect.
1856−--
1857−-- XXX check if GHC's memory allocator is efficient enough. We can try the C
1858−-- malloc to compare against.
1859−
1860−-- | @writeWith minCount@ folds the whole input to a single array. The array
1861−-- starts at a size big enough to hold minCount elements, the size is doubled
1862−-- every time the array needs to be grown.
1863−--
1864−-- /Caution! Do not use this on infinite streams./
1865−--
1866−-- >>> f n = Array.writeAppendWith (* 2) (Array.newPinned n)
1867−-- >>> writeWith n = Fold.rmapM Array.rightSize (f n)
1868−-- >>> writeWith n = Fold.rmapM Array.fromArrayStreamK (Array.writeChunks n)
1869−--
1870−-- /Pre-release/
1871−{-# INLINE_NORMAL writeWith #-}
1872−writeWith :: forall m a. (MonadIO m, Unbox a)
1873− => Int -> Fold m a (Array a)
1874−-- writeWith n = FL.rmapM rightSize $ writeAppendWith (* 2) (newPinned n)
1875−writeWith elemCount =
1876− FL.rmapM extract $ FL.foldlM' step initial
1877−
1878− where
1879−
1880− insertElem (Array contents start end bound) x = do
1881− liftIO $ pokeWith contents end x
1882− return $ Array contents start (INDEX_NEXT(end,a)) bound
1883−
1884− initial = do
1885− when (elemCount < 0) $ error "writeWith: elemCount is negative"
1886− liftIO $ newPinned elemCount
1887− step arr@(Array _ start end bound) x
1888− | INDEX_NEXT(end,a) > bound = do
1889− let oldSize = end - start
1890− newSize = max (oldSize * 2) 1
1891− arr1 <- liftIO $ reallocExplicit (SIZE_OF(a)) newSize arr
1892− insertElem arr1 x
1893− step arr x = insertElem arr x
1894− extract = liftIO . rightSize
1895−
1896−-- | Fold the whole input to a single array.
1897−--
1898−-- Same as 'writeWith' using an initial array size of 'arrayChunkBytes' bytes
1899−-- rounded up to the element size.
1900−--
1901−-- /Caution! Do not use this on infinite streams./
1902−--
1903−{-# INLINE write #-}
1904−write :: forall m a. (MonadIO m, Unbox a) => Fold m a (Array a)
1905−write = writeWith (allocBytesToElemCount (undefined :: a) arrayChunkBytes)
1906−
1907−-------------------------------------------------------------------------------
1908−-- construct from streams, known size
1909−-------------------------------------------------------------------------------
1910−
1911−-- | Use the 'writeN' fold instead.
1912−--
1913−-- >>> fromStreamDN n = StreamD.fold (Array.writeN n)
1914−--
1915−{-# INLINE_NORMAL fromStreamDN #-}
1916−fromStreamDN :: forall m a. (MonadIO m, Unbox a)
1917− => Int -> D.Stream m a -> m (Array a)
1918−-- fromStreamDN n = D.fold (writeN n)
1919−fromStreamDN limit str = do
1920− (arr :: Array a) <- liftIO $ newPinned limit
1921− end <- D.foldlM' (fwrite (arrContents arr)) (return $ arrEnd arr) $ D.take limit str
1922− return $ arr {arrEnd = end}
1923−
1924− where
1925−
1926− fwrite arrContents ptr x = do
1927− liftIO $ pokeWith arrContents ptr x
1928− return $ INDEX_NEXT(ptr,a)
1929−
1930−-- | Create an 'Array' from the first N elements of a list. The array is
1931−-- allocated to size N, if the list terminates before N elements then the
1932−-- array may hold less than N elements.
1933−--
1934−{-# INLINABLE fromListN #-}
1935−fromListN :: (MonadIO m, Unbox a) => Int -> [a] -> m (Array a)
1936−fromListN n xs = fromStreamDN n $ D.fromList xs
1937−
1938−-- | Like fromListN but writes the array in reverse order.
1939−--
1940−-- /Pre-release/
1941−{-# INLINE fromListRevN #-}
1942−fromListRevN :: (MonadIO m, Unbox a) => Int -> [a] -> m (Array a)
1943−fromListRevN n xs = D.fold (writeRevN n) $ D.fromList xs
1944−
1945−-------------------------------------------------------------------------------
1946−-- convert stream to a single array
1947−-------------------------------------------------------------------------------
1948−
1949−{-# INLINE arrayStreamKLength #-}
1950−arrayStreamKLength :: (Monad m, Unbox a) => K.Stream m (Array a) -> m Int
1951−arrayStreamKLength as = K.foldl' (+) 0 (K.map length as)
1952−
1953−-- | Convert an array stream to an array. Note that this requires peak memory
1954−-- that is double the size of the array stream.
1955−--
1956−{-# INLINE fromArrayStreamK #-}
1957−fromArrayStreamK :: (Unbox a, MonadIO m) =>
1958− K.Stream m (Array a) -> m (Array a)
1959−fromArrayStreamK as = do
1960− len <- arrayStreamKLength as
1961− fromStreamDN len $ D.unfoldMany reader $ D.fromStreamK as
1962−
1963−-- CAUTION: a very large number (millions) of arrays can degrade performance
1964−-- due to GC overhead because we need to buffer the arrays before we flatten
1965−-- all the arrays.
1966−--
1967−-- XXX Compare if this is faster or "fold write".
1968−--
1969−-- | We could take the approach of doubling the memory allocation on each
1970−-- overflow. This would result in more or less the same amount of copying as in
1971−-- the chunking approach. However, if we have to shrink in the end then it may
1972−-- result in an extra copy of the entire data.
1973−--
1974−-- >>> fromStreamD = StreamD.fold Array.write
1975−--
1976−{-# INLINE fromStreamD #-}
1977−fromStreamD :: (MonadIO m, Unbox a) => D.Stream m a -> m (Array a)
1978−fromStreamD m = arrayStreamKFromStreamD m >>= fromArrayStreamK
1979−
1980−-- | Create an 'Array' from a list. The list must be of finite size.
1981−--
1982−{-# INLINE fromList #-}
1983−fromList :: (MonadIO m, Unbox a) => [a] -> m (Array a)
1984−fromList xs = fromStreamD $ D.fromList xs
1985−
1986−-- XXX We are materializing the whole list first for getting the length. Check
1987−-- if the 'fromList' like chunked implementation would fare better.
1988−
1989−-- | Like 'fromList' but writes the contents of the list in reverse order.
1990−{-# INLINE fromListRev #-}
1991−fromListRev :: (MonadIO m, Unbox a) => [a] -> m (Array a)
1992−fromListRev xs = fromListRevN (Prelude.length xs) xs
1993−
1994−-------------------------------------------------------------------------------
1995−-- Combining
1996−-------------------------------------------------------------------------------
1997−
1998−-- | Put a sub range of a source array into a subrange of a destination array.
1999−-- This is not safe as it does not check the bounds.
2000−{-# INLINE putSliceUnsafe #-}
2001−putSliceUnsafe :: MonadIO m => Array a -> Int -> Array a -> Int -> Int -> m ()
2002−putSliceUnsafe src srcStartBytes dst dstStartBytes lenBytes = liftIO $ do
2003− assertM(lenBytes <= arrBound dst - dstStartBytes)
2004− assertM(lenBytes <= arrEnd src - srcStartBytes)
2005− let !(I# srcStartBytes#) = srcStartBytes
2006− !(I# dstStartBytes#) = dstStartBytes
2007− !(I# lenBytes#) = lenBytes
2008− let arrS# = getMutableByteArray# (arrContents src)
2009− arrD# = getMutableByteArray# (arrContents dst)
2010− IO $ \s# -> (# copyMutableByteArray#
2011− arrS# srcStartBytes# arrD# dstStartBytes# lenBytes# s#
2012− , () #)
2013−
2014−-- | Copy two arrays into a newly allocated array.
2015−{-# INLINE spliceCopy #-}
2016−spliceCopy :: forall m a. MonadIO m =>
2017−#ifdef DEVBUILD
2018− Unbox a =>
2019−#endif
2020− Array a -> Array a -> m (Array a)
2021−spliceCopy arr1 arr2 = liftIO $ do
2022− let start1 = arrStart arr1
2023− start2 = arrStart arr2
2024− len1 = arrEnd arr1 - start1
2025− len2 = arrEnd arr2 - start2
2026− newArrContents <- liftIO $ Unboxed.newPinnedBytes (len1 + len2)
2027− let len = len1 + len2
2028− newArr = Array newArrContents 0 len len
2029− putSliceUnsafe arr1 start1 newArr 0 len1
2030− putSliceUnsafe arr2 start2 newArr len1 len2
2031− return newArr
2032−
2033−-- | Really really unsafe, appends the second array into the first array. If
2034−-- the first array does not have enough space it may cause silent data
2035−-- corruption or if you are lucky a segfault.
2036−{-# INLINE spliceUnsafe #-}
2037−spliceUnsafe :: MonadIO m =>
2038− Array a -> Array a -> m (Array a)
2039−spliceUnsafe dst src =
2040− liftIO $ do
2041− let startSrc = arrStart src
2042− srcLen = arrEnd src - startSrc
2043− endDst = arrEnd dst
2044− assertM(endDst + srcLen <= arrBound dst)
2045− putSliceUnsafe src startSrc dst endDst srcLen
2046− return $ dst {arrEnd = endDst + srcLen}
2047−
2048−-- | @spliceWith sizer dst src@ mutates @dst@ to append @src@. If there is no
2049−-- reserved space available in @dst@ it is reallocated to a size determined by
2050−-- the @sizer dstBytes srcBytes@ function, where @dstBytes@ is the size of the
2051−-- first array and @srcBytes@ is the size of the second array, in bytes.
2052−--
2053−-- Note that the returned array may be a mutated version of first array.
2054−--
2055−-- /Pre-release/
2056−{-# INLINE spliceWith #-}
2057−spliceWith :: forall m a. (MonadIO m, Unbox a) =>
2058− (Int -> Int -> Int) -> Array a -> Array a -> m (Array a)
2059−spliceWith sizer dst@(Array _ start end bound) src = do
2060−{-
2061− let f = writeAppendWith (`sizer` byteLength src) (return dst)
2062− in D.fold f (toStreamD src)
2063−-}
2064− assert (end <= bound) (return ())
2065− let srcBytes = arrEnd src - arrStart src
2066−
2067− dst1 <-
2068− if end + srcBytes >= bound
2069− then do
2070− let dstBytes = end - start
2071− newSizeInBytes = sizer dstBytes srcBytes
2072− when (newSizeInBytes < dstBytes + srcBytes)
2073− $ error
2074− $ "splice: newSize is less than the total size "
2075− ++ "of arrays being appended. Please check the "
2076− ++ "sizer function passed."
2077− liftIO $ realloc newSizeInBytes dst
2078− else return dst
2079− spliceUnsafe dst1 src
2080−
2081−-- | The first array is mutated to append the second array. If there is no
2082−-- reserved space available in the first array a new allocation of exact
2083−-- required size is done.
2084−--
2085−-- Note that the returned array may be a mutated version of first array.
2086−--
2087−-- >>> splice = Array.spliceWith (+)
2088−--
2089−-- /Pre-release/
2090−{-# INLINE splice #-}
2091−splice :: (MonadIO m, Unbox a) => Array a -> Array a -> m (Array a)
2092−splice = spliceWith (+)
2093−
2094−-- | Like 'append' but the growth of the array is exponential. Whenever a new
2095−-- allocation is required the previous array size is at least doubled.
2096−--
2097−-- This is useful to reduce allocations when folding many arrays together.
2098−--
2099−-- Note that the returned array may be a mutated version of first array.
2100−--
2101−-- >>> spliceExp = Array.spliceWith (\l1 l2 -> max (l1 * 2) (l1 + l2))
2102−--
2103−-- /Pre-release/
2104−{-# INLINE spliceExp #-}
2105−spliceExp :: (MonadIO m, Unbox a) => Array a -> Array a -> m (Array a)
2106−spliceExp = spliceWith (\l1 l2 -> max (l1 * 2) (l1 + l2))
2107−
2108−-------------------------------------------------------------------------------
2109−-- Splitting
2110−-------------------------------------------------------------------------------
2111−
2112−-- | Drops the separator byte
2113−{-# INLINE breakOn #-}
2114−breakOn :: MonadIO m
2115− => Word8 -> Array Word8 -> m (Array Word8, Maybe (Array Word8))
2116−breakOn sep arr@Array{..} = asPtrUnsafe arr $ \p -> liftIO $ do
2117− -- XXX Instead of using asPtrUnsafe (pinning memory) we can pass unlifted
2118− -- Addr# to memchr and it should be safe (from ghc 8.4).
2119− -- XXX We do not need memchr here, we can use a Haskell equivalent.
2120− loc <- c_memchr p sep (fromIntegral $ byteLength arr)
2121− let sepIndex = loc `minusPtr` p
2122− return $
2123− if loc == nullPtr
2124− then (arr, Nothing)
2125− else
2126− ( Array
2127− { arrContents = arrContents
2128− , arrStart = arrStart
2129− , arrEnd = arrStart + sepIndex -- exclude the separator
2130− , arrBound = arrStart + sepIndex
2131− }
2132− , Just $ Array
2133− { arrContents = arrContents
2134− , arrStart = arrStart + (sepIndex + 1)
2135− , arrEnd = arrEnd
2136− , arrBound = arrBound
2137− }
2138− )
2139−
2140−-- | Create two slices of an array without copying the original array. The
2141−-- specified index @i@ is the first index of the second slice.
2142−--
2143−splitAt :: forall a. Unbox a => Int -> Array a -> (Array a, Array a)
2144−splitAt i arr@Array{..} =
2145− let maxIndex = length arr - 1
2146− in if i < 0
2147− then error "sliceAt: negative array index"
2148− else if i > maxIndex
2149− then error $ "sliceAt: specified array index " ++ show i
2150− ++ " is beyond the maximum index " ++ show maxIndex
2151− else let off = i * SIZE_OF(a)
2152− p = arrStart + off
2153− in ( Array
2154− { arrContents = arrContents
2155− , arrStart = arrStart
2156− , arrEnd = p
2157− , arrBound = p
2158− }
2159− , Array
2160− { arrContents = arrContents
2161− , arrStart = p
2162− , arrEnd = arrEnd
2163− , arrBound = arrBound
2164− }
2165− )
2166−
2167−-------------------------------------------------------------------------------
2168−-- Casting
2169−-------------------------------------------------------------------------------
2170−
2171−-- | Cast an array having elements of type @a@ into an array having elements of
2172−-- type @b@. The array size must be a multiple of the size of type @b@
2173−-- otherwise accessing the last element of the array may result into a crash or
2174−-- a random value.
2175−--
2176−-- /Pre-release/
2177−--
2178−castUnsafe ::
2179−#ifdef DEVBUILD
2180− Unbox b =>
2181−#endif
2182− Array a -> Array b
2183−castUnsafe (Array contents start end bound) =
2184− Array contents start end bound
2185−
2186−-- | Cast an @Array a@ into an @Array Word8@.
2187−--
2188−asBytes :: Array a -> Array Word8
2189−asBytes = castUnsafe
2190−
2191−-- | Cast an array having elements of type @a@ into an array having elements of
2192−-- type @b@. The length of the array should be a multiple of the size of the
2193−-- target element otherwise 'Nothing' is returned.
2194−--
2195−cast :: forall a b. Unbox b => Array a -> Maybe (Array b)
2196−cast arr =
2197− let len = byteLength arr
2198− r = len `mod` SIZE_OF(b)
2199− in if r /= 0
2200− then Nothing
2201− else Just $ castUnsafe arr
2202−
2203−-- XXX We can provide another API for "unsafe" FFI calls passing an unlifted
2204−-- pointer to the FFI call. For unsafe calls we do not need to pin the array.
2205−-- We can pass an unlifted pointer to the FFI routine to avoid GC kicking in
2206−-- before the pointer is wrapped.
2207−--
2208−-- From the GHC manual:
2209−--
2210−-- GHC, since version 8.4, guarantees that garbage collection will never occur
2211−-- during an unsafe call, even in the bytecode interpreter, and further
2212−-- guarantees that unsafe calls will be performed in the calling thread. Making
2213−-- it safe to pass heap-allocated objects to unsafe functions.
2214−
2215−-- Unsafe because of direct pointer operations. The user must ensure that they
2216−-- are writing within the legal bounds of the array. Should we just name it
2217−-- asPtr, the unsafety is implicit for any pointer operations. And we are safe
2218−-- from Haskell perspective because we will be pinning the memory.
2219−
2220−-- | Use an @Array a@ as @Ptr a@. This is useful when we want to pass an array
2221−-- as a pointer to some operating system call or to a "safe" FFI call.
2222−--
2223−-- If the array is not pinned it is copied to pinned memory before passing it
2224−-- to the monadic action.
2225−--
2226−-- /Performance Notes:/ Forces a copy if the array is not pinned. It is advised
2227−-- that the programmer keeps this in mind and creates a pinned array
2228−-- opportunistically before this operation occurs, to avoid the cost of a copy
2229−-- if possible.
2230−--
2231−-- /Unsafe/
2232−--
2233−-- /Pre-release/
2234−--
2235−asPtrUnsafe :: MonadIO m => Array a -> (Ptr a -> m b) -> m b
2236−asPtrUnsafe arr f = do
2237− let contents = arrContents arr
2238− !ptr = Ptr (byteArrayContents#
2239− (unsafeCoerce# (getMutableByteArray# contents)))
2240− -- XXX Check if the array is pinned, if not, copy it to a pinned array
2241− -- XXX We should probably pass to the IO action the byte length of the array
2242− -- as well so that bounds can be checked.
2243− r <- f (ptr `plusPtr` arrStart arr)
2244− liftIO $ touch contents
2245− return r
2246−
2247−-------------------------------------------------------------------------------
2248−-- Equality
2249−-------------------------------------------------------------------------------
2250−
2251−-- | Compare the length of the arrays. If the length is equal, compare the
2252−-- lexicographical ordering of two underlying byte arrays
2253−--
2254−-- /Pre-release/
2255−{-# INLINE cmp #-}
2256−cmp :: MonadIO m => Array a -> Array a -> m Ordering
2257−cmp arr1 arr2 =
2258− liftIO
2259− $ do
2260− let marr1 = getMutableByteArray# (arrContents arr1)
2261− marr2 = getMutableByteArray# (arrContents arr2)
2262− !(I# st1#) = arrStart arr1
2263− !(I# st2#) = arrStart arr2
2264− !(I# len#) = byteLength arr1
2265− case compare (byteLength arr1) (byteLength arr2) of
2266− EQ -> do
2267− r <- liftIO $ IO $ \s# ->
2268− let res =
2269− I#
2270− (compareByteArrays#
2271− (unsafeCoerce# marr1)
2272− st1#
2273− (unsafeCoerce# marr2)
2274− st2#
2275− len#)
2276− in (# s#, res #)
2277− return $ compare r 0
2278− x -> return x
2279−
2280−-------------------------------------------------------------------------------
2281−-- NFData
2282−-------------------------------------------------------------------------------
2283−
2284−-- | Strip elements which match with predicate from both ends.
2285−--
2286−-- /Pre-release/
2287−{-# INLINE strip #-}
2288−strip :: forall a m. (Unbox a, MonadIO m) =>
2289− (a -> Bool) -> Array a -> m (Array a)
2290−strip eq arr@Array{..} = liftIO $ do
2291− st <- getStart arrStart
2292− end <- getLast arrEnd st
2293− return arr {arrStart = st, arrEnd = end, arrBound = end}
2294−
2295− where
2296−
2297− {-
2298− -- XXX This should have the same perf but it does not, investigate.
2299− getStart = do
2300− r <- liftIO $ D.head $ D.findIndices (not . eq) $ toStreamD arr
2301− pure $
2302− case r of
2303− Nothing -> arrEnd
2304− Just i -> PTR_INDEX(arrStart,i,a)
2305− -}
2306−
2307− getStart cur = do
2308− if cur < arrEnd
2309− then do
2310− r <- peekWith arrContents cur
2311− if eq r
2312− then getStart (INDEX_NEXT(cur,a))
2313− else return cur
2314− else return cur
2315−
2316− getLast cur low = do
2317− if cur > low
2318− then do
2319− let prev = INDEX_PREV(cur,a)
2320− r <- peekWith arrContents prev
2321− if eq r
2322− then getLast prev low
2323− else return cur
2324− else return cur
2325−
2326−-- | Given an array sorted in ascending order except the last element being out
2327−-- of order, use bubble sort to place the last element at the right place such
2328−-- that the array remains sorted in ascending order.
2329−--
2330−-- /Pre-release/
2331−{-# INLINE bubble #-}
2332−bubble :: (MonadIO m, Unbox a) => (a -> a -> Ordering) -> Array a -> m ()
2333−bubble cmp0 arr =
2334− when (l > 1) $ do
2335− x <- getIndexUnsafe (l - 1) arr
2336− go x (l - 2)
2337−
2338− where
2339−
2340− l = length arr
2341−
2342− go x i =
2343− if i >= 0
2344− then do
2345− x1 <- getIndexUnsafe i arr
2346− case x `cmp0` x1 of
2347− LT -> do
2348− putIndexUnsafe (i + 1) arr x1
2349− go x (i - 1)
2350− _ -> putIndexUnsafe (i + 1) arr x
2351− else putIndexUnsafe (i + 1) arr x
core/src/Streamly/Internal/Data/Stream/Chunked.hs → core/src/Streamly/Internal/Data/Array/Stream.hsrenamed+117−602

This diff is too big to show here.

core/src/Streamly/Internal/Data/Array/Type.hs+673−116

This diff is too big to show here.

core/src/Streamly/Internal/Serialize/FromBytes.hs → core/src/Streamly/Internal/Data/Binary/Parser.hsrenamed+29−13

This diff is too big to show here.

core/src/Streamly/Internal/Serialize/ToBytes.hs → core/src/Streamly/Internal/Data/Binary/Stream.hsrenamed+46−24

This diff is too big to show here.

core/src/Streamly/Internal/Data/Builder.hs+11−9

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Chunked.hs+25−33

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.hs+119−40

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Fold/Type.hs+402−167

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

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

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/Chunked.hsdeleted−328

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/Chunked/Type.hsdeleted−329

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Parser/ParserD/Type.hs → core/src/Streamly/Internal/Data/Parser/Type.hsrenamed+212−271

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Producer/Source.hs+34−19

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Container.hs+77−69

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Cross.hsdeleted−143

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Exception.hs+369−90

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Lift.hs+70−36

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

This diff is too big to show here.

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

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/StreamD/Transformer.hsdeleted−119

This diff is too big to show here.

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

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Top.hs+257−170

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Transform.hs+1197−282

This diff is too big to show here.

core/src/Streamly/Internal/Data/Stream/Transformer.hs+91−43

This diff is too big to show here.

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

This diff is too big to show here.

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

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/Stream/StreamK/Transformer.hs → core/src/Streamly/Internal/Data/StreamK/Transformer.hsrenamed+8−8

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

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unboxed.hs → core/src/Streamly/Internal/Data/Unbox.hsrenamed+344−276

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Data/Unfold.hs+34−197

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

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/Dir.hs+70−23

This diff is too big to show here.

core/src/Streamly/Internal/FileSystem/File.hs+32−29

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Array.hs+6

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Parser.hs+354−25

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/Stream.hs+87−79

This diff is too big to show here.

core/src/Streamly/Internal/Unicode/String.hs+17−12

This diff is too big to show here.

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

This diff is too big to show here.

core/src/Streamly/Unicode/Stream.hs+14−10

This diff is too big to show here.

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

This diff is too big to show here.

core/src/inline.hs+1−1

This diff is too big to show here.

core/streamly-core.cabal+197−115

This diff is too big to show here.

docs/Developer/Benchmarks.md+8

This diff is too big to show here.

docs/Developer/Contributing.md+1−2

This diff is too big to show here.

docs/Developer/MAINTAINING.md+8−11

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/Developer/paths.rst+25−2

This diff is too big to show here.

docs/Documentation.mdnew file+5

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

docs/User/HowTo/Compiling.md+36−14

This diff is too big to show here.

docs/User/HowTo/faq.md+1−1

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

This diff is too big to show here.

docs/User/ProjectRelated/Changelog.md → docs/User/Project/Changelog.mdrenamed+92−32

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

This diff is too big to show here.

docs/User/Tutorials/README.mddeleted−166

This diff is too big to show here.

docs/User/Tutorials/ReactiveProgramming.hs+2

This diff is too big to show here.

docs/User/Tutorials/Tutorial.hs+2

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/setup-and-usage.md → docs/User/Tutorials/getting-started.mdrenamed+29−26

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/Introduction.md → docs/User/Tutorials/quick-overview.mdrenamed+21−42

This diff is too big to show here.

docs/User/Tutorials/why-haskell-streamly.md+5

This diff is too big to show here.

docs/streamly-docs.cabal+8−6

This diff is too big to show here.

hie.yaml+24−12

This diff is too big to show here.

src/Streamly.hsdeleted−624

This diff is too big to show here.

src/Streamly/Data/Array/Foreign.hs+3−3

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Data/Fold/Tee.hs+2−1

This diff is too big to show here.

src/Streamly/Data/Stream/Concurrent.hsdeleted−184

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Data/Stream/MkType.hs+37−13

This diff is too big to show here.

src/Streamly/Data/Stream/Prelude.hs+217−15

This diff is too big to show here.

src/Streamly/Data/Stream/Time.hsdeleted−37

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Fold/Concurrent/Channel.hs+31−10

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/SVar.hs+1

This diff is too big to show here.

src/Streamly/Internal/Data/SmallArray.hs+7−8

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Ahead.hs+17−4

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Concurrent.hs+223−97

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Eliminate.hs+126−35

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/IsStream/Expand.hs+19−15

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Exception/Lifted.hs → src/Streamly/Internal/Data/Stream/Lifted.hsrenamed+19−17

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/MkType.hs+40−46

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Parallel.hs+37−115

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Data/Stream/Serial.hs+187−103

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Linux.hs+15−9

This diff is too big to show here.

src/Streamly/Internal/FileSystem/Event/Windows.hs+11−8

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Network/Inet/TCP.hs+89−48

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Internal/Unicode/Char.hs+11−10

This diff is too big to show here.

src/Streamly/Memory/Array.hsdeleted−74

This diff is too big to show here.

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

This diff is too big to show here.

src/Streamly/Network/Socket.hs+16−30

This diff is too big to show here.

src/Streamly/Prelude.hs+10−4

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

This diff is too big to show here.

targets/Targets.hs+106−90

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Array/Stream.hs+4−3

This diff is too big to show here.

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

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/Array/Mut.hs → test/Streamly/Test/Data/MutArray.hsrenamed+5−5

This diff is too big to show here.

test/Streamly/Test/Data/Parser.hs+282−141

This diff is too big to show here.

test/Streamly/Test/Data/Parser/Chunked.hsdeleted−1239

This diff is too big to show here.

test/Streamly/Test/Data/Parser/ParserD.hs → test/Streamly/Test/Data/ParserK.hsrenamed+19−14

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/Data/Stream/Concurrent.hs+126−82

This diff is too big to show here.

test/Streamly/Test/Data/Unbox.hs+318−50

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/Streamly/Test/FileSystem/Handle.hs+2−2

This diff is too big to show here.

test/Streamly/Test/Network/Inet/TCP.hs+5−4

This diff is too big to show here.

test/Streamly/Test/Network/Socket.hs+5−4

This diff is too big to show here.

test/Streamly/Test/Prelude/Serial.hs+42−35

This diff is too big to show here.

test/Streamly/Test/Prelude/Top.hs+1−1

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

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

This diff is too big to show here.

test/streamly-tests.cabal+99−29

This diff is too big to show here.