Skip to content

Commit 3ab81d0

Browse files
committed
Use \range where appropriate.
1 parent dad1870 commit 3ab81d0

File tree

2 files changed

+7
-7
lines changed

2 files changed

+7
-7
lines changed

source/algorithms.tex

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -7565,7 +7565,7 @@
75657565
are partitioned with respect to the expressions
75667566
\tcode{bool(invoke(comp, invoke(proj, e), value))} and
75677567
\tcode{!bool(invoke(comp, value, invoke(proj, e)))}.
7568-
Also, for all elements \tcode{e} of \tcode{[first, last)},
7568+
Also, for all elements \tcode{e} of \range{first}{last},
75697569
\tcode{bool(comp(e, value))} implies \tcode{!bool(comp(\brk{}value, e))}
75707570
for the overloads in namespace \tcode{std}.
75717571

@@ -7632,7 +7632,7 @@
76327632
are partitioned with respect to the expressions
76337633
\tcode{bool(invoke(comp, invoke(proj, e), value))} and
76347634
\tcode{!bool(invoke(comp, value, invoke(proj, e)))}.
7635-
Also, for all elements \tcode{e} of \tcode{[first, last)},
7635+
Also, for all elements \tcode{e} of \range{first}{last},
76367636
\tcode{bool(comp(e, value))} implies \tcode{!bool(comp(\brk{}value, e))}
76377637
for the overloads in namespace \tcode{std}.
76387638

@@ -10818,7 +10818,7 @@
1081810818
\pnum
1081910819
For the overloads with an \tcode{ExecutionPolicy} and a non-empty range,
1082010820
performs \tcode{*result = *first}.
10821-
Then, for every \tcode{d} in \tcode{[1, last - first - 1]},
10821+
Then, for every \tcode{d} in \crange{1}{last - first - 1},
1082210822
performs \tcode{*(result + d) = binary_op(*(first + d), *(first + (d - 1)))}.
1082310823

1082410824
\pnum

source/strings.tex

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -152,19 +152,19 @@
152152
the smallest \tcode{q} in \tcode{[p,p+n)} such that
153153
\tcode{X::eq(*q,c)} is \tcode{true}, \tcode{nullptr} otherwise. & linear \\ \rowsep
154154
\tcode{X::move(s,p,n)} & \tcode{X::char_type*} &
155-
for each \tcode{i} in \tcode{[0,n)}, performs \tcode{X::assign(s[i],p[i])}.
156-
Copies correctly even where the ranges \tcode{[p,p+n)} and \tcode{[s,s+n)} overlap.\br \returns \tcode{s}. & linear \\ \rowsep
155+
for each \tcode{i} in \range{0}{n}, performs \tcode{X::assign(s[i],p[i])}.
156+
Copies correctly even where the ranges \range{p}{p+n} and \range{s}{s+n} overlap.\br \returns \tcode{s}. & linear \\ \rowsep
157157
\tcode{X::copy(s,p,n)} & \tcode{X::char_type*} &
158158
\expects
159159
The ranges \range{p}{p+n} and \range{s}{s+n} do not overlap.\par
160160
\returns
161161
\tcode{s}.\br
162162
for each \tcode{i} in
163-
\tcode{[0,n)}, performs \tcode{X::assign(s[i],p[i])}. & linear \\ \rowsep
163+
\range{0}{n}, performs \tcode{X::assign(s[i],p[i])}. & linear \\ \rowsep
164164
\tcode{X::assign(r,d)} & (not used) &
165165
assigns \tcode{r=d}. & constant \\ \rowsep
166166
\tcode{X::assign\-(s,n,c)} & \tcode{X::char_type*} &
167-
for each \tcode{i} in \tcode{[0,n)}, performs
167+
for each \tcode{i} in \range{0}{n}, performs
168168
\tcode{X::assign(s[i],c)}.\br
169169
\returns
170170
\tcode{s}. & linear \\ \rowsep

0 commit comments

Comments
 (0)