diff options
| author | Lukas Larsson <[email protected]> | 2018-11-14 09:34:20 +0100 |
|---|---|---|
| committer | Lukas Larsson <[email protected]> | 2018-11-14 09:34:20 +0100 |
| commit | d322536cf06e8ac8ae1361b66ba2574f9790685f (patch) | |
| tree | d658e736bb86054669134a91b767406993cf3890 /lib/stdlib | |
| parent | a2d97d7039cf69595684b3c61ad93d3a208dcf0a (diff) | |
| parent | b0c054fe7c8f6467f3309e47ec62cfc9300bcc14 (diff) | |
| download | otp-d322536cf06e8ac8ae1361b66ba2574f9790685f.tar.gz otp-d322536cf06e8ac8ae1361b66ba2574f9790685f.tar.bz2 otp-d322536cf06e8ac8ae1361b66ba2574f9790685f.zip | |
Merge branch 'maint'
* maint:
Updated OTP version
Prepare release
Optimize operator '--' and yield on large inputs
Diffstat (limited to 'lib/stdlib')
| -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 5a6a3134e7..64b97fad7f 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 17bb12e548..bd2f3b448b 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) -> |