86 changes: 43 additions & 43 deletions std/algorithm/iteration.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -122,7 +122,7 @@ The result is then directly returned when $(D front) is called,
rather than re-evaluated.
This can be a useful function to place in a chain, after functions
that have expensive evaluation, as a lazy alternative to $(XREF array,array).
that have expensive evaluation, as a lazy alternative to $(REF array, std,array).
In particular, it can be placed after a call to $(D map), or before a call
to $(D filter).
Expand All @@ -136,7 +136,7 @@ $(D cache) does not provide random access primitives,
as $(D cache) would be unable to cache the random accesses.
If $(D Range) provides slicing primitives,
then $(D cache) will provide the same slicing primitives,
but $(D hasSlicing!Cache) will not yield true (as the $(XREF_PACK _range,primitives,hasSlicing)
but $(D hasSlicing!Cache) will not yield true (as the $(REF hasSlicing, std,_range,primitives)
trait also checks for random access).
Params:
Expand Down Expand Up @@ -205,7 +205,7 @@ Tip: $(D cache) is eager when evaluating elements. If calling front on the
underlying _range has a side effect, it will be observeable before calling
front on the actual cached _range.
Furthermore, care should be taken composing $(D cache) with $(XREF _range,take).
Furthermore, care should be taken composing $(D cache) with $(REF take, std,_range).
By placing $(D take) before $(D cache), then $(D cache) will be "aware"
of when the _range ends, and correctly stop caching elements when needed.
If calling front has no side effect though, placing $(D take) after $(D cache)
Expand Down Expand Up @@ -840,13 +840,13 @@ can be avoided by explicitly specifying a predicate lambda with a
$(D lazy) parameter.
$(D each) also supports $(D opApply)-based iterators, so it will work
with e.g. $(XREF parallelism, parallel).
with e.g. $(REF parallel, std,parallelism).
Params:
pred = predicate to apply to each element of the range
r = range or iterable over which each iterates
See_Also: $(XREF range,tee)
See_Also: $(REF tee, std,range)
*/
template each(alias pred = "a")
Expand Down Expand Up @@ -1029,7 +1029,7 @@ unittest
$(D auto filter(Range)(Range rs) if (isInputRange!(Unqual!Range));)
Implements the higher order _filter function. The predicate is passed to
$(XREF functional,unaryFun), and can either accept a string, or any callable
$(REF unaryFun, std,functional), and can either accept a string, or any callable
that can be executed via $(D pred(element)).
Params:
Expand Down Expand Up @@ -1232,9 +1232,9 @@ private struct FilterResult(alias pred, Range)
* finding the last element in the range that satisfies the filtering
* condition (in addition to finding the first one). The advantage is
* that the filtered range can be spanned from both directions. Also,
* $(XREF range, retro) can be applied against the filtered range.
* $(REF retro, std,range) can be applied against the filtered range.
*
* The predicate is passed to $(XREF functional,unaryFun), and can either
* The predicate is passed to $(REF unaryFun, std,functional), and can either
* accept a string, or any callable that can be executed via $(D pred(element)).
*
* Params:
Expand Down Expand Up @@ -1325,13 +1325,13 @@ Similarly to $(D uniq), $(D group) produces a range that iterates over unique
consecutive elements of the given range. Each element of this range is a tuple
of the element and the number of times it is repeated in the original range.
Equivalence of elements is assessed by using the predicate $(D pred), which
defaults to $(D "a == b"). The predicate is passed to $(XREF functional,binaryFun),
defaults to $(D "a == b"). The predicate is passed to $(REF binaryFun, std,functional),
and can either accept a string, or any callable that can be executed via
$(D pred(element, element)).
Params:
pred = Binary predicate for determining equivalence of two elements.
r = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range) to
r = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to
iterate over.
Returns: A range of elements of type $(D Tuple!(ElementType!R, uint)),
Expand Down Expand Up @@ -1772,8 +1772,8 @@ unittest
* Chunks an input range into subranges of equivalent adjacent elements.
*
* Equivalence is defined by the predicate $(D pred), which can be either
* binary, which is passed to $(XREF functional,binaryFun), or unary, which is
* passed to $(XREF functional,unaryFun). In the binary form, two _range elements
* binary, which is passed to $(REF binaryFun, std,functional), or unary, which is
* passed to $(REF unaryFun, std,functional). In the binary form, two _range elements
* $(D a) and $(D b) are considered equivalent if $(D pred(a,b)) is true. In
* unary form, two elements are considered equivalent if $(D pred(a) == pred(b))
* is true.
Expand Down Expand Up @@ -2014,9 +2014,9 @@ joined directly without anything in between them (often called $(D flatten)
in other languages).
Params:
r = An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) of input
r = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of input
ranges to be joined.
sep = A $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range) of
sep = A $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) of
element(s) to serve as separators in the joined range.
Returns:
Expand All @@ -2025,7 +2025,7 @@ both outer and inner ranges of $(D RoR) are forward ranges; otherwise it will
be only an input range.
See_also:
$(XREF range,chain), which chains a sequence of ranges with compatible elements
$(REF chain, std,range), which chains a sequence of ranges with compatible elements
into a single range.
*/
auto joiner(RoR, Separator)(RoR r, Separator sep)
Expand Down Expand Up @@ -2626,7 +2626,7 @@ template reduce(fun...) if (fun.length >= 1)
/++
Seed version. The seed should be a single value if $(D fun) is a
single function. If $(D fun) is multiple functions, then $(D seed)
should be a $(XREF typecons,Tuple), with one field per function in $(D f).
should be a $(REF Tuple, std,typecons), with one field per function in $(D f).
For convenience, if the seed is const, or has qualified fields, then
$(D reduce) will operate on an unqualified copy. If this happens
Expand Down Expand Up @@ -2768,7 +2768,7 @@ Sometimes it is very useful to compute multiple aggregates in one pass.
One advantage is that the computation is faster because the looping overhead
is shared. That's why $(D reduce) accepts multiple functions.
If two or more functions are passed, $(D reduce) returns a
$(XREF typecons, Tuple) object with one member per passed-in function.
$(REF Tuple, std,typecons) object with one member per passed-in function.
The number of seeds must be correspondingly increased.
*/
@safe unittest
Expand Down Expand Up @@ -3085,8 +3085,8 @@ This function is also known as
$(WEB mathworld.wolfram.com/CumulativeSum.html, Cumulative Sum).
Returns:
The function returns a range containing the consecutive reduced values. If
there is more than one `fun`, the element type will be $(XREF typecons,
Tuple) containing one element for each `fun`.
there is more than one `fun`, the element type will be $(REF Tuple,
std,typecons) containing one element for each `fun`.
See_Also:
$(WEB en.wikipedia.org/wiki/Prefix_sum, Prefix Sum)
Expand Down Expand Up @@ -3118,8 +3118,8 @@ if (fun.length >= 1)

