Skip to content

Ddoc: clean up changelog #4418

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
DmitryOlshansky merged 4 commits into from
Jun 8, 2016
Merged

Ddoc: clean up changelog #4418

Changes from all commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
cf575d9
Ddoc: remove (X)REF from inside LNAME2
aG0aep6G Jun 8, 2016
6ad3ed0
Ddoc: remove early closing parenthesis
aG0aep6G Jun 8, 2016
d4ee238
Ddoc: typo
aG0aep6G Jun 8, 2016
91d0450
Ddoc: use UL for more readability
aG0aep6G Jun 8, 2016
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
30 changes: 16 additions & 14 deletions changelog.dd
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -53,9 +53,10 @@ $(BUGSTITLE Library Changes,

$(BUGSTITLE Library Changes,

$(LI $(LNAME2 std-digest-murmurhash, Implementation of $(XREF std.digest, murmurhash).)
$(P MurmurHash is a non-cryptographic hash function suitable for general
hash-based lookup. It is optimized for x86 architectures.
$(LI $(LNAME2 std-digest-murmurhash, Implementation of `std.digest.murmurhash`).
$(P $(MREF std,digest,murmurhash) has been added. MurmurHash is a
non-cryptographic hash function suitable for general hash-based lookup. It
is optimized for x86 architectures.
)
------
// Computing the 32-bits hash value of an int array using the convenient digest template.
Expand All @@ -75,7 +76,7 @@ $(LI $(LNAME2 process, Process creation in `std.process` was sped up on Posix.)
)

$(LI $(LNAME2 std-algorithm-iteration-cumulativeFold,
`algorithm.iteration.cumulativeFold` was added.))
`algorithm.iteration.cumulativeFold` was added.)

$(P $(REF cumulativeFold, std,algorithm,iteration) returns the successive
reduced values of an input range.)
Expand Down Expand Up @@ -116,7 +117,7 @@ assert(m.front[1] == "12");
-------
)

$(LI $(LNAME2 regex-with-matches, $(REF splitter, std,regex) now supports keeping the
$(LI $(LNAME2 regex-with-matches, `std.regex.splitter` now supports keeping the
pattern matches in the resulting range.)
-------
import std.regex;
Expand Down Expand Up @@ -162,14 +163,15 @@ $(LI $(LNAME2 slice_ptr, `ptr` property and public constructor were added to

$(LI $(LNAME2 slice_alloc, `slice`, `shape`, `ndarray`, and other utilities
were added to `std.experimental.ndslice.slice`.)
$(P
$(REF shape, std,experimental,ndslice,slice)
$(REF slice, std,experimental,ndslice,slice),
$(REF makeSlice, std,experimental,ndslice,slice),
$(REF ndarray, std,experimental,ndslice,slice), and
$(REF makeNdarray, std,experimental,ndslice,slice)
allocation utilities were added to $(MREF std,experimental,ndslice)
)
$(P These utility functions have been added to
$(MREF std,experimental,ndslice):)
$(UL
$(LI $(REF shape, std,experimental,ndslice,slice),)
$(LI $(REF slice, std,experimental,ndslice,slice),)
$(LI $(REF makeSlice, std,experimental,ndslice,slice),)
$(LI $(REF ndarray, std,experimental,ndslice,slice), and)
$(LI $(REF makeNdarray, std,experimental,ndslice,slice).)
)
$(P Example: Transposing common 2D array using `ndslice`)
-----
import std.experimental.ndslice;
Expand All @@ -186,7 +188,7 @@ assert(ar == [[0, 3], [1, 4], [2, 5]]);
)

$(LI $(LNAME2 slice_iota, `iotaSlice` lazy tensor was added to `std.experimental.ndslice.selection`.)
%(P $(REF iotaSlice, std,experimental,ndslice,selection) is the fastest possible `Slice`.)
$(P $(REF iotaSlice, std,experimental,ndslice,selection) is the fastest possible `Slice`.)
---
import std.experimental.ndslice;

Expand Down