clean up remaining XREFs (manual)

Found by: grep -r '$(XREF'

std.experimental.allocator has a custom XREF2. Leaving that as is for now.

changelog.dd

@@ -7,8 +7,8 @@ $(COMMENT Pending changelog for 2.072. This will get copied to dlang.org and
 $(BUGSTITLE Library Changes,
     $(LI $(RELATIVE_LINK2 process, Process creation in `std.process` was sped up
         on Posix.))
-    $(LI $(RELATIVE_LINK2 std-algorithm-iteration-cumulativeFold, $(XREF
-        algorithm.iterator, cumulativeFold) was added.))
+    $(LI $(RELATIVE_LINK2 std-algorithm-iteration-cumulativeFold,
+        `algorithm.iteration.cumulativeFold` was added.))
     $(LI $(RELATIVE_LINK2 padLeft-padRight, `std.range.padLeft` and
         `std.range.padRight` were added.))
     $(LI $(RELATIVE_LINK2 regex-multiple-patterns, `std.regex.regex` now
@@ -45,7 +45,7 @@ $(BUGSTITLE Library Changes,
         $(REF to, std,conv) instead.)
     $(LI $(RELATIVE_LINK2 min-max-element,
     `std.algorithm.searching.{min,max}Element` for ranges have been added.))
-    $(LI $(XREF Ternary, std,typecons) was added to represent three valued
+    $(LI $(REF Ternary, std,typecons) was added to represent three valued
     logic.)
 )
 
@@ -60,10 +60,10 @@ $(LI $(LNAME2 process, Process creation in `std.process` was sped up on Posix.)
     )
 )
 
-$(LI $(LNAME2 std-algorithm-iteration-cumulativeFold, $(XREF algorithm.iteration,
-cumulativeFold) was added.)
+$(LI $(LNAME2 std-algorithm-iteration-cumulativeFold,
+    `algorithm.iteration.cumulativeFold` was added.))
 
-    $(P $(REF cumulativeFold, std,algorithm.iterator) returns the successive
+    $(P $(REF cumulativeFold, std,algorithm,iteration) returns the successive
         reduced values of an input range.)
 ------
 assert([1, 2, 3, 4, 5].cumulativeFold!((a, b) => a + b).array == [1, 3, 6, 10, 15]);
@@ -213,8 +213,8 @@ $(LI $(LNAME2 iota-length-size_t, `std.range.iota's `.length` property is fixed
 
 $(LI $(LNAME2 min-max-element, `std.algorithm.searching.{min,max}Element`
 	have been added.)
-    $(P $(XREF algorithm, searching, minElement) and $(XREF algorithm,
-    searching, maxElement) are functions to search for the minimum and maximum
+    $(P $(REF minElement, algorithm,searching) and $(REF maxElement,
+    algorithm,searching) are functions to search for the minimum and maximum
     element in a range. They support a custom `map` accessor.
     )
 

std/algorithm/iteration.d

@@ -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)
@@ -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`.
@@ -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
@@ -4883,8 +4883,8 @@ 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:
 $(REF nextPermutation, std,algorithm,sorting).

std/algorithm/searching.d

@@ -1610,8 +1610,7 @@ 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:
 
@@ -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.
@@ -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)
@@ -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 &&

std/container/package.d

@@ -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.
  */

std/csv.d

@@ -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
 {

std/stdio.d

@@ -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:
 

std/string.d

@@ -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-.