/++
Seed version. The seed should be a single value if `fun` is a single
function. If `fun` is multiple functions, then `seed` should be a $(XREF
typecons, Tuple), with one field per function in `f`.
function. If `fun` is multiple functions, then `seed` should be a
$(REF Tuple, std,typecons), with one field per function in `f`.
For convenience, if the seed is const, or has qualified fields, then
`cumulativeFold` will operate on an unqualified copy. If this happens
then the returned type will not perfectly match `S`.
Expand Down Expand Up @@ -3288,8 +3288,8 @@ if (fun.length >= 1)
Sometimes it is very useful to compute multiple aggregates in one pass.
One advantage is that the computation is faster because the looping overhead
is shared. That's why `cumulativeFold` accepts multiple functions.
If two or more functions are passed, `cumulativeFold` returns a $(XREF typecons,
Tuple) object with one member per passed-in function.
If two or more functions are passed, `cumulativeFold` returns a $(REF Tuple,
std,typecons) object with one member per passed-in function.
The number of seeds must be correspondingly increased.
*/
@safe unittest
Expand Down Expand Up @@ -3459,7 +3459,7 @@ Two adjacent separators are considered to surround an empty element in
the split range. Use $(D filter!(a => !a.empty)) on the result to compress
empty elements.
The predicate is passed to $(XREF functional,binaryFun), and can either accept
The predicate is passed to $(REF binaryFun, std,functional), and can either accept
a string, or any callable that can be executed via $(D pred(element, s)).
If the empty range is given, the result is a range with one empty
Expand All @@ -3473,7 +3473,7 @@ below).
Params:
pred = The predicate for comparing each element with the separator,
defaulting to $(D "a == b").
r = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range) to be
r = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to be
split. Must support slicing and $(D .length).
s = The element to be treated as the separator between range segments to be
split.
Expand All @@ -3488,7 +3488,7 @@ Returns:
likewise.
See_Also:
$(XREF regex, _splitter) for a version that splits using a regular
$(REF _splitter, std,regex) for a version that splits using a regular
expression defined separator.
*/
auto splitter(alias pred = "a == b", Range, Separator)(Range r, Separator s)
Expand Down Expand Up @@ -3744,7 +3744,7 @@ if (is(typeof(binaryFun!pred(r.front, s)) : bool)
Similar to the previous overload of $(D splitter), except this one uses another
range as a separator. This can be used with any narrow string type or sliceable
range type, but is most popular with string types. The predicate is passed to
$(XREF functional,binaryFun), and can either accept a string, or any callable
$(REF binaryFun, std,functional), and can either accept a string, or any callable
that can be executed via $(D pred(r.front, s.front)).
Two adjacent separators are considered to surround an empty element in
Expand All @@ -3754,9 +3754,9 @@ empty elements.
Params:
pred = The predicate for comparing each element with the separator,
defaulting to $(D "a == b").
r = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range) to be
r = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to be
split.
s = The $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range) to
s = The $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) to
be treated as the separator between segments of $(D r) to be split.
Constraints:
Expand All @@ -3768,7 +3768,7 @@ Returns:
is a forward range or bidirectional range, the returned range will be
likewise.
See_Also: $(XREF regex, _splitter) for a version that splits using a regular
See_Also: $(REF _splitter, std,regex) for a version that splits using a regular
expression defined separator.
*/
auto splitter(alias pred = "a == b", Range, Separator)(Range r, Separator s)
Expand Down Expand Up @@ -4017,7 +4017,7 @@ if (is(typeof(binaryFun!pred(r.front, s.front)) : bool)
Similar to the previous overload of $(D splitter), except this one does not use a separator.
Instead, the predicate is an unary function on the input range's element type.
The $(D isTerminator) predicate is passed to $(XREF functional,unaryFun) and can
The $(D isTerminator) predicate is passed to $(REF unaryFun, std,functional) and can
either accept a string, or any callable that can be executed via $(D pred(element, s)).
Two adjacent separators are considered to surround an empty element in
Expand All @@ -4026,7 +4026,7 @@ empty elements.
Params:
isTerminator = The predicate for deciding where to split the range.
input = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range) to
input = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to
be split.
Constraints:
Expand All @@ -4037,7 +4037,7 @@ Returns:
is a forward range or bidirectional range, the returned range will be
likewise.
See_Also: $(XREF regex, _splitter) for a version that splits using a regular
See_Also: $(REF _splitter, std,regex) for a version that splits using a regular
expression defined separator.
*/
auto splitter(alias isTerminator, Range)(Range input)
Expand Down Expand Up @@ -4276,7 +4276,7 @@ Params:
s = The string to be split.
Returns:
An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) of slices of
An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of slices of
the original string split by whitespace.
+/
auto splitter(C)(C[] s)
Expand Down Expand Up @@ -4459,15 +4459,15 @@ if (isSomeChar!C)
// sum
/**
Sums elements of $(D r), which must be a finite
$(XREF_PACK_NAMED range,primitives,isInputRange,input range). Although
$(REF_ALTTEXT input range, isInputRange, std,range,primitives). Although
conceptually $(D sum(r)) is equivalent to $(LREF fold)!((a, b) => a +
b)(r, 0), $(D sum) uses specialized algorithms to maximize accuracy,
as follows.
$(UL
$(LI If $(D $(XREF_PACK range,primitives,ElementType)!R) is a floating-point
$(LI If $(D $(REF ElementType, std,range,primitives)!R) is a floating-point
type and $(D R) is a
$(XREF_PACK_NAMED range,primitives,isRandomAccessRange,random-access range) with
$(REF_ALTTEXT random-access range, isRandomAccessRange, std,range,primitives) with
length and slicing, then $(D sum) uses the
$(WEB en.wikipedia.org/wiki/Pairwise_summation, pairwise summation)
algorithm.)
Expand Down Expand Up @@ -4754,17 +4754,17 @@ Lazily iterates unique consecutive elements of the given range (functionality
akin to the $(WEB wikipedia.org/wiki/_Uniq, _uniq) system
utility). Equivalence of elements is assessed by using the predicate
$(D pred), by default $(D "a == b"). The predicate is passed to
$(XREF functional,binaryFun), and can either accept a string, or any callable
$(REF binaryFun, std,functional), and can either accept a string, or any callable
that can be executed via $(D pred(element, element)). If the given range is
bidirectional, $(D uniq) also yields a bidirectional range.
Params:
pred = Predicate for determining equivalence between range elements.
r = An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) of
r = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of
elements to filter.
Returns:
An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) of
An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of
consecutively unique elements in the original range. If $(D r) is also a
forward range or bidirectional range, the returned range will be likewise.
*/
Expand Down Expand Up @@ -4883,11 +4883,11 @@ Lazily computes all _permutations of $(D r) using $(WEB
en.wikipedia.org/wiki/Heap%27s_algorithm, Heap's algorithm).
Returns:
A forward range the elements of which are an $(XREF range,
indexed) view into $(D r).
A forward range the elements of which are an $(REF indexed, std,range)
view into $(D r).
See_Also:
$(XREF_PACK algorithm,sorting,nextPermutation).
$(REF nextPermutation, std,algorithm,sorting).
*/
Permutations!Range permutations(Range)(Range r)
if (isRandomAccessRange!Range && hasLength!Range)
Expand Down
26 changes: 13 additions & 13 deletions std/algorithm/mutation.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -385,7 +385,7 @@ range elements, different types of ranges are accepted:

/**
To _copy at most $(D n) elements from a range, you may want to use
$(XREF range, take):
$(REF take, std,range):
*/
@safe unittest
{
Expand All @@ -412,7 +412,7 @@ use $(LREF filter):
}

/**
$(XREF range, retro) can be used to achieve behavior similar to
$(REF retro, std,range) can be used to achieve behavior similar to
$(WEB sgi.com/tech/stl/copy_backward.html, STL's copy_backward'):
*/
@safe unittest
Expand Down Expand Up @@ -474,7 +474,7 @@ Assigns $(D value) to each element of input _range $(D range).
Params:
range = An
$(XREF_PACK_NAMED _range,primitives,isInputRange,input _range)
$(REF_ALTTEXT input _range, isInputRange, std,_range,primitives)
that exposes references to its elements and has assignable
elements
value = Assigned to each element of range
Expand Down Expand Up @@ -588,10 +588,10 @@ $(D range) does not have to be a multiple of the length of $(D
filler). If $(D filler) is empty, an exception is thrown.
Params:
range = An $(XREF_PACK_NAMED _range,primitives,isInputRange,input _range)
range = An $(REF_ALTTEXT input _range, isInputRange, std,_range,primitives)
that exposes references to its elements and has assignable elements.
filler = The
$(XREF_PACK_NAMED _range,primitives,isForwardRange,forward _range)
$(REF_ALTTEXT forward _range, isForwardRange, std,_range,primitives)
representing the _fill pattern.
*/
void fill(Range1, Range2)(Range1 range, Range2 filler)
Expand Down Expand Up @@ -710,7 +710,7 @@ Assumes that the elements of the range are uninitialized.
Params:
range = An
$(XREF_PACK_NAMED _range,primitives,isInputRange,input _range)
$(REF_ALTTEXT input _range, isInputRange, std,_range,primitives)
that exposes references to its elements and has assignable
elements
Expand Down Expand Up @@ -1277,9 +1277,9 @@ This precondition will be asserted. If you cannot ensure there is enough room in
`tgt` to accommodate all of `src` use $(LREF moveSome) instead.
Params:
src = An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) with
src = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) with
movable elements.
tgt = An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) with
tgt = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) with
elements that elements from $(D src) can be moved into.
Returns: The leftover portion of $(D tgt) after all elements from $(D src) have
Expand Down Expand Up @@ -1384,9 +1384,9 @@ element `b` in `tgt`, in increasing order, stopping when either range has been
exhausted.
Params:
src = An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) with
src = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) with
movable elements.
tgt = An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) with
tgt = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) with
elements that elements from $(D src) can be moved into.
Returns: The leftover portions of the two ranges after one or the other of the
Expand Down Expand Up @@ -2524,9 +2524,9 @@ be of different types but must have the same element type and support
swapping.
Params:
r1 = an $(XREF_PACK_NAMED _range,primitives,isInputRange,input _range)
r1 = an $(REF_ALTTEXT input _range, isInputRange, std,_range,primitives)
with swappable elements
r2 = an $(XREF_PACK_NAMED _range,primitives,isInputRange,input _range)
r2 = an $(REF_ALTTEXT input _range, isInputRange, std,_range,primitives)
with swappable elements
Returns:
Expand Down Expand Up @@ -2565,7 +2565,7 @@ uninitializedFill are equivalent).
Params:
range = An
$(XREF_PACK_NAMED _range,primitives,isInputRange,input _range)
$(REF_ALTTEXT input _range, isInputRange, std,_range,primitives)
that exposes references to its elements and has assignable
elements
value = Assigned to each element of range
Expand Down
63 changes: 31 additions & 32 deletions std/algorithm/searching.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -33,7 +33,7 @@ $(T2 endsWith,
$(D endsWith("rocks", "ks")) returns $(D true).)
$(T2 find,
$(D find("hello world", "or")) returns $(D "orld") using linear search.
(For binary search refer to $(XREF range,sortedRange).))
(For binary search refer to $(REF sortedRange, std,range).))
$(T2 findAdjacent,
$(D findAdjacent([1, 2, 3, 3, 4])) returns the subrange starting with
two equal adjacent elements, i.e. $(D [3, 3, 4]).)
Expand Down Expand Up @@ -385,10 +385,10 @@ Params:
pred = The predicate to use in comparing elements for commonality. Defaults
to equality $(D "a == b").
r1 = A $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range) of
r1 = A $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) of
elements.
r2 = An $(XREF_PACK_NAMED range,primitives,isInputRange,input range) of
r2 = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of
elements.
Returns:
Expand All @@ -398,7 +398,7 @@ $(D takeExactly(r1, n)), where $(D n) is the number of elements in the common
prefix of both ranges.
See_Also:
$(XREF range, takeExactly)
$(REF takeExactly, std,range)
*/
auto commonPrefix(alias pred = "a == b", R1, R2)(R1 r1, R2 r2)
if (isForwardRange!R1 && isInputRange!R2 &&
Expand Down Expand Up @@ -700,16 +700,16 @@ size_t count(alias pred = "true", R)(R haystack)

/++
Counts elements in the given
$(XREF_PACK_NAMED range,primitives,isForwardRange,forward range)
$(REF_ALTTEXT forward range, isForwardRange, std,range,primitives)
until the given predicate is true for one of the given $(D needles).
Params:
pred = The predicate for determining when to stop counting.
haystack = The
$(XREF_PACK_NAMED range,primitives,isInputRange,input range) to be
$(REF_ALTTEXT input range, isInputRange, std,range,primitives) to be
counted.
needles = Either a single element, or a
$(XREF_PACK_NAMED range,primitives,isForwardRange,forward range)
$(REF_ALTTEXT forward range, isForwardRange, std,range,primitives)
of elements, to be evaluated in turn against each
element in $(D haystack) under the given predicate.
Expand Down Expand Up @@ -872,7 +872,7 @@ ptrdiff_t countUntil(alias pred = "a == b", R, N)(R haystack, N needle)
Params:
pred = Predicate to when to stop counting.
haystack = An
$(XREF_PACK_NAMED range,primitives,isInputRange,input range) of
$(REF_ALTTEXT input range, isInputRange, std,range,primitives) of
elements to be counted.
Returns: The number of elements which must be popped from $(D haystack)
before $(D pred(haystack.front)) is $(D true).
Expand Down Expand Up @@ -969,7 +969,7 @@ Params:
the needle(s).
doesThisEnd = The
$(XREF_PACK_NAMED range,primitives,isBidirectionalRange,bidirectional range)
$(REF_ALTTEXT bidirectional range, isBidirectionalRange, std,range,primitives)
to check.
withOneOfThese = The needles to check against, which may be single
Expand Down Expand Up @@ -1317,7 +1317,7 @@ pred). Performs $(BIGOH walkLength(haystack)) evaluations of $(D
pred).
To _find the last occurrence of $(D needle) in $(D haystack), call $(D
find(retro(haystack), needle)). See $(XREF range, retro).
find(retro(haystack), needle)). See $(REF retro, std,range).
Params:
Expand All @@ -1326,7 +1326,7 @@ $(D "a == b").
The negated predicate $(D "a != b") can be used to search instead for the first
element $(I not) matching the needle.
haystack = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range)
haystack = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives)
searched in.
needle = The element searched for.
Expand Down Expand Up @@ -1610,15 +1610,14 @@ haystack.empty). Performs $(BIGOH haystack.length) evaluations of $(D
pred).
To _find the last element of a bidirectional $(D haystack) satisfying
$(D pred), call $(D find!(pred)(retro(haystack))). See $(XREF
range, retro).
$(D pred), call $(D find!(pred)(retro(haystack))). See $(REF retro, std,range).
Params:
pred = The predicate for determining if a given element is the one being
searched for.
haystack = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range) to
haystack = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to
search in.
Returns:
Expand Down Expand Up @@ -1697,10 +1696,10 @@ Params:
pred = The predicate to use for comparing respective elements from the haystack
and the needle. Defaults to simple equality $(D "a == b").
haystack = The $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range)
haystack = The $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives)
searched in.
needle = The $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range)
needle = The $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives)
searched for.
Returns:
Expand Down Expand Up @@ -2339,7 +2338,7 @@ evaluations of $(D pred).
Params:
pred = The predicate to satisfy.
r = A $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range) to
r = A $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) to
search in.
Returns:
Expand Down Expand Up @@ -2415,9 +2414,9 @@ Performs $(BIGOH seq.length * choices.length) evaluations of $(D pred).
Params:
pred = The predicate to use for determining a match.
seq = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range) to
seq = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to
search.
choices = A $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range)
choices = A $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives)
of possible choices.
Returns:
Expand Down Expand Up @@ -2463,10 +2462,10 @@ Range1 findAmong(alias pred = "a == b", Range1, Range2)(
*
* Params:
* haystack = The
* $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range) to search
* $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) to search
* in.
* needle = The
* $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range) to search
* $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) to search
* for.
*
* Returns: $(D true) if the needle was found, in which case $(D haystack) is
Expand Down Expand Up @@ -2527,8 +2526,8 @@ entire `haystack`.
If `haystack` is a random-access range, all three components of the tuple have
the same type as `haystack`. Otherwise, `haystack` must be a forward range and
the type of `result[0]` and `result[1]` is the same as $(XREF
range,takeExactly).
the type of `result[0]` and `result[1]` is the same as $(REF takeExactly,
std,range).
Params:
pred = Predicate to use for comparing needle against haystack.
Expand Down Expand Up @@ -3108,7 +3107,7 @@ Params:
Returns: The minimal element of the passed-in range.
See_Also:
$(XREF algorithm, comparison, min)
$(REF min, std,algorithm,comparison)
*/
auto minElement(alias map = "a", Range)(Range r)
if (isInputRange!Range && !isInfinite!Range)
Expand Down Expand Up @@ -3198,7 +3197,7 @@ Params:
Returns: The maximal element of the passed-in range.
See_Also:
$(XREF algorithm, comparison, max)
$(REF max, std,algorithm,comparison)
*/
auto maxElement(alias map = "a", Range)(Range r)
if (isInputRange!Range && !isInfinite!Range &&
Expand Down Expand Up @@ -3407,9 +3406,9 @@ range, or do nothing if there is no match.
Params:
pred = The predicate that determines whether elements from each respective
range match. Defaults to equality $(D "a == b").
r1 = The $(XREF_PACK_NAMED range,primitives,isForwardRange,forward range) to
r1 = The $(REF_ALTTEXT forward range, isForwardRange, std,range,primitives) to
move forward.
r2 = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range)
r2 = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives)
representing the initial segment of $(D r1) to skip over.
Returns:
Expand Down Expand Up @@ -3487,7 +3486,7 @@ Params:
pred = The predicate that determines whether an element from the range
matches the given element.
r = The $(XREF_PACK_NAMED range,primitives,isInputRange,input range) to skip
r = The $(REF_ALTTEXT input range, isInputRange, std,range,primitives) to skip
over.
e = The element to match.
Expand Down Expand Up @@ -3536,7 +3535,7 @@ bool skipOver(alias pred, R, E)(ref R r, E e)

