Showing with 367 additions and 367 deletions.
  1. +1 −1 etc/c/odbc/sql.d
  2. +1 −1 etc/c/odbc/sqlext.d
  3. +1 −1 etc/c/odbc/sqltypes.d
  4. +1 −1 etc/c/odbc/sqlucode.d
  5. +6 −6 std/algorithm/comparison.d
  6. +15 −15 std/algorithm/iteration.d
  7. +6 −6 std/algorithm/mutation.d
  8. +3 −3 std/algorithm/package.d
  9. +6 −6 std/algorithm/searching.d
  10. +2 −2 std/algorithm/setops.d
  11. +9 −9 std/algorithm/sorting.d
  12. +2 −2 std/array.d
  13. +3 −3 std/ascii.d
  14. +2 −2 std/base64.d
  15. +2 −2 std/bigint.d
  16. +3 −3 std/bitmanip.d
  17. +2 −2 std/compiler.d
  18. +1 −1 std/complex.d
  19. +1 −1 std/concurrencybase.d
  20. +2 −2 std/container/array.d
  21. +3 −3 std/container/binaryheap.d
  22. +2 −2 std/container/dlist.d
  23. +2 −2 std/container/package.d
  24. +2 −2 std/container/rbtree.d
  25. +2 −2 std/container/slist.d
  26. +2 −2 std/container/util.d
  27. +3 −3 std/conv.d
  28. +1 −1 std/cstream.d
  29. +3 −3 std/csv.d
  30. +35 −35 std/datetime.d
  31. +2 −2 std/demangle.d
  32. +1 −1 std/digest/crc.d
  33. +1 −1 std/digest/digest.d
  34. +3 −3 std/digest/hmac.d
  35. +1 −1 std/digest/md.d
  36. +1 −1 std/digest/murmurhash.d
  37. +1 −1 std/digest/ripemd.d
  38. +1 −1 std/digest/sha.d
  39. +1 −1 std/encoding.d
  40. +3 −3 std/exception.d
  41. +1 −1 std/experimental/allocator/building_blocks/free_list.d
  42. +2 −2 std/experimental/allocator/building_blocks/kernighan_ritchie.d
  43. +6 −6 std/experimental/allocator/building_blocks/package.d
  44. +1 −1 std/experimental/allocator/building_blocks/region.d
  45. +1 −1 std/experimental/allocator/building_blocks/stats_collector.d
  46. +1 −1 std/experimental/allocator/common.d
  47. +4 −4 std/experimental/allocator/mallocator.d
  48. +2 −2 std/experimental/allocator/package.d
  49. +1 −1 std/experimental/logger/package.d
  50. +1 −1 std/experimental/ndslice/iteration.d
  51. +1 −1 std/experimental/ndslice/package.d
  52. +1 −1 std/experimental/ndslice/selection.d
  53. +1 −1 std/experimental/ndslice/slice.d
  54. +3 −3 std/experimental/typecons.d
  55. +8 −8 std/file.d
  56. +3 −3 std/format.d
  57. +3 −3 std/functional.d
  58. +3 −3 std/getopt.d
  59. +1 −1 std/internal/math/errorfunction.d
  60. +1 −1 std/internal/math/gammafunction.d
  61. +1 −1 std/internal/processinit.d
  62. +1 −1 std/internal/unicode_tables.d
  63. +1 −1 std/internal/windows/advapi32.d
  64. +1 −1 std/json.d
  65. +3 −3 std/math.d
  66. +1 −1 std/mathspecial.d
  67. +3 −3 std/meta.d
  68. +2 −2 std/mmfile.d
  69. +27 −27 std/net/curl.d
  70. +6 −6 std/numeric.d
  71. +2 −2 std/outbuffer.d
  72. +1 −1 std/parallelism.d
  73. +4 −4 std/path.d
  74. +7 −7 std/process.d
  75. +8 −8 std/random.d
  76. +3 −3 std/range/interfaces.d
  77. +10 −10 std/range/package.d
  78. +3 −3 std/range/primitives.d
  79. +4 −4 std/regex/package.d
  80. +2 −2 std/signals.d
  81. +3 −3 std/socket.d
  82. +2 −2 std/stdint.d
  83. +22 −22 std/stdio.d
  84. +2 −2 std/stdiobase.d
  85. +6 −6 std/string.d
  86. +2 −2 std/system.d
  87. +5 −5 std/traits.d
  88. +7 −7 std/typecons.d
  89. +1 −1 std/typetuple.d
  90. +17 −17 std/uni.d
  91. +2 −2 std/uri.d
  92. +4 −4 std/utf.d
  93. +1 −1 std/uuid.d
  94. +5 −5 std/variant.d
  95. +2 −2 std/windows/charset.d
  96. +1 −1 std/windows/registry.d
  97. +2 −2 std/windows/syserror.d
  98. +1 −1 std/xml.d
  99. +2 −2 std/zip.d
  100. +4 −4 std/zlib.d
  101. +2 −2 unittest.d
