From 1a0dd180eb3ea3af05cdf1f573eb6f69b0f1b152 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Thomas=20K=C3=B6ppe?= <tkoeppe@google.com>
Date: Sun, 5 Feb 2017 14:51:08 +0000
Subject: [PATCH] Format "i^th" consistently.

Fixes #653, see also #974.
---
 source/containers.tex | 2 +-
 source/numerics.tex   | 4 ++--
 source/utilities.tex  | 2 +-
 3 files changed, 4 insertions(+), 4 deletions(-)

diff --git a/source/containers.tex b/source/containers.tex
index 0e3954fb52..ac57a3f52b 100644
--- a/source/containers.tex
+++ b/source/containers.tex
@@ -2787,7 +2787,7 @@
 a.size(). For \tcode{unordered_multiset} and \tcode{unordered_multimap},
 the complexity of \tcode{operator==} is proportional to $\sum E_i^2$
 in the average case and to $N^2$ in the worst case, where $N$ is \tcode{a.size()},
-and $E_i$ is the size of the $i^{th}$ equivalent-key group in \tcode{a}.
+and $E_i$ is the size of the $i^\text{th}$ equivalent-key group in \tcode{a}.
 However, if the respective elements of each corresponding pair of
 equivalent-key groups $Ea_i$ and $Eb_i$ are arranged in the same order
 (as is commonly the case, e.g., if \tcode{a} and \tcode{b} are unmodified copies
diff --git a/source/numerics.tex b/source/numerics.tex
index a0e9850e39..278b84f370 100644
--- a/source/numerics.tex
+++ b/source/numerics.tex
@@ -9338,7 +9338,7 @@
 \begin{note}
 The difference between \tcode{transform_exclusive_scan} and
 \tcode{transform_inclusive_scan} is that \tcode{transform_exclusive_scan}
-excludes the ith input element from the ith sum. If \tcode{binary_op} is not
+excludes the $i^\text{th}$ input element from the $i^\text{th}$ sum. If \tcode{binary_op} is not
 mathematically associative, the behavior of \tcode{transform_exclusive_scan}
 may be nondeterministic. \tcode{transform_exclusive_scan} does not apply
 \tcode{unary_op} to \tcode{init}.
@@ -9419,7 +9419,7 @@
 \begin{note}
 The difference between \tcode{transform_exclusive_scan} and
 \tcode{transform_inclusive_scan} is that \tcode{transform_inclusive_scan}
-includes the ith input element in the ith sum. If \tcode{binary_op} is not
+includes the $i^\text{th}$ input element in the $i^\text{th}$ sum. If \tcode{binary_op} is not
 mathematically associative, the behavior of \tcode{transform_inclusive_scan}
 may be nondeterministic. \tcode{transform_inclusive_scan} does not apply
 \tcode{unary_op} to \tcode{init}.
diff --git a/source/utilities.tex b/source/utilities.tex
index deb2ab3f91..4df5dabba5 100644
--- a/source/utilities.tex
+++ b/source/utilities.tex
@@ -4190,7 +4190,7 @@
 
 \pnum
 In the descriptions that follow, let $i$ be in the range \range{0}{sizeof...(Types)},
-and $\tcode{T}_i$ be the $i^{th}$ type in \tcode{Types...}.
+and $\tcode{T}_i$ be the $i^\text{th}$ type in \tcode{Types...}.
 
 \indexlibrary{\idxcode{variant}!constructor}%
 \begin{itemdecl}