/**
Checks whether the given
$(XREF_PACK_NAMED range,primitives,isInputRange,input range) starts with (one
$(REF_ALTTEXT input range, isInputRange, std,range,primitives) starts with (one
of) the given needle(s) or, if no needles are given,
if its front element fulfils predicate $(D pred).
Expand Down Expand Up @@ -3897,18 +3896,18 @@ $(D pred(e, sentinel)) is true.
Params:
pred = Predicate to determine when to stop.
range = The $(XREF_PACK_NAMED _range,primitives,isInputRange,input _range)
range = The $(REF_ALTTEXT input _range, isInputRange, std,_range,primitives)
to iterate over.
sentinel = The element to stop at.
openRight = Determines whether the element for which the given predicate is
true should be included in the resulting range ($(D OpenRight.no)), or
not ($(D OpenRight.yes)).
Returns:
An $(XREF_PACK_NAMED _range,primitives,isInputRange,input _range) that
An $(REF_ALTTEXT input _range, isInputRange, std,_range,primitives) that
iterates over the original range's elements, but ends when the specified
predicate becomes true. If the original range is a
$(XREF_PACK_NAMED _range,primitives,isForwardRange,forward _range) or
$(REF_ALTTEXT forward _range, isForwardRange, std,_range,primitives) or
higher, this range will be a forward range.
*/
Until!(pred, Range, Sentinel)
Expand Down
2 changes: 1 addition & 1 deletion std/algorithm/setops.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -72,7 +72,7 @@ Params:
otherRanges = Zero or more non-infinite forward ranges
Returns:
A forward range of $(XREF typecons,Tuple) representing elements of the
A forward range of $(REF Tuple, std,typecons) representing elements of the
cartesian product of the given ranges.
*/
auto cartesianProduct(R1, R2)(R1 range1, R2 range2)
Expand Down
26 changes: 13 additions & 13 deletions std/algorithm/sorting.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -10,7 +10,7 @@ $(T2 completeSort,
$(D completeSort(a, b)) leaves $(D a = [6, 10, 15]) and $(D b = [20,
30, 40]).
The range $(D a) must be sorted prior to the call, and as a result the
combination $(D $(XREF range,chain)(a, b)) is sorted.)
combination $(D $(REF chain, std,range)(a, b)) is sorted.)
$(T2 isPartitioned,
$(D isPartitioned!"a < 0"([-1, -2, 1, 0, 2])) returns $(D true) because
the predicate is $(D true) for a portion of the range and $(D false)
Expand Down Expand Up @@ -594,7 +594,7 @@ Params:
pivot = The pivot element.
Returns:
A $(XREF typecons,Tuple) of the three resulting ranges. These ranges are
A $(REF Tuple, std,typecons) of the three resulting ranges. These ranges are
slices of the original range.
BUGS: stable $(D partition3) has not been implemented yet.
Expand Down Expand Up @@ -1084,12 +1084,12 @@ Sorts a random-access range according to the predicate $(D less). Performs
$(BIGOH r.length * log(r.length)) evaluations of $(D less). Stable sorting
requires $(D hasAssignableElements!Range) to be true.
$(D sort) returns a $(XREF range, SortedRange) over the original range, which
$(D sort) returns a $(REF SortedRange, std,range) over the original range, which
functions that can take advantage of sorted data can then use to know that the
range is sorted and adjust accordingly. The $(XREF range, SortedRange) is a
range is sorted and adjust accordingly. The $(REF SortedRange, std,range) is a
wrapper around the original range, so both it and the original range are sorted,
but other functions won't know that the original range has been sorted, whereas
they $(I can) know that $(XREF range, SortedRange) has been sorted.
they $(I can) know that $(REF SortedRange, std,range) has been sorted.
The predicate is expected to satisfy certain rules in order for $(D sort) to
behave as expected - otherwise, the program may fail on certain inputs (but not
Expand All @@ -1099,7 +1099,7 @@ $(D less(a,c)) (transitivity), and, conversely, $(D !less(a,b) && !less(b,c)) to
imply $(D !less(a,c)). Note that the default predicate ($(D "a < b")) does not
always satisfy these conditions for floating point types, because the expression
will always be $(D false) when either $(D a) or $(D b) is NaN.
Use $(XREF math, cmp) instead.
Use $(REF cmp, std,math) instead.
If `less` involves expensive computations on the _sort key, it may be
worthwhile to use $(LREF schwartzSort) instead.
Expand All @@ -1121,10 +1121,10 @@ or more allocations per call. Both algorithms have $(BIGOH n log n) worst-case
time complexity.
See_Also:
$(XREF range, assumeSorted)$(BR)
$(XREF range, SortedRange)$(BR)
$(XREF_PACK algorithm,mutation,SwapStrategy)$(BR)
$(XREF functional, binaryFun)
$(REF assumeSorted, std,range)$(BR)
$(REF SortedRange, std,range)$(BR)
$(REF SwapStrategy, std,algorithm,mutation)$(BR)
$(REF binaryFun, std,functional)
*/
SortedRange!(Range, less)
sort(alias less = "a < b", SwapStrategy ss = SwapStrategy.unstable,
Expand Down Expand Up @@ -2618,10 +2618,10 @@ Params:
Defaults to $(D a < b).
ss = $(RED (Not implemented yet.)) Specify the swapping strategy.
r = A
$(XREF_PACK_NAMED range,primitives,isRandomAccessRange,random-access range)
$(REF_ALTTEXT random-access range, isRandomAccessRange, std,range,primitives)
of elements to make an index for.
index = A
$(XREF_PACK_NAMED range,primitives,isRandomAccessRange,random-access range)
$(REF_ALTTEXT random-access range, isRandomAccessRange, std,range,primitives)
with assignable elements to build the index in. The length of this range
determines how many top elements to index in $(D r).
Expand Down Expand Up @@ -2775,7 +2775,7 @@ do
* case the range is reversed back to the lexicographically smallest
* permutation; otherwise returns true.
* See_Also:
* $(XREF_PACK algorithm,iteration,permutations).
* $(REF permutations, std,algorithm,iteration).
*/
bool nextPermutation(alias less="a < b", BidirectionalRange)
(BidirectionalRange range)
Expand Down
18 changes: 9 additions & 9 deletions std/array.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -339,7 +339,7 @@ range, which must be a range of tuples (Key, Value). Returns a null associative
array reference when given an empty range.
Duplicates: Associative arrays have unique keys. If r contains duplicate keys,
then the result will contain the value of the last pair for that key in r.
See_Also: $(XREF typecons, Tuple)
See_Also: $(REF Tuple, std,typecons)
*/

auto assocArray(Range)(Range r)
Expand Down Expand Up @@ -1247,7 +1247,7 @@ pure nothrow bool sameTail(T)(in T[] lhs, in T[] rhs)
/********************************************
Returns an array that consists of $(D s) (which must be an input
range) repeated $(D n) times. This function allocates, fills, and
returns a new array. For a lazy version, refer to $(XREF range, repeat).
returns a new array. For a lazy version, refer to $(REF repeat, std,range).
*/
ElementEncodingType!S[] replicate(S)(S s, size_t n) if (isDynamicArray!S)
{
Expand Down Expand Up @@ -1327,10 +1327,10 @@ delimiter. Runs of whitespace are merged together (no empty words are produced).
$(D @safe), $(D pure) and $(D CTFE)-able.
See_Also:
$(XREF_PACK algorithm,iteration,splitter) for a version that splits using any
$(REF splitter, std,algorithm,iteration) for a version that splits using any
separator.
$(XREF regex, splitter) for a version that splits using a regular
$(REF splitter, std,regex) for a version that splits using a regular
expression defined separator.
+/
S[] split(S)(S s) @safe pure
Expand Down Expand Up @@ -1421,10 +1421,10 @@ unittest

// @@@DEPRECATED_2017-01@@@
/++
$(RED Deprecated. Use $(XREF_PACK algorithm,iteration,_splitter) instead.
$(RED Deprecated. Use $(REF _splitter, std,algorithm,iteration) instead.
This will be removed in January 2017.)
Alias for $(XREF_PACK algorithm,iteration,_splitter).
Alias for $(REF _splitter, std,algorithm,iteration).
+/
deprecated("Please use std.algorithm.iteration.splitter instead.")
alias splitter = std.algorithm.iteration.splitter;
Expand All @@ -1433,7 +1433,7 @@ alias splitter = std.algorithm.iteration.splitter;
Eagerly splits $(D range) into an array, using $(D sep) as the delimiter.
The _range must be a
$(XREF_PACK_NAMED _range,primitives,isForwardRange,forward _range).
$(REF_ALTTEXT forward _range, isForwardRange, std,_range,primitives).
The separator can be a value of the same type as the elements in $(D range)
or it can be another forward _range.
Expand All @@ -1452,7 +1452,7 @@ alias splitter = std.algorithm.iteration.splitter;
An array containing the divided parts of $(D range).
See_Also:
$(XREF_PACK algorithm,iteration,splitter) for the lazy version of this
$(REF splitter, std,algorithm,iteration) for the lazy version of this
function.
+/
auto split(Range, Separator)(Range range, Separator sep)
Expand Down Expand Up @@ -1553,7 +1553,7 @@ private enum bool hasCheapIteration(R) = isArray!R;
an allocated array of Elements
See_Also:
$(XREF_PACK algorithm,iteration,joiner)
$(REF joiner, std,algorithm,iteration)
+/
ElementEncodingType!(ElementType!RoR)[] join(RoR, R)(RoR ror, R sep)
if (isInputRange!RoR &&
Expand Down
2 changes: 1 addition & 1 deletion std/bigint.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -632,7 +632,7 @@ public:
/**
Implements casting to integer types.
Throws: $(XREF conv,ConvOverflowException) if the number exceeds
Throws: $(REF ConvOverflowException, std,conv) if the number exceeds
the target type's range.
*/
T opCast(T:ulong)() /*pure*/ const
Expand Down
6 changes: 3 additions & 3 deletions std/complex.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -108,10 +108,10 @@ struct Complex(T) if (isFloatingPoint!T)
/** Converts the complex number to a string representation.
The second form of this function is usually not called directly;
instead, it is used via $(XREF string,format), as shown in the examples
instead, it is used via $(REF format, std,string), as shown in the examples
below. Supported format characters are 'e', 'f', 'g', 'a', and 's'.
See the $(MREF std, format) and $(XREF string, format)
See the $(MREF std, format) and $(REF format, std,string)
documentation for more information.
*/
string toString() const /* TODO: @safe pure nothrow */
Expand Down Expand Up @@ -822,7 +822,7 @@ unittest{
Note:
$(D expi) is included here for convenience and for easy migration of code
that uses $(XREF math,_expi). Unlike $(XREF math,_expi), which uses the
that uses $(REF _expi, std,math). Unlike $(REF _expi, std,math), which uses the
x87 $(I fsincos) instruction when possible, this function is no faster
than calculating cos(y) and sin(y) separately.
*/
Expand Down
10 changes: 5 additions & 5 deletions std/concurrency.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -259,7 +259,7 @@ class LinkTerminated : Exception

/**
* Thrown if a message was sent to a thread via
* $(XREF concurrency, prioritySend) and the receiver does not have a handler
* $(REF prioritySend, std,concurrency) and the receiver does not have a handler
* for a message of this type.
*/
class PriorityMessageException : Exception
Expand Down Expand Up @@ -596,7 +596,7 @@ unittest
* Places the values as a message at the back of tid's message queue.
*
* Sends the supplied value to the thread represented by tid. As with
* $(XREF concurrency, spawn), $(D T) must not have unshared aliasing.
* $(REF spawn, std,concurrency), $(D T) must not have unshared aliasing.
*/
void send(T...)( Tid tid, T vals )
{
Expand Down Expand Up @@ -648,10 +648,10 @@ private void _send(T...)( MsgType type, Tid tid, T vals )
* specified types are available. This function works by pattern matching
* a message against a set of delegates and executing the first match found.
*
* If a delegate that accepts a $(XREF variant, Variant) is included as
* If a delegate that accepts a $(REF Variant, std,variant) is included as
* the last argument to $(D receive), it will match any message that was not
* matched by an earlier delegate. If more than one argument is sent,
* the $(D Variant) will contain a $(XREF typecons, Tuple) of all values
* the $(D Variant) will contain a $(REF Tuple, std,typecons) of all values
* sent.
*
* Example:
Expand Down Expand Up @@ -740,7 +740,7 @@ private template receiveOnlyRet(T...)
* is received.
*
* Returns: The received message. If $(D T.length) is greater than one,
* the message will be packed into a $(XREF typecons, Tuple).
* the message will be packed into a $(REF Tuple, std,typecons).
*
* Example:
* ---
Expand Down
6 changes: 3 additions & 3 deletions std/container/package.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -6,7 +6,7 @@ This module defines generic containers.
Construction:
To implement the different containers both struct and class based
approaches have been used. $(XREF_PACK _container,util,make) allows for
approaches have been used. $(REF make, std,_container,util) allows for
uniform construction with either approach.
---
Expand Down Expand Up @@ -85,7 +85,7 @@ array1.removeBack();
assert(array2.empty);
---
It is therefore recommended to always construct containers using
$(XREF_PACK _container,util,make).
$(REF make, std,_container,util).
This is in fact necessary to put containers into another _container.
For example, to construct an $(D Array) of ten empty $(D Array)s, use
Expand Down Expand Up @@ -477,7 +477,7 @@ defines $(D KeyType) to be $(D K) and $(D ValueType) to be $(D V).

/**
Defines the container's primary range, which embodies one of the
ranges defined in $(XREFMODULE range).
ranges defined in $(MREF std,range).
Generally a container may define several types of ranges.
*/
Expand Down
2 changes: 1 addition & 1 deletion std/container/rbtree.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -722,7 +722,7 @@ private struct RBRange(N)
* of $(BIGOH lg(n)).
*
* To use a different comparison than $(D "a < b"), pass a different operator string
* that can be used by $(XREF functional, binaryFun), or pass in a
* that can be used by $(REF binaryFun, std,functional), or pass in a
* function, delegate, functor, or any type where $(D less(a, b)) results in a $(D bool)
* value.
*
Expand Down
4 changes: 2 additions & 2 deletions std/conv.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -5204,7 +5204,7 @@ unittest
(e.g from $(D int) to $(D long)).
Note that the result is always mutable even if the original type was const
or immutable. In order to retain the constness, use $(XREF traits, Unsigned).
or immutable. In order to retain the constness, use $(REF Unsigned, std,traits).
*/
auto unsigned(T)(T x) if (isIntegral!T)
{
Expand Down Expand Up @@ -5278,7 +5278,7 @@ unittest
(e.g from $(D uint) to $(D ulong)).
Note that the result is always mutable even if the original type was const
or immutable. In order to retain the constness, use $(XREF traits, Signed).
or immutable. In order to retain the constness, use $(REF Signed, std,traits).
*/
auto signed(T)(T x) if (isIntegral!T)
{
Expand Down
20 changes: 10 additions & 10 deletions std/csv.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -104,8 +104,8 @@ import std.exception; // basicExceptionCtors
* be made when there is failure to match the header see $(LREF
* HeaderMismatchException) for details.
*
* When performing type conversions, $(XREF ConvException) is stored in the $(D
* next) field.
* When performing type conversions, $(REF ConvException, std,conv) is stored in
* the $(D next) field.
*/
class CSVException : Exception
{
Expand Down Expand Up @@ -293,7 +293,7 @@ enum Malformed
*
* Returns:
* An input range R as defined by
* $(XREF_PACK range,primitives,isInputRange). When $(D Contents) is a
* $(REF isInputRange, std,range,primitives). When $(D Contents) is a
* struct, class, or an associative array, the element type of R is
* $(D Contents), otherwise the element type of R is itself a range with
* element type $(D Contents).
Expand Down Expand Up @@ -368,7 +368,7 @@ auto csvReader(Contents = string,Malformed ErrorLevel = Malformed.throwException
*
* Returns:
* An input range R as defined by
* $(XREF_PACK range,primitives,isInputRange). When $(D Contents) is a
* $(REF isInputRange, std,range,primitives). When $(D Contents) is a
* struct, class, or an associative array, the element type of R is
* $(D Contents), otherwise the element type of R is itself a range with
* element type $(D Contents).
Expand Down Expand Up @@ -932,7 +932,7 @@ public:

/**
* Part of an input range as defined by
* $(XREF_PACK range,primitives,isInputRange).
* $(REF isInputRange, std,range,primitives).
*
* Returns:
* If $(D Contents) is a struct, will be filled with record data.
Expand Down Expand Up @@ -964,7 +964,7 @@ public:

/**
* Part of an input range as defined by
* $(XREF_PACK range,primitives,isInputRange).
* $(REF isInputRange, std,range,primitives).
*/
@property bool empty() @safe @nogc pure nothrow const
{
Expand All @@ -973,7 +973,7 @@ public:

/**
* Part of an input range as defined by
* $(XREF_PACK range,primitives,isInputRange).
* $(REF isInputRange, std,range,primitives).
*
* Throws:
* $(LREF CSVException) When a quote is found in an unquoted field,
Expand Down Expand Up @@ -1179,7 +1179,7 @@ public:

/**
* Part of an input range as defined by
* $(XREF_PACK range,primitives,isInputRange).
* $(REF isInputRange, std,range,primitives).
*/
@property Contents front() @safe pure
{
Expand All @@ -1189,7 +1189,7 @@ public:

/**
* Part of an input range as defined by
* $(XREF_PACK range,primitives,isInputRange).
* $(REF isInputRange, std,range,primitives).
*/
@property bool empty() @safe pure nothrow @nogc const
{
Expand All @@ -1214,7 +1214,7 @@ public:

/**
* Part of an input range as defined by
* $(XREF_PACK range,primitives,isInputRange).
* $(REF isInputRange, std,range,primitives).
*
* Throws:
* $(LREF CSVException) When a quote is found in an unquoted field,
Expand Down
12 changes: 6 additions & 6 deletions std/digest/crc.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -26,8 +26,8 @@ $(TR $(TDNW Helpers) $(TD $(MYREF crcHexString) $(MYREF crc32Of))
*
* Note:
* CRCs are usually printed with the MSB first. When using
* $(XREF_PACK digest,digest,toHexString) the result will be in an unexpected
* order. Use $(XREF_PACK digest,digest,toHexString)'s optional order parameter
* $(REF toHexString, std,digest,digest) the result will be in an unexpected
* order. Use $(REF toHexString, std,digest,digest)'s optional order parameter
* to specify decreasing order for the correct result. The $(LREF crcHexString)
* alias can also be used for this purpose.
*
Expand Down Expand Up @@ -154,7 +154,7 @@ struct CRC32
public:
/**
* Use this to feed the digest with data.
* Also implements the $(XREF_PACK range,primitives,isOutputRange)
* Also implements the $(REF isOutputRange, std,range,primitives)
* interface for $(D ubyte) and $(D const(ubyte)[]).
*/
void put(scope const(ubyte)[] data...) @trusted pure nothrow @nogc
Expand Down Expand Up @@ -304,7 +304,7 @@ unittest
}

/**
* This is a convenience alias for $(XREF_PACK digest,digest,digest) using the
* This is a convenience alias for $(REF digest, std,digest,digest) using the
* CRC32 implementation.
*
* Params:
Expand Down Expand Up @@ -339,7 +339,7 @@ unittest
}

/**
* This is a convenience alias for $(XREF_PACK digest,digest,toHexString)
* This is a convenience alias for $(REF toHexString, std,digest,digest)
* producing the usual CRC32 string output.
*/
public alias crcHexString = toHexString!(Order.decreasing);
Expand All @@ -351,7 +351,7 @@ public alias crcHexString = toHexString!(Order.decreasing, 16);
* OOP API CRC32 implementation.
* See $(D std.digest.digest) for differences between template and OOP API.
*
* This is an alias for $(D $(XREF_PACK digest,digest,WrapperDigest)!CRC32), see
* This is an alias for $(D $(REF WrapperDigest, std,digest,digest)!CRC32), see
* there for more information.
*/
alias CRC32Digest = WrapperDigest!CRC32;
Expand Down
8 changes: 4 additions & 4 deletions std/digest/digest.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -204,7 +204,7 @@ version(ExampleDigest)
public:
/**
* Use this to feed the digest with data.
* Also implements the $(XREF_PACK range,primitives,isOutputRange)
* Also implements the $(REF isOutputRange, std,range,primitives)
* interface for $(D ubyte) and $(D const(ubyte)[]).
* The following usages of $(D put) must work for any type which
* passes $(LREF isDigest):
Expand Down Expand Up @@ -388,7 +388,7 @@ unittest

/**
* Checks whether the digest has a $(D blockSize) member, which contains the
* digest's internal block size in bits. It is primarily used by $(XREF digest.hmac, HMAC).
* digest's internal block size in bits. It is primarily used by $(REF HMAC, std,digest.hmac).
*/

template hasBlockSize(T)
Expand Down Expand Up @@ -562,7 +562,7 @@ interface Digest
public:
/**
* Use this to feed the digest with data.
* Also implements the $(XREF_PACK range,primitives,isOutputRange)
* Also implements the $(REF isOutputRange, std,range,primitives)
* interface for $(D ubyte) and $(D const(ubyte)[]).
*
* Example:
Expand Down Expand Up @@ -864,7 +864,7 @@ class WrapperDigest(T) if (isDigest!T) : Digest

/**
* Use this to feed the digest with data.
* Also implements the $(XREF_PACK range,primitives,isOutputRange)
* Also implements the $(REF isOutputRange, std,range,primitives)
* interface for $(D ubyte) and $(D const(ubyte)[]).
*/
@trusted nothrow void put(scope const(ubyte)[] data...)
Expand Down
4 changes: 2 additions & 2 deletions std/digest/hmac.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -26,7 +26,7 @@ import std.meta : allSatisfy;
* information about the block size, it can be supplied explicitly using
* the second overload.
*
* This type conforms to $(XREF digest.digest, isDigest).
* This type conforms to $(REF isDigest, std,digest.digest).
*/

version(StdDdoc)
Expand Down Expand Up @@ -142,7 +142,7 @@ if (hashBlockSize % 8 == 0)

/**
* Feeds a piece of data into the hash computation. This method allows the
* type to be used as an $(XREF range, OutputRange).
* type to be used as an $(REF OutputRange, std,range).
*
* Returns:
* A reference to the digest for convenient chaining.
Expand Down
6 changes: 3 additions & 3 deletions std/digest/md.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -288,7 +288,7 @@ struct MD5

/**
* Use this to feed the digest with data.
* Also implements the $(XREF_PACK range,primitives,isOutputRange)
* Also implements the $(REF isOutputRange, std,range,primitives)
* interface for $(D ubyte) and $(D const(ubyte)[]).
*
* Example:
Expand Down Expand Up @@ -492,7 +492,7 @@ unittest
}

/**
* This is a convenience alias for $(XREF_PACK digest,digest,digest) using the
* This is a convenience alias for $(REF digest, std,digest,digest) using the
* MD5 implementation.
*/
//simple alias doesn't work here, hope this gets inlined...
Expand All @@ -512,7 +512,7 @@ unittest
* OOP API MD5 implementation.
* See $(D std.digest.digest) for differences between template and OOP API.
*
* This is an alias for $(D $(XREF_PACK digest,digest,WrapperDigest)!MD5), see
* This is an alias for $(D $(REF WrapperDigest, std,digest,digest)!MD5), see
* there for more information.
*/
alias MD5Digest = WrapperDigest!MD5;
Expand Down
6 changes: 3 additions & 3 deletions std/digest/ripemd.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -444,7 +444,7 @@ struct RIPEMD160

/**
* Use this to feed the digest with data.
* Also implements the $(XREF_PACK range,primitives,isOutputRange)
* Also implements the $(REF isOutputRange, std,range,primitives)
* interface for $(D ubyte) and $(D const(ubyte)[]).
*
* Example:
Expand Down Expand Up @@ -661,7 +661,7 @@ unittest
}

/**
* This is a convenience alias for $(XREF_PACK digest,digest,digest) using the
* This is a convenience alias for $(REF digest, std,digest,digest) using the
* RIPEMD160 implementation.
*/
//simple alias doesn't work here, hope this gets inlined...
Expand All @@ -681,7 +681,7 @@ unittest
* OOP API RIPEMD160 implementation.
* See $(D std.digest.digest) for differences between template and OOP API.
*
* This is an alias for $(D $(XREF_PACK digest,digest,WrapperDigest)!RIPEMD160),
* This is an alias for $(D $(REF WrapperDigest, std,digest,digest)!RIPEMD160),
* see there for more information.
*/
alias RIPEMD160Digest = WrapperDigest!RIPEMD160;
Expand Down
6 changes: 3 additions & 3 deletions std/digest/sha.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -687,7 +687,7 @@ struct SHA(uint hashBlockSize, uint digestSize)

/**
* Use this to feed the digest with data.
* Also implements the $(XREF_PACK range,primitives,isOutputRange)
* Also implements the $(REF isOutputRange, std,range,primitives)
* interface for $(D ubyte) and $(D const(ubyte)[]).
*/
void put(scope const(ubyte)[] input...) @trusted pure nothrow @nogc
Expand Down Expand Up @@ -1115,7 +1115,7 @@ unittest
}

/**
* These are convenience aliases for $(XREF_PACK digest,digest,digest) using the
* These are convenience aliases for $(REF digest, std,digest,digest) using the
* SHA implementation.
*/
//simple alias doesn't work here, hope this gets inlined...
Expand Down Expand Up @@ -1194,7 +1194,7 @@ unittest
* OOP API SHA1 and SHA2 implementations.
* See $(D std.digest.digest) for differences between template and OOP API.
*
* This is an alias for $(D $(XREF_PACK digest,digest,WrapperDigest)!SHA1), see
* This is an alias for $(D $(REF WrapperDigest, std,digest,digest)!SHA1), see
* there for more information.
*/
alias SHA1Digest = WrapperDigest!SHA1;
Expand Down
2 changes: 1 addition & 1 deletion std/encoding.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2197,7 +2197,7 @@ unittest
r = Destination string
See_Also:
$(XREF conv, to)
$(REF to, std,conv)
*/
void transcode(Src,Dst)(immutable(Src)[] s,out immutable(Dst)[] r)
in
Expand Down
4 changes: 2 additions & 2 deletions std/exception.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -1748,8 +1748,8 @@ Returns: A wrapper $(D struct) that preserves the range interface of $(D input).
opSlice:
Infinite ranges with slicing support must return an instance of
$(XREF range, Take) when sliced with a specific lower and upper
bound (see $(XREF_PACK range,primitives,hasSlicing)); $(D handle) deals with
$(REF Take, std,range) when sliced with a specific lower and upper
bound (see $(REF hasSlicing, std,range,primitives)); $(D handle) deals with
this by $(D take)ing 0 from the return value of the handler function and
returning that when an exception is caught.
*/
Expand Down
8 changes: 4 additions & 4 deletions std/file.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -382,7 +382,7 @@ version (linux) @safe unittest
}

/********************************************
Read and validates (using $(XREF utf, validate)) a text file. $(D S)
Read and validates (using $(REF validate, std,utf)) a text file. $(D S)
can be a type of array of characters of any width and constancy. No
width conversion is performed; if the width of the characters in file
$(D name) is different from the width of elements of $(D S),
Expand Down Expand Up @@ -442,7 +442,7 @@ Params:
Throws: $(D FileException) on error.
See_also: $(XREF stdio,toFile)
See_also: $(REF toFile, std,stdio)
*/
void write(R)(R name, const void[] buffer)
if ((isInputRange!R && isSomeChar!(ElementEncodingType!R) || isSomeString!R) &&
Expand Down Expand Up @@ -2566,7 +2566,7 @@ else version (NetBSD)
* Returns the full path of the current executable.
*
* Throws:
* $(XREF object, Exception)
* $(REF Exception, std,object)
*/
@trusted string thisExePath ()
{
Expand Down Expand Up @@ -3903,7 +3903,7 @@ unittest
path = The directory to iterate over.
pattern = String with wildcards, such as $(RED "*.d"). The supported
wildcard strings are described under
$(XREF _path, globMatch).
$(REF globMatch, std,_path).
mode = Whether the directory's sub-directories should be iterated
over depth-first ($(D_PARAM depth)), breadth-first
($(D_PARAM breadth)), or not at all ($(D_PARAM shallow)).
Expand Down
6 changes: 3 additions & 3 deletions std/format.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -104,7 +104,7 @@ private alias enforceFmt = enforceEx!FormatException;
Interprets variadic argument list $(D args), formats them according
to $(D fmt), and sends the resulting characters to $(D w). The
encoding of the output is the same as $(D Char). The type $(D Writer)
must satisfy $(D $(XREF_PACK range,primitives,isOutputRange)!(Writer, Char)).
must satisfy $(D $(REF isOutputRange, std,range,primitives)!(Writer, Char)).
The variadic arguments are normally consumed in order. POSIX-style
$(WEB opengroup.org/onlinepubs/009695399/functions/printf.html,
Expand All @@ -131,7 +131,7 @@ private alias enforceFmt = enforceEx!FormatException;
Params:
w = Output is sent to this writer. Typical output writers include
$(XREF array,Appender!string) and $(XREF stdio,LockingTextWriter).
$(REF Appender!string, std,array) and $(REF LockingTextWriter, std,stdio).
fmt = Format string.
Expand Down Expand Up @@ -6415,7 +6415,7 @@ unittest
/*****************************************************
* Format arguments into a string.
*
* Params: fmt = Format string. For detailed specification, see $(XREF _format,formattedWrite).
* Params: fmt = Format string. For detailed specification, see $(REF formattedWrite, std,_format).
* args = Variadic list of arguments to format into returned string.
*/
immutable(Char)[] format(Char, Args...)(in Char[] fmt, Args args) if (isSomeChar!Char)
Expand Down
2 changes: 1 addition & 1 deletion std/functional.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -784,7 +784,7 @@ unittest

/**
Takes multiple functions and adjoins them together. The result is a
$(XREF typecons, Tuple) with one element per passed-in function. Upon
$(REF Tuple, std,typecons) with one element per passed-in function. Upon
invocation, the returned tuple is the adjoined results of all
functions.
Expand Down
4 changes: 2 additions & 2 deletions std/json.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -700,7 +700,7 @@ struct JSONValue

/**
Parses a serialized string and returns a tree of JSON values.
Throws: $(XREF json,JSONException) if the depth exceeds the max depth.
Throws: $(REF JSONException, std,json) if the depth exceeds the max depth.
Params:
json = json-formatted string to parse
maxDepth = maximum depth of nesting allowed, -1 disables depth checking
Expand Down Expand Up @@ -1068,7 +1068,7 @@ unittest

/**
Parses a serialized string and returns a tree of JSON values.
Throws: $(XREF json,JSONException) if the depth exceeds the max depth.
Throws: $(REF JSONException, std,json) if the depth exceeds the max depth.
Params:
json = json-formatted string to parse
options = enable decoding string representations of NaN/Inf as float values
Expand Down
8 changes: 4 additions & 4 deletions std/net/curl.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -1975,7 +1975,7 @@ private mixin template Protocol()
* theprotocol.netInterface = [ 192, 168, 1, 32 ];
* ----
*
* See: $(XREF socket, InternetAddress)
* See: $(REF InternetAddress, std,socket)
*/
@property void netInterface(const(char)[] i)
{
Expand Down Expand Up @@ -2628,7 +2628,7 @@ struct HTTP
* theprotocol.netInterface = [ 192, 168, 1, 32 ];
* ----
*
* See: $(XREF socket, InternetAddress)
* See: $(REF InternetAddress, std,socket)
*/
@property void netInterface(const(char)[] i);

Expand Down Expand Up @@ -3308,7 +3308,7 @@ struct FTP
* theprotocol.netInterface = [ 192, 168, 1, 32 ];
* ----
*
* See: $(XREF socket, InternetAddress)
* See: $(REF InternetAddress, std,socket)
*/
@property void netInterface(const(char)[] i);

Expand Down Expand Up @@ -3657,7 +3657,7 @@ struct SMTP
* theprotocol.netInterface = [ 192, 168, 1, 32 ];
* ----
*
* See: $(XREF socket, InternetAddress)
* See: $(REF InternetAddress, std,socket)
*/
@property void netInterface(const(char)[] i);

Expand Down
2 changes: 1 addition & 1 deletion std/numeric.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -1413,7 +1413,7 @@ than that for a Fibonacci search.
References:
"Algorithms for Minimization without Derivatives", Richard Brent, Prentice-Hall, Inc. (1973)
See_Also: $(LREF findRoot), $(XREF math, isNormal)
See_Also: $(LREF findRoot), $(REF isNormal, std,math)
+/
Tuple!(T, "x", Unqual!(ReturnType!DF), "y", T, "error")
findLocalMin(T, DF)(
Expand Down
12 changes: 6 additions & 6 deletions std/outbuffer.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -322,12 +322,12 @@ class OutBuffer
* Formats and writes its arguments in text format to the OutBuffer.
*
* Params:
* fmt = format string as described in $(XREF format, formattedWrite)
* fmt = format string as described in $(REF formattedWrite, std,format)
* args = arguments to be formatted
*
* See_Also:
* $(XREF stdio, _writef);
* $(XREF format, formattedWrite);
* $(REF _writef, std,stdio);
* $(REF formattedWrite, std,format);
*/
void writef(Char, A...)(in Char[] fmt, A args)
{
Expand All @@ -348,12 +348,12 @@ class OutBuffer
* followed by a newline.
*
* Params:
* fmt = format string as described in $(XREF format, formattedWrite)
* fmt = format string as described in $(REF formattedWrite, std,format)
* args = arguments to be formatted
*
* See_Also:
* $(XREF stdio, _writefln);
* $(XREF format, formattedWrite);
* $(REF _writefln, std,stdio);
* $(REF formattedWrite, std,format);
*/
void writefln(Char, A...)(in Char[] fmt, A args)
{
Expand Down
22 changes: 11 additions & 11 deletions std/parallelism.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -414,7 +414,7 @@ meaning that any memory writes made in the thread that executed the $(D Task)
are guaranteed to be visible in the calling thread after one of these functions
returns.
The $(XREF parallelism, task) and $(XREF parallelism, scopedTask) functions can
The $(REF task, std,parallelism) and $(REF scopedTask, std,parallelism) functions can
be used to create an instance of this struct. See $(D task) for usage examples.
Function results are returned from $(D yieldForce), $(D spinForce) and
Expand Down Expand Up @@ -733,7 +733,7 @@ struct Task(alias fun, Args...)
newly created thread, then terminate the thread. This can be used for
future/promise parallelism. An explicit priority may be given
to the $(D Task). If one is provided, its value is forwarded to
$(D core.thread.Thread.priority). See $(XREF parallelism, task) for
$(D core.thread.Thread.priority). See $(REF task, std,parallelism) for
usage example.
*/
void executeInNewThread() @trusted
Expand Down Expand Up @@ -771,8 +771,8 @@ ReturnType!F run(F, Args...)(F fpOrDelegate, ref Args args)
/**
Creates a $(D Task) on the GC heap that calls an alias. This may be executed
via $(D Task.executeInNewThread) or by submitting to a
$(XREF parallelism, TaskPool). A globally accessible instance of
$(D TaskPool) is provided by $(XREF parallelism, taskPool).
$(REF TaskPool, std,parallelism). A globally accessible instance of
$(D TaskPool) is provided by $(REF taskPool, std,parallelism).
Returns: A pointer to the $(D Task).
Expand Down Expand Up @@ -883,7 +883,7 @@ identical to the non-@safe case, but safety introduces some restrictions:
1. $(D fun) must be @safe or @trusted.
2. $(D F) must not have any unshared aliasing as defined by
$(XREF traits, hasUnsharedAliasing). This means it
$(REF hasUnsharedAliasing, std,traits). This means it
may not be an unshared delegate or a non-shared class or struct
with overloaded $(D opCall). This also precludes accepting template
alias parameters.
Expand Down Expand Up @@ -1000,7 +1000,7 @@ thread that executes the $(D Task) at the front of the queue when one is
available and sleeps when the queue is empty.
This class should usually be used via the global instantiation
available via the $(XREF parallelism, taskPool) property.
available via the $(REF taskPool, std,parallelism) property.
Occasionally it is useful to explicitly instantiate a $(D TaskPool):
1. When you want $(D TaskPool) instances with multiple priorities, for example
Expand Down Expand Up @@ -1561,7 +1561,7 @@ public:
preferred where the memory requirements of eagerness are acceptable.
$(D functions) are the functions to be evaluated, passed as template
alias parameters in a style similar to
$(XREF_PACK algorithm,iteration,map).
$(REF map, std,algorithm,iteration).
The first argument must be a random access range. For performance
reasons, amap will assume the range elements have not yet been
initialized. Elements will be overwritten without calling a destructor
Expand Down Expand Up @@ -2344,7 +2344,7 @@ public:
{
/**
Parallel reduce on a random access range. Except as otherwise noted,
usage is similar to $(XREF_PACK algorithm,iteration,_reduce). This
usage is similar to $(REF _reduce, std,algorithm,iteration). This
function works by splitting the range to be reduced into work units,
which are slices to be reduced in parallel. Once the results from all
work units are computed, a final serial reduction is performed on these
Expand All @@ -2365,14 +2365,14 @@ public:
algorithm. These take advantage of the instruction level parallelism of
modern CPUs, in addition to the thread-level parallelism that the rest
of this module exploits. This can lead to better than linear speedups
relative to $(XREF_PACK algorithm,iteration,_reduce), especially for
relative to $(REF _reduce, std,algorithm,iteration), especially for
fine-grained benchmarks like dot products.
An explicit seed may be provided as the first argument. If
provided, it is used as the seed for all work units and for the final
reduction of results from all work units. Therefore, if it is not the
identity value for the operation being performed, results may differ
from those generated by $(XREF_PACK algorithm,iteration,_reduce) or
from those generated by $(REF _reduce, std,algorithm,iteration) or
depending on how many work units are used. The next argument must be
the range to be reduced.
---
Expand Down Expand Up @@ -3141,7 +3141,7 @@ public:
Notes:
@trusted overloads of this function are called for $(D Task)s if
$(XREF traits, hasUnsharedAliasing) is false for the $(D Task)'s
$(REF hasUnsharedAliasing, std,traits) is false for the $(D Task)'s
return type or the function the $(D Task) executes is $(D pure).
$(D Task) objects that meet all other requirements specified in the
$(D @trusted) overloads of $(D task) and $(D scopedTask) may be created
Expand Down
6 changes: 3 additions & 3 deletions std/path.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -10,8 +10,8 @@
between a _path that points to a directory and a _path that points to a
file, and it does not know whether or not the object pointed to by the
_path actually exists in the file system.
To differentiate between these cases, use $(XREF file,isDir) and
$(XREF file,exists).
To differentiate between these cases, use $(REF isDir, std,file) and
$(REF exists, std,file).
Note that on Windows, both the backslash ($(D `\`)) and the slash ($(D `/`))
are in principle valid directory separators. This module treats them
Expand Down Expand Up @@ -3547,7 +3547,7 @@ unittest
or is equal to $(D ".") or $(D "..").
$(B It does $(I not) check whether the _path points to an existing file
or directory; use $(XREF file,exists) for this purpose.)
or directory; use $(REF exists, std,file) for this purpose.)
On Windows, some special rules apply:
$(UL
Expand Down
34 changes: 17 additions & 17 deletions std/process.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -225,7 +225,7 @@ wait(spawnProcess("myapp", ["foo" : "bar"], Config.newEnv));
Standard_streams:
The optional arguments $(D stdin), $(D stdout) and $(D stderr) may
be used to assign arbitrary $(XREF stdio,File) objects as the standard
be used to assign arbitrary $(REF File, std,stdio) objects as the standard
input, output and error streams, respectively, of the child process. The
former must be opened for reading, while the latter two must be opened for
writing. The default is for the child process to inherit the standard
Expand Down Expand Up @@ -260,14 +260,14 @@ Params:
args = An array which contains the program name as the zeroth element
and any command-line arguments in the following elements.
stdin = The standard input stream of the child process.
This can be any $(XREF stdio,File) that is opened for reading.
This can be any $(REF File, std,stdio) that is opened for reading.
By default the child process inherits the parent's input
stream.
stdout = The standard output stream of the child process.
This can be any $(XREF stdio,File) that is opened for writing.
This can be any $(REF File, std,stdio) that is opened for writing.
By default the child process inherits the parent's output stream.
stderr = The standard error stream of the child process.
This can be any $(XREF stdio,File) that is opened for writing.
This can be any $(REF File, std,stdio) that is opened for writing.
By default the child process inherits the parent's error stream.
env = Additional environment variables for the child process.
config = Flags that control process creation. See $(LREF Config)
Expand All @@ -281,7 +281,7 @@ A $(LREF Pid) object that corresponds to the spawned process.
Throws:
$(LREF ProcessException) on failure to start the process.$(BR)
$(XREF stdio,StdioException) on failure to pass one of the streams
$(REF StdioException, std,stdio) on failure to pass one of the streams
to the child process (Windows only).$(BR)
$(CXREF exception,RangeError) if $(D args) is empty.
*/
Expand Down Expand Up @@ -1588,7 +1588,7 @@ Returns:
A $(LREF Pipe) object that corresponds to the created _pipe.
Throws:
$(XREF stdio,StdioException) on failure.
$(REF StdioException, std,stdio) on failure.
*/
version (Posix)
Pipe pipe() @trusted //TODO: @safe
Expand Down Expand Up @@ -1655,7 +1655,7 @@ struct Pipe
/**
Closes both ends of the pipe.
Normally it is not necessary to do this manually, as $(XREF stdio,File)
Normally it is not necessary to do this manually, as $(REF File, std,stdio)
objects are automatically closed when there are no more references
to them.
Expand All @@ -1664,7 +1664,7 @@ struct Pipe
child process is platform dependent.)
Throws:
$(XREF exception,ErrnoException) if an error occurs.
$(REF ErrnoException, std,exception) if an error occurs.
*/
void close() @safe
{
Expand Down Expand Up @@ -1729,14 +1729,14 @@ shellPath = The path to the shell to use to run the specified program.
By default this is $(LREF nativeShell).
Returns:
A $(LREF ProcessPipes) object which contains $(XREF stdio,File)
A $(LREF ProcessPipes) object which contains $(REF File, std,stdio)
handles that communicate with the redirected streams of the child
process, along with a $(LREF Pid) object that corresponds to the
spawned process.
Throws:
$(LREF ProcessException) on failure to start the process.$(BR)
$(XREF stdio,StdioException) on failure to redirect any of the streams.$(BR)
$(REF StdioException, std,stdio) on failure to redirect any of the streams.$(BR)
Example:
---
Expand Down Expand Up @@ -2000,7 +2000,7 @@ unittest
}

/**
Object which contains $(XREF stdio,File) handles that allow communication
Object which contains $(REF File, std,stdio) handles that allow communication
with a child process through its standard streams.
*/
struct ProcessPipes
Expand All @@ -2013,7 +2013,7 @@ struct ProcessPipes
}

/**
An $(XREF stdio,File) that allows writing to the child process'
An $(REF File, std,stdio) that allows writing to the child process'
standard input stream.
Throws:
Expand All @@ -2029,7 +2029,7 @@ struct ProcessPipes
}

/**
An $(XREF stdio,File) that allows reading from the child process'
An $(REF File, std,stdio) that allows reading from the child process'
standard output stream.
Throws:
Expand All @@ -2045,7 +2045,7 @@ struct ProcessPipes
}

/**
An $(XREF stdio,File) that allows reading from the child process'
An $(REF File, std,stdio) that allows reading from the child process'
standard error stream.
Throws:
Expand Down Expand Up @@ -2122,7 +2122,7 @@ value is the signal number. (See $(LREF wait) for details.)
Throws:
$(LREF ProcessException) on failure to start the process.$(BR)
$(XREF stdio,StdioException) on failure to capture output.
$(REF StdioException, std,stdio) on failure to capture output.
*/
auto execute(in char[][] args,
const string[string] env = null,
Expand Down Expand Up @@ -2981,7 +2981,7 @@ static:
Throws:
$(OBJECTREF Exception) if the environment variable does not exist,
or $(XREF utf,UTFException) if the variable contains invalid UTF-16
or $(REF UTFException, std,utf) if the variable contains invalid UTF-16
characters (Windows only).
See_also:
Expand Down Expand Up @@ -3016,7 +3016,7 @@ static:
---
Throws:
$(XREF utf,UTFException) if the variable contains invalid UTF-16
$(REF UTFException, std,utf) if the variable contains invalid UTF-16
characters (Windows only).
*/
string get(in char[] name, string defaultValue = null) @safe
Expand Down
20 changes: 10 additions & 10 deletions std/range/package.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2967,7 +2967,7 @@ Take!(Repeat!T) repeat(T)(T value, size_t n)
}

/**
Given callable ($(XREF traits, isCallable)) $(D fun), create as a range
Given callable ($(REF isCallable, std,traits)) $(D fun), create as a range
whose front is defined by successive calls to $(D fun()).
This is especially useful to call function with global side effects (random
functions), or to create ranges expressed as a single delegate, rather than
Expand All @@ -2976,12 +2976,12 @@ $(D fun) maybe be passed either a template alias parameter (existing
function, delegate, struct type defining static $(D opCall)... ) or
a run-time value argument (delegate, function object... ).
The result range models an InputRange
($(XREF_PACK range,primitives,isInputRange)).
($(REF isInputRange, std,range,primitives)).
The resulting range will call $(D fun()) on every call to $(D front),
and only when $(D front) is called, regardless of how the range is
iterated.
It is advised to compose generate with either
$(XREF_PACK algorithm,iteration,cache) or $(XREF array,array), or to use it in a
$(REF cache, std,algorithm,iteration) or $(REF array, std,array), or to use it in a
foreach loop.
A by-value foreach loop means that the loop value is not $(D ref).
Expand Down Expand Up @@ -5370,7 +5370,7 @@ auto iota(B, E)(B begin, E end)
}

/**
User-defined types such as $(XREF bigint, BigInt) are also supported, as long
User-defined types such as $(REF BigInt, std,bigint) are also supported, as long
as they can be incremented with $(D ++) and compared with $(D <) or $(D ==).
*/
// Issue 6447
Expand Down Expand Up @@ -7274,7 +7274,7 @@ unittest
/**
Iterate over $(D range) with an attached index variable.
Each element is a $(XREF typecons, Tuple) containing the index
Each element is a $(REF Tuple, std,typecons) containing the index
and the element, in that order, where the index member is named $(D index)
and the element member is named $(D value).
Expand Down Expand Up @@ -7712,7 +7712,7 @@ Represents a sorted range. In addition to the regular range
primitives, supports additional operations that take advantage of the
ordering, such as merge and binary search. To obtain a $(D
SortedRange) from an unsorted range $(D r), use
$(XREF_PACK algorithm,sorting,sort) which sorts $(D r) in place and returns the
$(REF sort, std,algorithm,sorting) which sorts $(D r) in place and returns the
corresponding $(D SortedRange). To construct a $(D SortedRange) from a range
$(D r) that is known to be already sorted, use $(LREF assumeSorted) described
below.
Expand Down Expand Up @@ -8325,7 +8325,7 @@ effect on the complexity of subsequent operations specific to sorted
ranges (such as binary search). The probability of an arbitrary
unsorted range failing the test is very high (however, an
almost-sorted range is likely to pass it). To check for sortedness at
cost $(BIGOH n), use $(XREF_PACK algorithm,sorting,isSorted).
cost $(BIGOH n), use $(REF isSorted, std,algorithm,sorting).
*/
auto assumeSorted(alias pred = "a < b", R)(R r)
if (isInputRange!(Unqual!R))
Expand Down Expand Up @@ -9222,8 +9222,8 @@ struct NullSink
It is important to note that as the resultant range is evaluated lazily,
in the case of the version of $(D tee) that takes a function, the function
will not actually be executed until the range is "walked" using functions
that evaluate ranges, such as $(XREF array,array) or
$(XREF_PACK algorithm,iteration,fold).
that evaluate ranges, such as $(REF array, std,array) or
$(REF fold, std,algorithm,iteration).
Params:
pipeOnPop = If `Yes.pipeOnPop`, simply iterating the range without ever
Expand All @@ -9243,7 +9243,7 @@ struct NullSink
iterated and returns its elements in turn. In addition, the same elements
will be passed to `outputRange` or `fun` as well.
See_Also: $(XREF_PACK algorithm,iteration,each)
See_Also: $(REF each, std,algorithm,iteration)
+/
auto tee(Flag!"pipeOnPop" pipeOnPop = Yes.pipeOnPop, R1, R2)(R1 inputRange, R2 outputRange)
if (isInputRange!R1 && isOutputRange!(R2, ElementType!R1))
Expand Down
22 changes: 11 additions & 11 deletions std/stdio.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -1480,7 +1480,7 @@ Params:
buf = Buffer used to store the resulting line data. buf is
resized as necessary.
terminator = Line terminator (by default, $(D '\n')). Use
$(XREF ascii, newline) for portability (unless the file was opened in
$(REF newline, std,ascii) for portability (unless the file was opened in
text mode).
Returns:
Expand Down Expand Up @@ -1668,7 +1668,7 @@ is recommended if you want to process a complete file.
/**
* Read data from the file according to the specified
* $(LINK2 std_format.html#_format-string, format specifier) using
* $(XREF _format,formattedRead).
* $(REF formattedRead, std,_format).
*/
uint readf(Data...)(in char[] format, Data data)
{
Expand Down Expand Up @@ -1899,7 +1899,7 @@ Char = Character type for each line, defaulting to $(D char).
keepTerminator = Use $(D KeepTerminator.yes) to include the
terminator at the end of each line.
terminator = Line separator ($(D '\n') by default). Use
$(XREF ascii, newline) for portability (unless the file was opened in
$(REF newline, std,ascii) for portability (unless the file was opened in
text mode).
Example:
Expand Down Expand Up @@ -2058,7 +2058,7 @@ Char = Character type for each line, defaulting to $(D immutable char).
keepTerminator = Use $(D KeepTerminator.yes) to include the
terminator at the end of each line.
terminator = Line separator ($(D '\n') by default). Use
$(XREF ascii, newline) for portability (unless the file was opened in
$(REF newline, std,ascii) for portability (unless the file was opened in
text mode).
Example:
Expand All @@ -2076,7 +2076,7 @@ void main()
}
----
See_Also:
$(XREF file,readText)
$(REF readText, std,file)
*/
auto byLineCopy(Terminator = char, Char = immutable char)
(KeepTerminator keepTerminator = KeepTerminator.no,
Expand Down Expand Up @@ -2416,7 +2416,7 @@ void main()
}
---
$(XREF_PACK algorithm,iteration,joiner) can be used to join chunks together into
$(REF joiner, std,algorithm,iteration) can be used to join chunks together into
a single range lazily.
Example:
---
Expand Down Expand Up @@ -3471,8 +3471,8 @@ Params:
args = The first argument $(D args[0]) should be the format string, specifying
how to format the rest of the arguments. For a full description of the syntax
of the format string and how it controls the formatting of the rest of the
arguments, please refer to the documentation for $(XREF format,
formattedWrite).
arguments, please refer to the documentation for $(REF formattedWrite,
std,format).
Note: In older versions of Phobos, it used to be possible to write:
Expand Down Expand Up @@ -3568,7 +3568,7 @@ unittest
/**
* Read data from $(D stdin) according to the specified
* $(LINK2 std_format.html#format-string, format specifier) using
* $(XREF format,formattedRead).
* $(REF formattedRead, std,format).
*/
uint readf(A...)(in char[] format, A args)
{
Expand Down Expand Up @@ -3632,7 +3632,7 @@ if (isSomeString!S)
* $(D size_t) 0 for end of file, otherwise number of characters read
* Params:
* buf = Buffer used to store the resulting line data. buf is resized as necessary.
* terminator = Line terminator (by default, $(D '\n')). Use $(XREF ascii, newline)
* terminator = Line terminator (by default, $(D '\n')). Use $(REF newline, std,ascii)
* for portability (unless the file was opened in text mode).
* Throws:
* $(D StdioException) on I/O error, or $(D UnicodeException) on Unicode conversion error.
Expand Down Expand Up @@ -4173,7 +4173,7 @@ unittest
/**
Writes an array or range to a file.
Shorthand for $(D data.copy(File(fileName, "wb").lockingBinaryWriter)).
Similar to $(XREF file,write), strings are written as-is,
Similar to $(REF write, std,file), strings are written as-is,
rather than encoded according to the $(D File)'s $(WEB
en.cppreference.com/w/c/io#Narrow_and_wide_orientation,
orientation).
Expand Down
48 changes: 24 additions & 24 deletions std/string.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -135,8 +135,8 @@ See_Also:
)
Macros:
SHORTXREF=$(XREF2 $1, $2, $(TT $2))
SHORTXREF_PACK=$(XREF_PACK_NAMED $1,$2,$3, $(TT $3))
SHORTXREF=$(REF_ALTTEXT $(TT $2), $2, std,$1)
SHORTXREF_PACK=$(REF_ALTTEXT $(TT $3), $3, std,$1,$2)
Copyright: Copyright Digital Mars 2007-.
Expand Down Expand Up @@ -376,7 +376,7 @@ alias CaseSensitive = Flag!"caseSensitive";
Throws:
If the sequence starting at $(D startIdx) does not represent a well
formed codepoint, then a $(XREF utf,UTFException) may be thrown.
formed codepoint, then a $(REF UTFException, std,utf) may be thrown.
+/
ptrdiff_t indexOf(Range)(Range s, in dchar c,
Expand Down Expand Up @@ -699,7 +699,7 @@ unittest
Throws:
If the sequence starting at $(D startIdx) does not represent a well
formed codepoint, then a $(XREF utf,UTFException) may be thrown.
formed codepoint, then a $(REF UTFException, std,utf) may be thrown.
Bugs:
Does not work with case insensitive strings where the mapping of
Expand Down Expand Up @@ -971,7 +971,7 @@ unittest
Throws:
If the sequence ending at $(D startIdx) does not represent a well
formed codepoint, then a $(XREF utf,UTFException) may be thrown.
formed codepoint, then a $(REF UTFException, std,utf) may be thrown.
$(D cs) indicates whether the comparisons are case sensitive.
+/
Expand Down Expand Up @@ -1157,7 +1157,7 @@ ptrdiff_t lastIndexOf(Char)(const(Char)[] s, in dchar c, in size_t startIdx,
Throws:
If the sequence ending at $(D startIdx) does not represent a well
formed codepoint, then a $(XREF utf,UTFException) may be thrown.
formed codepoint, then a $(REF UTFException, std,utf) may be thrown.
$(D cs) indicates whether the comparisons are case sensitive.
+/
Expand Down Expand Up @@ -1538,7 +1538,7 @@ private ptrdiff_t indexOfAnyNeitherImpl(bool forward, bool any, Char, Char2)(
then $(D -1) is returned. The $(D startIdx) slices $(D haystack) in the
following way $(D haystack[startIdx .. $]). $(D startIdx) represents a
codeunit index in $(D haystack). If the sequence ending at $(D startIdx)
does not represent a well formed codepoint, then a $(XREF utf,UTFException)
does not represent a well formed codepoint, then a $(REF UTFException, std,utf)
may be thrown.
Params:
Expand Down Expand Up @@ -1707,7 +1707,7 @@ ptrdiff_t indexOfAny(Char,Char2)(const(Char)[] haystack, const(Char2)[] needles,
then $(D -1) is returned. The $(D stopIdx) slices $(D haystack) in the
following way $(D s[0 .. stopIdx]). $(D stopIdx) represents a codeunit
index in $(D haystack). If the sequence ending at $(D startIdx) does not
represent a well formed codepoint, then a $(XREF utf,UTFException) may be
represent a well formed codepoint, then a $(REF UTFException, std,utf) may be
thrown.
Params:
Expand Down Expand Up @@ -2281,7 +2281,7 @@ auto representation(Char)(Char[] s) @safe pure nothrow @nogc
* The capitalized string.
*
* See_Also:
* $(XREF uni, asCapitalized) for a lazy range version that doesn't allocate memory
* $(REF asCapitalized, std,uni) for a lazy range version that doesn't allocate memory
*/
S capitalize(S)(S input) @trusted pure
if (isSomeString!S)
Expand Down Expand Up @@ -2350,8 +2350,8 @@ auto capitalize(S)(auto ref S s)

/++
Split $(D s) into an array of lines according to the unicode standard using
$(D '\r'), $(D '\n'), $(D "\r\n"), $(XREF uni, lineSep),
$(XREF uni, paraSep), $(D U+0085) (NEL), $(D '\v') and $(D '\f')
$(D '\r'), $(D '\n'), $(D "\r\n"), $(REF lineSep, std,uni),
$(REF paraSep, std,uni), $(D U+0085) (NEL), $(D '\v') and $(D '\f')
as delimiters. If $(D keepTerm) is set to $(D KeepTerminator.yes), then the
delimiter is included in the strings returned.
Expand All @@ -2371,8 +2371,8 @@ auto capitalize(S)(auto ref S s)
array of strings, each element is a line that is a slice of $(D s)
See_Also:
$(LREF lineSplitter)
$(XREF algorithm, splitter)
$(XREF regex, splitter)
$(REF splitter, std,algorithm)
$(REF splitter, std,regex)
+/
alias KeepTerminator = Flag!"keepTerminator";

Expand Down Expand Up @@ -2679,7 +2679,7 @@ public:
/***********************************
* Split an array or slicable range of characters into a range of lines
using $(D '\r'), $(D '\n'), $(D '\v'), $(D '\f'), $(D "\r\n"),
$(XREF uni, lineSep), $(XREF uni, paraSep) and $(D '\u0085') (NEL)
$(REF lineSep, std,uni), $(REF paraSep, std,uni) and $(D '\u0085') (NEL)
as delimiters. If $(D keepTerm) is set to $(D KeepTerminator.yes), then the
delimiter is included in the slices returned.
Expand All @@ -2698,8 +2698,8 @@ public:
See_Also:
$(LREF splitLines)
$(XREF algorithm, splitter)
$(XREF regex, splitter)
$(REF splitter, std,algorithm)
$(REF splitter, std,regex)
*/
auto lineSplitter(KeepTerminator keepTerm = KeepTerminator.no, Range)(Range r)
if ((hasSlicing!Range && hasLength!Range && isSomeChar!(ElementType!Range) ||
Expand Down Expand Up @@ -2819,15 +2819,15 @@ unittest
}

/++
Strips leading whitespace (as defined by $(XREF uni, isWhite)).
Strips leading whitespace (as defined by $(REF isWhite, std,uni)).
Params:
input = string or ForwardRange of characters
Returns: $(D input) stripped of leading whitespace.
Postconditions: $(D input) and the returned value
will share the same tail (see $(XREF array, sameTail)).
will share the same tail (see $(REF sameTail, std,array)).
See_Also:
Generic stripping on ranges: $(REF _stripLeft, std, algorithm, mutation)
Expand Down Expand Up @@ -2893,7 +2893,7 @@ unittest
}

/++
Strips trailing whitespace (as defined by $(XREF uni, isWhite)).
Strips trailing whitespace (as defined by $(REF isWhite, std,uni)).
Params:
str = string or random access range of characters
Expand Down Expand Up @@ -3055,7 +3055,7 @@ unittest

/++
Strips both leading and trailing whitespace (as defined by
$(XREF uni, isWhite)).
$(REF isWhite, std,uni)).
Params:
str = string or random access range of characters
Expand Down Expand Up @@ -3158,7 +3158,7 @@ auto strip(Range)(auto ref Range str)
$(D delimiter), then it is returned unchanged.
If no $(D delimiter) is given, then one trailing $(D '\r'), $(D '\n'),
$(D "\r\n"), $(D '\f'), $(D '\v'), $(XREF uni, lineSep), $(XREF uni, paraSep), or $(XREF uni, nelSep)
$(D "\r\n"), $(D '\f'), $(D '\v'), $(REF lineSep, std,uni), $(REF paraSep, std,uni), or $(REF nelSep, std,uni)
is removed from the end of $(D str). If $(D str) does not end with any of those characters,
then it is returned unchanged.
Expand Down Expand Up @@ -4744,7 +4744,7 @@ unittest
See_Also:
$(LREF tr)
$(XREF array, replace)
$(REF replace, std,array)
Params:
str = The original string.
Expand Down Expand Up @@ -5012,7 +5012,7 @@ private void translateImpl(C1, T, C2, Buffer)(C1[] str,
See_Also:
$(LREF tr)
$(XREF array, replace)
$(REF replace, std,array)
Params:
str = The original string.
Expand Down Expand Up @@ -5447,7 +5447,7 @@ S squeeze(S)(S s, in S pattern = null)
/***************************************************************
Finds the position $(D_PARAM pos) of the first character in $(D_PARAM
s) that does not match $(D_PARAM pattern) (in the terminology used by
$(XREF string,inPattern)). Updates $(D_PARAM s =
$(REF inPattern, std,string)). Updates $(D_PARAM s =
s[pos..$]). Returns the slice from the beginning of the original
(before update) string up to, and excluding, $(D_PARAM pos).
Expand Down
2 changes: 1 addition & 1 deletion std/traits.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -3330,7 +3330,7 @@ Returns:
Note:
An enum can have multiple members which have the same value. If you want
to use EnumMembers to e.g. generate switch cases at compile-time,
you should use the $(XREF typetuple, NoDuplicates) template to avoid
you should use the $(REF NoDuplicates, std,typetuple) template to avoid
generating duplicate switch cases.

Note:
Expand Down
4 changes: 2 additions & 2 deletions std/typecons.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -310,7 +310,7 @@ for the second, and so on.
The choice of zero-based indexing instead of one-base indexing was
motivated by the ability to use value `Tuple`s with various compile-time
loop constructs (e.g. $(XREF meta, AliasSeq) iteration), all of which use
loop constructs (e.g. $(REF AliasSeq, std,meta) iteration), all of which use
zero-based indexing.
Params:
Expand Down Expand Up @@ -6888,7 +6888,7 @@ However, member types in `struct`s or `class`es are not replaced because there
are no ways to express the types resulting after replacement.
This is an advanced type manipulation necessary e.g. for replacing the
placeholder type `This` in $(XREF variant, Algebraic).
placeholder type `This` in $(REF Algebraic, std,variant).
Returns: `ReplaceType` aliases itself to the type(s) that result after
replacement.
Expand Down
2 changes: 1 addition & 1 deletion std/typetuple.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -12,7 +12,7 @@ module std.typetuple;
public import std.meta;

/**
* Alternate name for $(XREF meta,AliasSeq) for legacy compatibility.
* Alternate name for $(REF AliasSeq, std,meta) for legacy compatibility.
*/
alias TypeTuple = AliasSeq;

Expand Down
30 changes: 15 additions & 15 deletions std/uni.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@
$(P The $(D std.uni) module provides an implementation
of fundamental Unicode algorithms and data structures.
This doesn't include UTF encoding and decoding primitives,
see $(XREF _utf, decode) and $(XREF _utf, encode) in std.utf
see $(REF decode, std,_utf) and $(REF encode, std,_utf) in std.utf
for this functionality. )
$(P All primitives listed operate on Unicode characters and
Expand Down Expand Up @@ -1851,7 +1851,7 @@ public alias CodepointSet = InversionList!GcPolicy;
// public alias CodepointInterval = Tuple!(uint, "a", uint, "b");

/**
The recommended type of $(XREF _typecons, Tuple)
The recommended type of $(REF Tuple, std,_typecons)
to represent [a, b$(RPAREN) intervals of $(CODEPOINTS). As used in $(LREF InversionList).
Any interval type should pass $(LREF isIntegralPair) trait.
*/
Expand Down Expand Up @@ -2293,8 +2293,8 @@ public:
open-right intervals and feed it to $(D sink).
)
$(P Used by various standard formatting facilities such as
$(XREF _format, formattedWrite), $(XREF _stdio, write),
$(XREF _stdio, writef), $(XREF _conv, to) and others.
$(REF formattedWrite, std,_format), $(REF write, std,_stdio),
$(REF writef, std,_stdio), $(REF to, std,_conv) and others.
)
Example:
---
Expand Down Expand Up @@ -4322,9 +4322,9 @@ private template buildTrie(Value, Key, Args...)
In other words $(LREF mapTrieIndex) should be a
monotonically increasing function that maps $(D Key) to an integer.
See_Also: $(XREF _algorithm, sort),
$(XREF _range, SortedRange),
$(XREF _algorithm, setUnion).
See_Also: $(REF sort, std,_algorithm),
$(REF SortedRange, std,_range),
$(REF setUnion, std,_algorithm).
*/
auto buildTrie(Range)(Range range, Value filler=Value.init)
if (isInputRange!Range && is(typeof(Range.init.front[0]) : Value)
Expand Down Expand Up @@ -6948,7 +6948,7 @@ unittest
See_Also:
$(LREF icmp)
$(XREF_PACK algorithm,comparison,cmp)
$(REF cmp, std,algorithm,comparison)
+/
int sicmp(S1, S2)(S1 str1, S2 str2) if (isSomeString!S1 && isSomeString!S2)
{
Expand Down Expand Up @@ -7073,7 +7073,7 @@ private int fullCasedCmp(Range)(dchar lhs, dchar rhs, ref Range rtail)
See_Also:
$(LREF sicmp)
$(XREF_PACK algorithm,comparison,cmp)
$(REF cmp, std,algorithm,comparison)
+/
int icmp(S1, S2)(S1 str1, S2 str2)
if (isForwardRange!S1 && is(Unqual!(ElementType!S1) == dchar)
Expand Down Expand Up @@ -7116,7 +7116,7 @@ unittest
}

/**
* By using $(XREF utf, byUTF) and its aliases, GC allocations via auto-decoding
* By using $(REF byUTF, std,utf) and its aliases, GC allocations via auto-decoding
* and thrown exceptions can be avoided, making `icmp` `@safe @nogc nothrow pure`.
*/
@safe @nogc nothrow pure unittest
Expand Down Expand Up @@ -8203,7 +8203,7 @@ private auto toCaser(alias indexFn, uint maxIdx, alias tableFn, alias asciiConve
*
* Does not allocate memory.
* Characters in UTF-8 or UTF-16 format that cannot be decoded
* are treated as $(XREF utf, replacementDchar).
* are treated as $(REF replacementDchar, std,utf).
*
* Params:
* str = string or range of characters
Expand Down Expand Up @@ -8423,7 +8423,7 @@ private auto toCapitalizer(alias indexFnUpper, uint maxIdxUpper, alias tableFnUp
*
* Does not allocate memory.
* Characters in UTF-8 or UTF-16 format that cannot be decoded
* are treated as $(XREF utf, replacementDchar).
* are treated as $(REF replacementDchar, std,utf).
*
* Params:
* str = string or range of characters
Expand Down Expand Up @@ -8954,11 +8954,11 @@ unittest
Certain alphabets like German and Greek have no 1:1
upper-lower mapping. Use overload of toUpper which takes full string instead.
toUpper can be used as an argument to $(XREF_PACK algorithm,iteration,map)
toUpper can be used as an argument to $(REF map, std,algorithm,iteration)
to produce an algorithm that can convert a range of characters to upper case
without allocating memory.
A string can then be produced by using $(XREF_PACK algorithm,mutation,copy)
to send it to an $(XREF array, appender).
A string can then be produced by using $(REF copy, std,algorithm,mutation)
to send it to an $(REF appender, std,array).
+/
@safe pure nothrow @nogc
dchar toUpper(dchar c)
Expand Down
2 changes: 1 addition & 1 deletion std/utf.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -3103,7 +3103,7 @@ enum dchar replacementDchar = '\uFFFD';
* Iterate a range of char, wchar, or dchars by code unit.
*
* The purpose is to bypass the special case decoding that
* $(XREF array,front) does to character arrays.
* $(REF front, std,array) does to character arrays.
* Params:
* r = input range of characters, or array of characters
* Returns:
Expand Down
6 changes: 3 additions & 3 deletions std/uuid.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -161,7 +161,7 @@ public struct UUID
* possible to read, compare and use all these Variants, but
* UUIDs generated by this module will always be in rfc4122 format.
*
* Note: Do not confuse this with $(XREF _variant, _Variant).
* Note: Do not confuse this with $(REF _Variant, std,_variant).
*/
enum Variant
{
Expand Down Expand Up @@ -518,7 +518,7 @@ public struct UUID
* RFC 4122 defines different internal data layouts for UUIDs.
* Returns the format used by this UUID.
*
* Note: Do not confuse this with $(XREF _variant, _Variant).
* Note: Do not confuse this with $(REF _Variant, std,_variant).
* The type of this property is $(MYREF3 std.uuid.UUID.Variant, _Variant).
*
* See_Also:
Expand Down Expand Up @@ -1208,7 +1208,7 @@ unittest
/**
* Params:
* randomGen = uniform RNG
* See_Also: $(XREF random, isUniformRNG)
* See_Also: $(REF isUniformRNG, std,random)
*/
UUID randomUUID(RNG)(ref RNG randomGen)
if (isInputRange!RNG && isIntegral!(ElementType!RNG))
Expand Down
2 changes: 1 addition & 1 deletion std/zip.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -155,7 +155,7 @@ final class ArchiveMember

/**
* Set the OS specific file attributes, as obtained by
* $(XREF file,getAttributes) or $(XREF file,DirEntry.attributes), for this archive member.
* $(REF getAttributes, std,file) or $(REF DirEntry.attributes, std,file), for this archive member.
*/
@property void fileAttributes(uint attr)
{
Expand Down