mirrors/phobos
1
0
Fork 0
mirror of https://github.com/dlang/phobos.git synced 2025-04-28 22:21:09 +03:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Merge pull request #6606 from wilzbach/merge_stable

Browse source 
Merge remote-tracking branch 'upstream/stable' into merge_stable
merged-on-behalf-of: Petar Kirov <ZombineDev@users.noreply.github.com>
This commit is contained in:
The Dlang Bot 2018-06-24 15:28:17 +02:00 • committed by GitHub
commit fcc98f8170
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
2 changed files with 29 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

19
changelog/std-algorithm-iteration-joiner.dd Normal file
View file

@ -0,0 +1,19 @@
The performance of `std.algorithm.iteration.joiner` has been improved
$(H4 DMD)
$(CONSOLE
> dmd -O -inline -release ./joiner.d && ./joiner
before.joiner = 57 secs, 834 ms, 289 μs, and 3 hnsecs
new.joiner = 44 secs, 936 ms, 706 μs, and 5 hnsecs
)
$(H4 LDC)
$(CONSOLE
> ldmd -O3 -release -inline joiner.d && ./joiner
before.joiner = 5 secs, 180 ms, 193 μs, and 7 hnsecs
new.joiner = 3 secs, 168 ms, 560 μs, and 6 hnsecs
)
The benchmark code can be found $(LINK2 https://gist.github.com/wilzbach/ffd5d20639766a831fd4b1962572897a, here).

13
std/uni.d
View file

@ -9003,16 +9003,18 @@ if (isSomeString!S || (isRandomAccessRange!S && hasLength!S && hasSlicing!S && i
{ {
import std.array : appender, array; import std.array : appender, array;
import std.ascii : isASCII; import std.ascii : isASCII;
import std.utf : byDchar; import std.utf : byDchar, codeLength;
alias C = ElementEncodingType!S;
auto r = s.byDchar; auto r = s.byDchar;
for (size_t i; !r.empty; ++i, r.popFront()) for (size_t i; !r.empty; i += r.front.codeLength!C , r.popFront())
{ {
auto cOuter = r.front; auto cOuter = r.front;
ushort idx = indexFn(cOuter); ushort idx = indexFn(cOuter);
if (idx == ushort.max) if (idx == ushort.max)
continue; continue;
auto result = appender!(ElementEncodingType!S[])(); auto result = appender!(C[])();
result.reserve(s.length); result.reserve(s.length);
result.put(s[0 .. i]); result.put(s[0 .. i]);
foreach (dchar c; s[i .. $].byDchar) foreach (dchar c; s[i .. $].byDchar)
@ -9062,6 +9064,11 @@ if (isSomeString!S || (isRandomAccessRange!S && hasLength!S && hasSlicing!S && i
assert(s == "abcdefghij"); assert(s == "abcdefghij");
} }
@safe unittest // 18993
{
static assert(`몬스터/A`.toLower.length == `몬스터/a`.toLower.length);
}
// generic toUpper/toLower on whole range, returns range // generic toUpper/toLower on whole range, returns range
private auto toCaser(alias indexFn, uint maxIdx, alias tableFn, alias asciiConvert, Range)(Range str) private auto toCaser(alias indexFn, uint maxIdx, alias tableFn, alias asciiConvert, Range)(Range str)