forked from dlang/phobos
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathchangelog.dd
More file actions
78 lines (61 loc) · 2.66 KB
/
changelog.dd
File metadata and controls
78 lines (61 loc) · 2.66 KB
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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
Ddoc
$(COMMENT Pending changelog for 2.071. This will get copied to dlang.org and
cleared when master gets merged into stable prior to 2.071.
)
$(BUGSTITLE Library Changes,
$(LI $(REF GCAllocator.goodAllocSize, std,experimental,allocator,gc_allocator)
was added.)
$(LI High-level API of $(STDMODREF net_curl, std.net.curl) now uses $(XREF array, Appender)
for received content. Which generally makes all calls slightly faster. Up to 200ms for large
amounts of data.)
$(LI $(XREF std_meta, Repeat) was added to obtain a repeating
$(XREF std_meta, AliasSeq) consisting of template arguments.)
$(LI $(D fold) was added as an alternative to $(D reduce) with argument order swapped.)
$(LI $(RELATIVE_LINK2 nextPow2, Added nextPow2 and truncPow2 to std.math.))
$(LI $(REF bsf core,bitop), $(REF bsr core,bitop), and $(REF popcnt, core,bitop) now
work with ulongs on 32 bit systems.)
$(LI $(REF topN std,algorithm,sorting) is now 5% - 7% faster.)
$(LI $(RELATIVE_LINK2 unary, Unary overloads of $(REF startsWith std,algorithm,searching) and
$(REF endsWith std,algorithm,searching) were added.))
$(LI $(RELATIVE_LINK2 maxCount, $(REF maxCount std,algorithm,searching) and
$(REF maxPos std,algorithm,searching) were added.))
)
$(BUGSTITLE Library Changes,
$(LI $(LNAME2 nextPow2, Added nextPow2 and truncPow2 to std.math.)
$(P $(REF nextPow2, std,math) and $(REF truncPow2, std,math) are functions for
rounding numbers to powers of two.)
------
import std.math;
assert(nextPow2(10) == 16);
assert(nextPow2(4000) == 4096);
assert(truncPow2(10) == 8);
assert(truncPow2(4000) == 2048);
------
)
$(LI $(LNAME2 unary, Unary overloads of $(REF startsWith std,algorithm,searching) and
$(REF endsWith std,algorithm,searching) were added.)
------
import std.algorithm.searching;
import std.ascii : isAlpha;
assert("abc".endsWith!isAlpha);
assert(!"ab1".endsWith!(a => a.isAlpha));
assert("abc".startsWith!isAlpha);
assert(!"1ab".startsWith!isAlpha);
------
)
$(LI $(LNAME2 maxPos, $(REF maxCount std,algorithm,searching) and
$(REF maxPos std,algorithm,searching) were added.)
$(P Previous to this addition, in order to get the number of the greatest
elements, you had to use `minCount!"a > b"`, which was very confusing.
This change adds convenience functions to fix this issue.)
)
)
Macros:
TITLE=Change Log
BUGSTITLE = <div class="bugsfixed">$(H4 $1) $(OL $2 )</div>
RELATIVE_LINK2=<a href="#$1">$+</a>
LNAME2=<a class="anchor" title="Permalink to this section" id="$1" href="#$1">$+</a>
STDMODREF = <a href="phobos/std_$1.html">$2</a>
XREF = <a href="phobos/std_$1.html#$2">$2</a>
CXREF = <a href="phobos/core_$1.html#$2">$2</a>
BOOKTABLE = <table><caption>$1</caption>$+</table>