diff options
author | Stephan Bergmann <sbergman@redhat.com> | 2016-04-20 17:17:31 +0200 |
---|---|---|
committer | Stephan Bergmann <sbergman@redhat.com> | 2016-04-20 17:25:43 +0200 |
commit | b347e5da870d8a4fa8e6e093165fea7dc21dae79 (patch) | |
tree | 5f22eb3d0987dd3d33652c60ea25273fc714fc3f /i18npool/source/transliteration | |
parent | 07b4791dc8d0a8b1144f6c619b7aa6f7af8bb5de (diff) |
loplugin:salbool: Automatic rewrite of sal_False/True
Change-Id: I3f7f71f05db09219f0de3ec14bdb56bd16fb0c8d
Diffstat (limited to 'i18npool/source/transliteration')
-rw-r--r-- | i18npool/source/transliteration/textToPronounce_zh.cxx | 2 | ||||
-rw-r--r-- | i18npool/source/transliteration/transliterationImpl.cxx | 6 |
2 files changed, 4 insertions, 4 deletions
diff --git a/i18npool/source/transliteration/textToPronounce_zh.cxx b/i18npool/source/transliteration/textToPronounce_zh.cxx index 526b1fa30d73..d9f80f4a17f1 100644 --- a/i18npool/source/transliteration/textToPronounce_zh.cxx +++ b/i18npool/source/transliteration/textToPronounce_zh.cxx @@ -109,7 +109,7 @@ TextToPronounce_zh::equals( const OUString & str1, sal_Int32 pos1, sal_Int32 nCo const sal_Unicode *pron2 = getPronounce(*s2++); if (pron1 != pron2) { nMatch1 = nMatch2 = i; - return sal_False; + return false; } } nMatch1 = nMatch2 = realCount; diff --git a/i18npool/source/transliteration/transliterationImpl.cxx b/i18npool/source/transliteration/transliterationImpl.cxx index 1ce966004f6e..f9b58aed7637 100644 --- a/i18npool/source/transliteration/transliterationImpl.cxx +++ b/i18npool/source/transliteration/transliterationImpl.cxx @@ -479,7 +479,7 @@ TransliterationImpl::equals( // return number of matched code points so far nMatch1 = (i < offset1.getLength()) ? offset1[i] : i; nMatch2 = (i < offset2.getLength()) ? offset2[i] : i; - return sal_False; + return false; } } // i==nLen @@ -487,11 +487,11 @@ TransliterationImpl::equals( // return number of matched code points so far nMatch1 = (i <= offset1.getLength()) ? offset1[i-1] + 1 : i; nMatch2 = (i <= offset2.getLength()) ? offset2[i-1] + 1 : i; - return sal_False; + return false; } else { nMatch1 = nCount1; nMatch2 = nCount2; - return sal_True; + return true; } } |