diff options
author | Lukas Larsson <[email protected]> | 2018-11-14 09:34:05 +0100 |
---|---|---|
committer | Lukas Larsson <[email protected]> | 2018-11-14 09:34:05 +0100 |
commit | b0c054fe7c8f6467f3309e47ec62cfc9300bcc14 (patch) | |
tree | a63bf718709752cbea4e0eb2a4ddaf1a08ea21d7 /lib | |
parent | 56af71ad0a1127aad96b523f09618280f77cdf94 (diff) | |
parent | 1283ca3bc4bba3381f8fd1f59fb62780d3e17472 (diff) | |
download | otp-b0c054fe7c8f6467f3309e47ec62cfc9300bcc14.tar.gz otp-b0c054fe7c8f6467f3309e47ec62cfc9300bcc14.tar.bz2 otp-b0c054fe7c8f6467f3309e47ec62cfc9300bcc14.zip |
Merge branch 'maint-18' into maint
* maint-18:
Updated OTP version
Prepare release
Optimize operator '--' and yield on large inputs
Conflicts:
OTP_VERSION
erts/doc/src/notes.xml
erts/emulator/beam/erl_alloc.types
erts/emulator/beam/erl_bif_lists.c
erts/vsn.mk
lib/stdlib/doc/src/notes.xml
lib/stdlib/vsn.mk
make/otp_version_tickets
otp_versions.table
Diffstat (limited to 'lib')
-rw-r--r-- | lib/stdlib/doc/src/notes.xml | 15 | ||||
-rw-r--r-- | lib/stdlib/test/lists_SUITE.erl | 7 |
2 files changed, 22 insertions, 0 deletions
diff --git a/lib/stdlib/doc/src/notes.xml b/lib/stdlib/doc/src/notes.xml index befbabe8de..039f087708 100644 --- a/lib/stdlib/doc/src/notes.xml +++ b/lib/stdlib/doc/src/notes.xml @@ -1673,6 +1673,21 @@ </section> +<section><title>STDLIB 2.8.0.1</title> + + <section><title>Improvements and New Features</title> + <list> + <item> + <p>List subtraction (The <c>--</c> operator) will now + yield properly on large inputs.</p> + <p> + Own Id: OTP-15371</p> + </item> + </list> + </section> + +</section> + <section><title>STDLIB 2.8</title> <section><title>Fixed Bugs and Malfunctions</title> diff --git a/lib/stdlib/test/lists_SUITE.erl b/lib/stdlib/test/lists_SUITE.erl index 9a94bcc012..984b51e7ae 100644 --- a/lib/stdlib/test/lists_SUITE.erl +++ b/lib/stdlib/test/lists_SUITE.erl @@ -2604,6 +2604,13 @@ subtract(Config) when is_list(Config) -> %% certain thresholds, and we need proper coverage for all corner cases. [sub_thresholds(N) || N <- lists:seq(0, 32)], + %% Trapping, both crashing and otherwise. + [sub_trapping(N) || N <- lists:seq(0, 18)], + + %% The current implementation chooses which algorithm to use based on + %% certain thresholds, and we need proper coverage for all corner cases. + [sub_thresholds(N) || N <- lists:seq(0, 32)], + ok. sub_non_matching(A, B) -> |