2 changes: 1 addition & 1 deletion etc/c/odbc/sql.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
Declarations for interfacing with the ODBC library.
Adapted with minimal changes from the work of David L. Davis
(refer to the $(WEB
(refer to the $(HTTP
forum.dlang.org/post/cfk7ql$(DOLLAR)1p4n$(DOLLAR)1@digitaldaemon.com,
original announcement)).
Expand Down
2 changes: 1 addition & 1 deletion etc/c/odbc/sqlext.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
Declarations for interfacing with the ODBC library.
Adapted with minimal changes from the work of David L. Davis
(refer to the $(WEB
(refer to the $(HTTP
forum.dlang.org/post/cfk7ql$(DOLLAR)1p4n$(DOLLAR)1@digitaldaemon.com,
original announcement)).
Expand Down
2 changes: 1 addition & 1 deletion etc/c/odbc/sqltypes.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
Declarations for interfacing with the ODBC library.
Adapted with minimal changes from the work of David L. Davis
(refer to the $(WEB
(refer to the $(HTTP
forum.dlang.org/post/cfk7ql$(DOLLAR)1p4n$(DOLLAR)1@digitaldaemon.com,
original announcement)).
Expand Down
2 changes: 1 addition & 1 deletion etc/c/odbc/sqlucode.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
Declarations for interfacing with the ODBC library.
Adapted with minimal changes from the work of David L. Davis
(refer to the $(WEB
(refer to the $(HTTP
forum.dlang.org/post/cfk7ql$(DOLLAR)1p4n$(DOLLAR)1@digitaldaemon.com,
original announcement)).
Expand Down
12 changes: 6 additions & 6 deletions std/algorithm/comparison.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -44,9 +44,9 @@ $(T2 predSwitch,
Copyright: Andrei Alexandrescu 2008-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.com, Andrei Alexandrescu)
Authors: $(HTTP erdani.com, Andrei Alexandrescu)
Source: $(PHOBOSSRC std/algorithm/_comparison.d)
Expand Down Expand Up @@ -725,7 +725,7 @@ template equal(alias pred = "a == b")
for element, according to binary predicate $(D pred).
See_Also:
$(WEB sgi.com/tech/stl/_equal.html, STL's _equal)
$(HTTP sgi.com/tech/stl/_equal.html, STL's _equal)
+/
bool equal(Range1, Range2)(Range1 r1, Range2 r2)
if (isInputRange!Range1 && isInputRange!Range2 && is(typeof(binaryFun!pred(r1.front, r2.front))))
Expand Down Expand Up @@ -921,7 +921,7 @@ private template MaxType(T...)

// levenshteinDistance
/**
Encodes $(WEB realityinteractive.com/rgrzywinski/archives/000249.html,
Encodes $(HTTP realityinteractive.com/rgrzywinski/archives/000249.html,
edit operations) necessary to transform one sequence into
another. Given sequences $(D s) (source) and $(D t) (target), a
sequence of $(D EditOp) encodes the steps that need to be taken to
Expand Down Expand Up @@ -1116,7 +1116,7 @@ private:
}

/**
Returns the $(WEB wikipedia.org/wiki/Levenshtein_distance, Levenshtein
Returns the $(HTTP wikipedia.org/wiki/Levenshtein_distance, Levenshtein
distance) between $(D s) and $(D t). The Levenshtein distance computes
the minimal amount of edit operations necessary to transform $(D s)
into $(D t). Performs $(BIGOH s.length * t.length) evaluations of $(D
Expand Down Expand Up @@ -1490,7 +1490,7 @@ two mismatched values. Performs $(BIGOH min(r1.length, r2.length))
evaluations of $(D pred).
See_Also:
$(WEB sgi.com/tech/stl/_mismatch.html, STL's _mismatch)
$(HTTP sgi.com/tech/stl/_mismatch.html, STL's _mismatch)
*/
Tuple!(Range1, Range2)
mismatch(alias pred = "a == b", Range1, Range2)(Range1 r1, Range2 r2)
Expand Down
30 changes: 15 additions & 15 deletions std/algorithm/iteration.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -54,9 +54,9 @@ $(T2 uniq,
Copyright: Andrei Alexandrescu 2008-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.com, Andrei Alexandrescu)
Authors: $(HTTP erdani.com, Andrei Alexandrescu)
Source: $(PHOBOSSRC std/algorithm/_iteration.d)
Expand Down Expand Up @@ -451,7 +451,7 @@ Returns:
fun, the element type will be $(D Tuple) containing one element for each fun.
See_Also:
$(WEB en.wikipedia.org/wiki/Map_(higher-order_function), Map (higher-order function))
$(HTTP en.wikipedia.org/wiki/Map_(higher-order_function), Map (higher-order function))
*/
template map(fun...) if (fun.length >= 1)
{
Expand Down Expand Up @@ -1041,7 +1041,7 @@ Returns:
which $(D predicate(x)) returns $(D true).
See_Also:
$(WEB en.wikipedia.org/wiki/Filter_(higher-order_function), Filter (higher-order function))
$(HTTP en.wikipedia.org/wiki/Filter_(higher-order_function), Filter (higher-order function))
*/
template filter(alias predicate) if (is(typeof(unaryFun!predicate)))
{
Expand Down Expand Up @@ -2571,7 +2571,7 @@ Returns:
the accumulated $(D result)
See_Also:
$(WEB en.wikipedia.org/wiki/Fold_(higher-order_function), Fold (higher-order function))
$(HTTP en.wikipedia.org/wiki/Fold_(higher-order_function), Fold (higher-order function))
$(LREF fold) is functionally equivalent to $(LREF reduce) with the argument order reversed,
and without the need to use $(LREF tuple) for multiple seeds. This makes it easier
Expand Down Expand Up @@ -3017,7 +3017,7 @@ Returns:
the accumulated $(D result)
See_Also:
$(WEB en.wikipedia.org/wiki/Fold_(higher-order_function), Fold (higher-order function))
$(HTTP en.wikipedia.org/wiki/Fold_(higher-order_function), Fold (higher-order function))
$(LREF sum) is similar to $(D fold!((a, b) => a + b)) that offers
precise summing of floating point numbers.
Expand Down Expand Up @@ -3085,17 +3085,17 @@ The one-argument version $(D cumulativeFold!(fun)(range)) works similarly, but
it returns the first element unchanged and uses it as seed for the next
elements.
This function is also known as
$(WEB en.cppreference.com/w/cpp/algorithm/partial_sum, partial_sum),
$(WEB docs.python.org/3/library/itertools.html#itertools.accumulate, accumulate),
$(WEB hackage.haskell.org/package/base-4.8.2.0/docs/Prelude.html#v:scanl, scan),
$(WEB mathworld.wolfram.com/CumulativeSum.html, Cumulative Sum).
$(HTTP en.cppreference.com/w/cpp/algorithm/partial_sum, partial_sum),
$(HTTP docs.python.org/3/library/itertools.html#itertools.accumulate, accumulate),
$(HTTP hackage.haskell.org/package/base-4.8.2.0/docs/Prelude.html#v:scanl, scan),
$(HTTP 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 $(REF Tuple,
std,typecons) containing one element for each `fun`.
See_Also:
$(WEB en.wikipedia.org/wiki/Prefix_sum, Prefix Sum)
$(HTTP en.wikipedia.org/wiki/Prefix_sum, Prefix Sum)
+/
template cumulativeFold(fun...)
if (fun.length >= 1)
Expand Down Expand Up @@ -4479,11 +4479,11 @@ $(LI If $(D $(REF ElementType, std,range,primitives)!R) is a floating-point
type and $(D R) is a
$(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)
$(HTTP en.wikipedia.org/wiki/Pairwise_summation, pairwise summation)
algorithm.)
$(LI If $(D ElementType!R) is a floating-point type and $(D R) is a
finite input range (but not a random-access range with slicing), then
$(D sum) uses the $(WEB en.wikipedia.org/wiki/Kahan_summation,
$(D sum) uses the $(HTTP en.wikipedia.org/wiki/Kahan_summation,
Kahan summation) algorithm.)
$(LI In all other cases, a simple element by element addition is done.)
)
Expand Down Expand Up @@ -4761,7 +4761,7 @@ unittest
// uniq
/**
Lazily iterates unique consecutive elements of the given range (functionality
akin to the $(WEB wikipedia.org/wiki/_Uniq, _uniq) system
akin to the $(HTTP 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
$(REF binaryFun, std,functional), and can either accept a string, or any callable
Expand Down Expand Up @@ -4892,7 +4892,7 @@ private struct UniqResult(alias pred, Range)
}

/**
Lazily computes all _permutations of $(D r) using $(WEB
Lazily computes all _permutations of $(D r) using $(HTTP
en.wikipedia.org/wiki/Heap%27s_algorithm, Heap's algorithm).
Returns:
Expand Down
12 changes: 6 additions & 6 deletions std/algorithm/mutation.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -59,9 +59,9 @@ $(T2 uninitializedFill,
Copyright: Andrei Alexandrescu 2008-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.com, Andrei Alexandrescu)
Authors: $(HTTP erdani.com, Andrei Alexandrescu)
Source: $(PHOBOSSRC std/algorithm/_mutation.d)
Expand Down Expand Up @@ -106,7 +106,7 @@ Returns:
The number of elements brought to the front, i.e., the length of $(D back).
See_Also:
$(WEB sgi.com/tech/stl/_rotate.html, STL's rotate)
$(HTTP sgi.com/tech/stl/_rotate.html, STL's rotate)
*/
size_t bringToFront(Range1, Range2)(Range1 front, Range2 back)
if (isInputRange!Range1 && isForwardRange!Range2)
Expand Down Expand Up @@ -303,7 +303,7 @@ Returns:
The unfilled part of target
See_Also:
$(WEB sgi.com/tech/stl/_copy.html, STL's _copy)
$(HTTP sgi.com/tech/stl/_copy.html, STL's _copy)
*/
TargetRange copy(SourceRange, TargetRange)(SourceRange source, TargetRange target)
if (areCopyCompatibleArrays!(SourceRange, TargetRange))
Expand Down Expand Up @@ -413,7 +413,7 @@ use $(LREF filter):

/**
$(REF retro, std,range) can be used to achieve behavior similar to
$(WEB sgi.com/tech/stl/copy_backward.html, STL's copy_backward'):
$(HTTP sgi.com/tech/stl/copy_backward.html, STL's copy_backward'):
*/
@safe unittest
{
Expand Down Expand Up @@ -1892,7 +1892,7 @@ Params:
r = a bidirectional range with swappable elements or a random access range with a length member
See_Also:
$(WEB sgi.com/tech/stl/_reverse.html, STL's _reverse)
$(HTTP sgi.com/tech/stl/_reverse.html, STL's _reverse)
*/
void reverse(Range)(Range r)
if (isBidirectionalRange!Range && !isRandomAccessRange!Range
Expand Down
6 changes: 3 additions & 3 deletions std/algorithm/package.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -4,7 +4,7 @@
This package implements generic algorithms oriented towards the processing of
sequences. Sequences processed by these functions define range-based
interfaces. See also $(LINK2 std_range.html, Reference on ranges) and
$(WEB ddili.org/ders/d.en/ranges.html, tutorial on ranges).
$(HTTP ddili.org/ders/d.en/ranges.html, tutorial on ranges).
$(SCRIPT inhibitQuickIndex = 1;)
Expand Down Expand Up @@ -174,9 +174,9 @@ SUBREF = $(REF_ALTTEXT $(TT $2), $2, std, algorithm, $1)$(NBSP)
Copyright: Andrei Alexandrescu 2008-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.com, Andrei Alexandrescu)
Authors: $(HTTP erdani.com, Andrei Alexandrescu)
Source: $(PHOBOSSRC std/_algorithm/package.d)
*/
Expand Down
12 changes: 6 additions & 6 deletions std/algorithm/searching.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -86,9 +86,9 @@ $(T2 until,
Copyright: Andrei Alexandrescu 2008-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.com, Andrei Alexandrescu)
Authors: $(HTTP erdani.com, Andrei Alexandrescu)
Source: $(PHOBOSSRC std/algorithm/_searching.d)
Expand Down Expand Up @@ -1344,7 +1344,7 @@ that is, until $(D binaryFun!pred(haystack.front, needle)) is $(D true). If no
such position exists, returns an empty $(D haystack).
See_Also:
$(WEB sgi.com/tech/stl/_find.html, STL's _find)
$(HTTP sgi.com/tech/stl/_find.html, STL's _find)
*/
InputRange find(alias pred = "a == b", InputRange, Element)(InputRange haystack, Element needle)
if (isInputRange!InputRange &&
Expand Down Expand Up @@ -1628,7 +1628,7 @@ that is, until $(D binaryFun!pred(haystack.front, needle)) is $(D true). If no
such position exists, returns an empty $(D haystack).
See_Also:
$(WEB sgi.com/tech/stl/find_if.html, STL's find_if)
$(HTTP sgi.com/tech/stl/find_if.html, STL's find_if)
*/
InputRange find(alias pred, InputRange)(InputRange haystack)
if (isInputRange!InputRange)
Expand Down Expand Up @@ -2390,7 +2390,7 @@ the given predicate. If there are no such two elements, returns $(D r) advanced
until empty.
See_Also:
$(WEB sgi.com/tech/stl/adjacent_find.html, STL's adjacent_find)
$(HTTP sgi.com/tech/stl/adjacent_find.html, STL's adjacent_find)
*/
Range findAdjacent(alias pred = "a == b", Range)(Range r)
if (isForwardRange!(Range))
Expand Down Expand Up @@ -2467,7 +2467,7 @@ $(D seq) advanced to the first matching element, or until empty if there are no
matching elements.
See_Also:
$(WEB sgi.com/tech/stl/find_first_of.html, STL's find_first_of)
$(HTTP sgi.com/tech/stl/find_first_of.html, STL's find_first_of)
*/
Range1 findAmong(alias pred = "a == b", Range1, Range2)(
Range1 seq, Range2 choices)
Expand Down
4 changes: 2 additions & 2 deletions std/algorithm/setops.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -28,9 +28,9 @@ $(T2 setUnion,
Copyright: Andrei Alexandrescu 2008-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.com, Andrei Alexandrescu)
Authors: $(HTTP erdani.com, Andrei Alexandrescu)
Source: $(PHOBOSSRC std/algorithm/_setops.d)
Expand Down
18 changes: 9 additions & 9 deletions std/algorithm/sorting.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -56,9 +56,9 @@ $(T2 topNIndex,
Copyright: Andrei Alexandrescu 2008-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.com, Andrei Alexandrescu)
Authors: $(HTTP erdani.com, Andrei Alexandrescu)
Source: $(PHOBOSSRC std/algorithm/_sorting.d)
Expand Down Expand Up @@ -382,8 +382,8 @@ the relative ordering of all elements $(D a), $(D b) in the left part of $(D r)
for which $(D predicate(a) == predicate(b)).
See_Also:
STL's $(WEB sgi.com/tech/stl/_partition.html, _partition)$(BR)
STL's $(WEB sgi.com/tech/stl/stable_partition.html, stable_partition)
STL's $(HTTP sgi.com/tech/stl/_partition.html, _partition)$(BR)
STL's $(HTTP sgi.com/tech/stl/stable_partition.html, stable_partition)
*/
Range partition(alias predicate,
SwapStrategy ss = SwapStrategy.unstable, Range)(Range r)
Expand Down Expand Up @@ -1114,8 +1114,8 @@ Params:
Returns: The initial range wrapped as a $(D SortedRange) with the predicate
$(D binaryFun!less).
Algorithms: $(WEB en.wikipedia.org/wiki/Introsort) is used for unstable sorting and
$(WEB en.wikipedia.org/wiki/Timsort, Timsort) is used for stable sorting.
Algorithms: $(HTTP en.wikipedia.org/wiki/Introsort) is used for unstable sorting and
$(HTTP en.wikipedia.org/wiki/Timsort, Timsort) is used for stable sorting.
Each algorithm has benefits beyond stability. Introsort is generally faster but
Timsort may achieve greater speeds on data with low entropy or if predicate calls
are expensive. Introsort performs no allocations whereas Timsort will perform one
Expand Down Expand Up @@ -2123,7 +2123,7 @@ repeatedly computing it. Conversely, if the cost of `transform` is small
compared to the cost of allocating and filling the precomputed array, `sort`
may be faster and therefore preferable.
This approach to sorting is akin to the $(WEB
This approach to sorting is akin to the $(HTTP
wikipedia.org/wiki/Schwartzian_transform, Schwartzian transform), also known as
the decorate-sort-undecorate pattern in Python and Lisp. The complexity is the
same as that of the corresponding `sort`, but `schwartzSort` evaluates
Expand Down Expand Up @@ -2350,7 +2350,7 @@ Params:
See_Also:
$(LREF topNIndex),
$(WEB sgi.com/tech/stl/nth_element.html, STL's nth_element)
$(HTTP sgi.com/tech/stl/nth_element.html, STL's nth_element)
BUGS:
Expand Down Expand Up @@ -2570,7 +2570,7 @@ Copies the top $(D n) elements of the input range $(D source) into the
random-access range $(D target), where $(D n =
target.length). Elements of $(D source) are not touched. If $(D
sorted) is $(D true), the target is sorted. Otherwise, the target
respects the $(WEB en.wikipedia.org/wiki/Binary_heap, heap property).
respects the $(HTTP en.wikipedia.org/wiki/Binary_heap, heap property).
Params:
less = The predicate to sort by.
Expand Down
4 changes: 2 additions & 2 deletions std/array.d
View file
Original file line number Diff line number Diff line change
Expand Up @@ -67,9 +67,9 @@ $(TR $(TH Function Name) $(TH Description)
Copyright: Copyright Andrei Alexandrescu 2008- and Jonathan M Davis 2011-.
License: $(WEB boost.org/LICENSE_1_0.txt, Boost License 1.0).
License: $(HTTP boost.org/LICENSE_1_0.txt, Boost License 1.0).
Authors: $(WEB erdani.org, Andrei Alexandrescu) and Jonathan M Davis
Authors: $(HTTP erdani.org, Andrei Alexandrescu) and Jonathan M Davis
Source: $(PHOBOSSRC std/_array.d)
*/
Expand Down
Loading