summaryrefslogtreecommitdiffstats
path: root/googletest/README.md
diff options
context:
space:
mode:
authorAbseil Team <absl-team@google.com>2018-08-27 18:53:25 (GMT)
committerGennadiy Civil <misterg@google.com>2018-08-28 20:53:30 (GMT)
commit167c5e8188beb5dae002ac7571457e3c26eb6a3f (patch)
tree3ac7d65d7a5d9eb4be3883cd3032d29cd93e1e21 /googletest/README.md
parent1bb76182caee8239b71b9d6d21f479014d37ad5b (diff)
downloadgoogletest-167c5e8188beb5dae002ac7571457e3c26eb6a3f.zip
googletest-167c5e8188beb5dae002ac7571457e3c26eb6a3f.tar.gz
googletest-167c5e8188beb5dae002ac7571457e3c26eb6a3f.tar.bz2
Googletest export
Fix Theta(N^2) memory usage of EXPECT_EQ(string) when the strings don't match. The underlying CalculateOptimalEdits() implementation used a simple dynamic-programming approach that always used N^2 memory and time. This meant that tests for equality of large strings were ticking time bombs: They'd work fine as long as the test passed, but as soon as the strings differed the test would OOM, which is very hard to debug. I switched it out for a Dijkstra search, which is still worst-case O(N^2), but in the usual case of mostly-matching strings, it is much closer to linear. PiperOrigin-RevId: 210405025
Diffstat (limited to 'googletest/README.md')
0 files changed, 0 insertions, 0 deletions