tdf#122926 FILEOPEN ODT Slower compared to the past
on my machine, this takes the time from 12.3s to 8.9s
Change-Id: Ibdc7e3c34d1acb0d1f7f784720552fa6c7977fa5
Reviewed-on: https://gerrit.libreoffice.org/70074
Reviewed-by: Noel Grandin <noel.grandin@collabora.co.uk>
Tested-by: Noel Grandin <noel.grandin@collabora.co.uk>
diff --git a/sw/source/core/txtnode/ndtxt.cxx b/sw/source/core/txtnode/ndtxt.cxx
index d384ce1..377618f 100644
--- a/sw/source/core/txtnode/ndtxt.cxx
+++ b/sw/source/core/txtnode/ndtxt.cxx
@@ -1394,7 +1394,7 @@
bool bAtLeastOneBookmarkMoved = false;
bool bAtLeastOneExpandedBookmarkAtInsertionPosition = false;
// A text node already knows its marks via its SwIndexes.
std::set<const sw::mark::IMark*> aSeenMarks;
std::unordered_set<const sw::mark::IMark*> aSeenMarks;
const SwIndex* next;
for (const SwIndex* pIndex = GetFirstIndex(); pIndex; pIndex = next )
{
@@ -1403,9 +1403,8 @@
if (!pMark)
continue;
// Only handle bookmarks once, if they start and end at this node as well.
if (aSeenMarks.find(pMark) != aSeenMarks.end())
if (!aSeenMarks.insert(pMark).second)
continue;
aSeenMarks.insert(pMark);
const SwPosition* pEnd = &pMark->GetMarkEnd();
SwIndex & rEndIdx = const_cast<SwIndex&>(pEnd->nContent);
if( this == &pEnd->nNode.GetNode() &&
