1 files changed, 0 insertions, 19 deletions
diff --git a/i18npool/source/breakiterator/xdictionary.cxx b/i18npool/source/breakiterator/xdictionary.cxx
index 95e1cc957f86..1067e33bcecc 100644
--- a/i18npool/source/breakiterator/xdictionary.cxx
+++ b/i18npool/source/breakiterator/xdictionary.cxx
@@ -271,21 +271,6 @@ bool xdictionary::seekSegment(const OUString &rText, sal_Int32 pos,
     Boundary& segBoundary)
 {
     sal_Int32 indexUtf16;
-
-    if (segmentCachedString.pData != rText.pData) {
-        // Cache the passed text so we can avoid regenerating the segment if it's the same
-        // (pData is refcounted and assigning the OUString references it, which ensures that
-        // the object is the same if we get the same pointer back later)
-        segmentCachedString = rText;
-    } else {
-        // If pos is within the cached boundary, use that boundary
-        if (pos >= segmentCachedBoundary.startPos && pos <= segmentCachedBoundary.endPos) {
-            indexUtf16 = segmentCachedBoundary.startPos;
-            rText.iterateCodePoints(&indexUtf16, 1);
-            return segmentCachedBoundary.endPos > indexUtf16;
-        }
-    }
-
     segBoundary.endPos = segBoundary.startPos = pos;
 
     indexUtf16 = pos;
@@ -308,10 +293,6 @@ bool xdictionary::seekSegment(const OUString &rText, sal_Int32 pos,
             break;
     }
 
-    // Cache the calculated boundary
-    segmentCachedBoundary.startPos = segBoundary.startPos;
-    segmentCachedBoundary.endPos = segBoundary.endPos;
-
     indexUtf16 = segBoundary.startPos;
     rText.iterateCodePoints(&indexUtf16, 1);
     return segBoundary.endPos > indexUtf16;