Fix '..'

To complete this:
https://gerrit.libreoffice.org/#/c/78312/

This is a massive replace for
".." instead of "..." between words.

It passed "make check" on Linux.

Change-Id: I144d8061fca9f545c762941551e59dffdd3650e8
Reviewed-on: https://gerrit.libreoffice.org/78357
Reviewed-by: Julien Nabet <serval2412@yahoo.fr>
Tested-by: Jenkins

4 files changed, 4 insertions, 4 deletions

diff --git a/i18npool/source/breakiterator/breakiteratorImpl.cxx b/i18npool/source/breakiterator/breakiteratorImpl.cxx
index 21cdfce9c499..41ef28fe0162 100644
--- a/i18npool/source/breakiterator/breakiteratorImpl.cxx
+++ b/i18npool/source/breakiterator/breakiteratorImpl.cxx
@@ -262,7 +262,7 @@ static sal_Int32 iterateCodePoints(const OUString& Text, sal_Int32 &nStartPos, s
             ch = Text.iterateCodePoints(&nStartPos, inc);
             // Fix for #i80436#.
             // erAck: 2009-06-30T21:52+0200  This logic looks somewhat
-            // suspicious as if it cures a symptom.. anyway, had to add
+            // suspicious as if it cures a symptom... anyway, had to add
             // nStartPos < Text.getLength() to silence the (correct) assertion
             // in rtl_uString_iterateCodePoints() if Text was one character
             // (codepoint) only, made up of a surrogate pair.
diff --git a/i18npool/source/breakiterator/breakiterator_unicode.cxx b/i18npool/source/breakiterator/breakiterator_unicode.cxx
index 398bdd7326c0..fea868eb85e9 100644
--- a/i18npool/source/breakiterator/breakiterator_unicode.cxx
+++ b/i18npool/source/breakiterator/breakiterator_unicode.cxx
@@ -108,7 +108,7 @@ void BreakIterator_Unicode::loadICUBreakIterator(const css::lang::Locale& rLocal
 
     // Using the cache map prevents accessing the file system for each
     // udata_open() where ICU tries first files then data objects. And that for
-    // two fallbacks worst case.. for each new allocated EditEngine, layout
+    // two fallbacks worst case... for each new allocated EditEngine, layout
     // cell, ... *ouch*  Also non-rule locale based iterators can be mapped.
     // This also speeds up loading iterators for alternating or generally more
     // than one language/locale in that iterators are not constructed and
diff --git a/i18npool/source/search/levdis.hxx b/i18npool/source/search/levdis.hxx
index fc7ed021dfa8..c789b7da8fb5 100644
--- a/i18npool/source/search/levdis.hxx
+++ b/i18npool/source/search/levdis.hxx
@@ -63,7 +63,7 @@
 // One caveat, if the WLD reaches nLimit due to nDelR0 (i.e. data string is nZ
 // characters longer than pattern) then no character can be replaced any more.
 // This can be circumvented by increasing nX or/and nZ, but of course with the
-// side effect of being less strict then.. or the other solution is to use
+// side effect of being less strict then... or the other solution is to use
 // relaxed SplitCount (see below), which is the default when using CalcLPQR().
 //
 // Attention: shorter = WLD.Insert, longer = WLD.Delete
diff --git a/i18npool/source/search/textsearch.cxx b/i18npool/source/search/textsearch.cxx
index f6f5fd3c618e..ea369329542e 100644
--- a/i18npool/source/search/textsearch.cxx
+++ b/i18npool/source/search/textsearch.cxx
@@ -867,7 +867,7 @@ void TextSearch::RESrchPrepare( const css::util::SearchOptions2& rOptions)
         // of the processor and the details of the specific pattern, but will
         // typically be on the order of milliseconds."
         // Just what is a good value? 42 is always an answer ... the 23 enigma
-        // as well.. which on the dev's machine is roughly 50 seconds with the
+        // as well... which on the dev's machine is roughly 50 seconds with the
         // pattern of fdo#70627.
         /* TODO: make this a configuration settable value and possibly take
          * complexity of expression into account and maybe even length of text