summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDennis Francis <dennis.francis@collabora.com>2019-03-26 18:10:35 +0530
committerDennis Francis <dennis.francis@collabora.com>2019-03-26 19:53:01 +0100
commit0347931fd5d9acbdbbdff88a7b8cc5eaf4fed759 (patch)
tree008104bec9de770de7443afc3702ee4b8178d54e
parent41dc917b9b55b8c0c4307ffc58a1fb7257df2b69 (diff)
scale down the load in ScParallelismTest::testVLOOKUPSUM...
since this method alone takes around 8 minutes in a dbgutil build. Change-Id: I573545446bd42b7a614d8f5b2d6061c3ec157271 Reviewed-on: https://gerrit.libreoffice.org/69742 Tested-by: Jenkins Reviewed-by: Dennis Francis <dennis.francis@collabora.com>
-rw-r--r--sc/qa/unit/parallelism.cxx2
1 files changed, 1 insertions, 1 deletions
diff --git a/sc/qa/unit/parallelism.cxx b/sc/qa/unit/parallelism.cxx
index 058cbfad9728..2f3e4d35771d 100644
--- a/sc/qa/unit/parallelism.cxx
+++ b/sc/qa/unit/parallelism.cxx
@@ -299,7 +299,7 @@ void ScParallelismTest::testVLOOKUPSUM()
{
m_pDoc->InsertTab(0, "1");
- const size_t nNumRows = 4096*4;
+ const size_t nNumRows = 2048;
OUString aTableRef = "$A$1:$B$" + OUString::number(nNumRows);
for (size_t i = 0; i < nNumRows; ++i)
{