diff options
| author | T.J. Alumbaugh <talumbau@google.com> | 2021-04-26 10:58:50 -0700 |
|---|---|---|
| committer | Copybara-Service <copybara-worker@google.com> | 2021-04-26 10:59:09 -0700 |
| commit | 5a6516e51990540429b07a1298c5201b548bbed0 (patch) | |
| tree | 92674337264e1619c23c9893a1da6a67908bf860 | |
| parent | 516761f8278df5dd4a3a0a4d382a31b26767e7a3 (diff) | |
| download | ruy-5a6516e51990540429b07a1298c5201b548bbed0.tar.gz | |
Remove non-ASCII character in comment
PiperOrigin-RevId: 370495857
| -rw-r--r-- | ruy/block_map.cc | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/ruy/block_map.cc b/ruy/block_map.cc index 8240de2..6c01e52 100644 --- a/ruy/block_map.cc +++ b/ruy/block_map.cc @@ -330,7 +330,7 @@ bool IsObviouslyLinearTraversal(int rows, int cols, int depth, // as that requires knowing the kernel block layout. Since we just want // a coarse estimate with only the guarantee that if we return `true` then // linear traversal will be used, it is OK here to over-estimate `rows` and - // `cols`, by omitting to divide them by the rectangularness factors.ß + // `cols`, by omitting to divide them by the rectangularness factors. return GetTraversalOrder(rows, cols, depth, lhs_scalar_size, rhs_scalar_size, cpu_cache_params) == BlockMapTraversalOrder::kLinear; } |