summaryrefslogtreecommitdiffstats
path: root/mlir/lib/Quantizer/Support/UniformSolvers.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'mlir/lib/Quantizer/Support/UniformSolvers.cpp')
-rw-r--r--mlir/lib/Quantizer/Support/UniformSolvers.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/mlir/lib/Quantizer/Support/UniformSolvers.cpp b/mlir/lib/Quantizer/Support/UniformSolvers.cpp
index b4c14ca80ef..db5eaa0a05c 100644
--- a/mlir/lib/Quantizer/Support/UniformSolvers.cpp
+++ b/mlir/lib/Quantizer/Support/UniformSolvers.cpp
@@ -82,7 +82,7 @@ bool UniformParamsFromMinMaxSolver::compute() {
auto fMid =
fns::overshoot(origMinAdj, origMaxAdj, numLevelsDouble, deltaMid);
if (fMid == 0 || (fMid > 0 && std::fabs(deltaMid - prevDeltaMid) < 1e-15)) {
- // Solution found (or step size is infinitessimal and an overshoot).
+ // Solution found (or step size is infinitesimal and an overshoot).
// Empirically, this seems to terminate around 30-50 steps or so.
// This will find a zero point for exactly representable ranges and
// will terminate on a small step size for inexact, biasing towards
OpenPOWER on IntegriCloud