summaryrefslogtreecommitdiff
path: root/unotools/inc
diff options
context:
space:
mode:
authorEike Rathke <er@openoffice.org>2001-08-06 13:59:04 +0000
committerEike Rathke <er@openoffice.org>2001-08-06 13:59:04 +0000
commit34e6cf1a563e1229e5cf3b53d3a615b3b87f19b9 (patch)
treeef1f2c9f7c9ecbda361d2723c7817c6ed351e27c /unotools/inc
parent57bbb0c583ddd000b32c4a3e90332718a2b8b7c0 (diff)
#90249# moved inline isEqual()/isMatch() to implementation
Diffstat (limited to 'unotools/inc')
-rw-r--r--unotools/inc/unotools/transliterationwrapper.hxx26
1 files changed, 7 insertions, 19 deletions
diff --git a/unotools/inc/unotools/transliterationwrapper.hxx b/unotools/inc/unotools/transliterationwrapper.hxx
index 01468be8f42e..f85b954ca726 100644
--- a/unotools/inc/unotools/transliterationwrapper.hxx
+++ b/unotools/inc/unotools/transliterationwrapper.hxx
@@ -2,9 +2,9 @@
*
* $RCSfile: transliterationwrapper.hxx,v $
*
- * $Revision: 1.6 $
+ * $Revision: 1.7 $
*
- * last change: $Author: er $ $Date: 2001-08-06 10:01:54 $
+ * last change: $Author: er $ $Date: 2001-08-06 14:59:04 $
*
* The Contents of this file are made available subject to the terms of
* either of the following licenses
@@ -127,6 +127,8 @@ public:
translation but also if one string matches the start of the other, i.e.
equals( "a", 0, 1, nMatch1, "aaa", 0, 3, nMatch2 )
returns true and nMatch:=1 and nMatch2:=3
+ equals( "aab", 0, 3, nMatch1, "aaa", 0, 3, nMatch2 )
+ returns true and nMatch:=2 and nMatch2:=3
*/
sal_Bool equals(
const String& rStr1, sal_Int32 nPos1, sal_Int32 nCount1, sal_Int32& nMatch1,
@@ -145,26 +147,12 @@ public:
one string is matching the start of the other. Use this method instead
of compareString()==0 because it is much faster.
*/
- sal_Bool isEqual( const String& rStr1, const String& rStr2 ) const
- {
- sal_Int32 nMatch1, nMatch2;
- sal_Bool bMatch = equals(
- rStr1, 0, rStr1.Len(), nMatch1,
- rStr2, 0, rStr2.Len(), nMatch2 );
- return bMatch && nMatch1 == nMatch2 && nMatch1 == rStr1.Len() &&
- nMatch2 == rStr2.Len();
- }
+ sal_Bool isEqual( const String& rStr1, const String& rStr2 ) const;
/** If string rStr1 matches the start of string rStr2, i.e. "a" in "aaa"
*/
- sal_Bool isMatch( const String& rStr1, const String& rStr2 ) const
- {
- sal_Int32 nMatch1, nMatch2;
- sal_Bool bMatch = equals(
- rStr1, 0, rStr1.Len(), nMatch1,
- rStr2, 0, rStr2.Len(), nMatch2 );
- return bMatch && nMatch1 <= nMatch2 && nMatch1 == rStr1.Len();
- }
+ sal_Bool isMatch( const String& rStr1, const String& rStr2 ) const;
+
};
// ............................................................................