From 460c52653ab0dcca6f19a4f492ed2c5e4e963ab0 Mon Sep 17 00:00:00 2001
From: toma <toma@283d02a7-25f6-0310-bc7c-ecb5cbfe19da>
Date: Wed, 25 Nov 2009 17:56:58 +0000
Subject: Copy the KDE 3.5 branch to branches/trinity for new KDE 3.5 features.
 BUG:215923

git-svn-id: svn://anonsvn.kde.org/home/kde/branches/trinity/kdepim@1054174 283d02a7-25f6-0310-bc7c-ecb5cbfe19da
---
 mimelib/boyermor.cpp | 131 +++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 131 insertions(+)
 create mode 100644 mimelib/boyermor.cpp

(limited to 'mimelib/boyermor.cpp')

diff --git a/mimelib/boyermor.cpp b/mimelib/boyermor.cpp
new file mode 100644
index 000000000..5ee007ae8
--- /dev/null
+++ b/mimelib/boyermor.cpp
@@ -0,0 +1,131 @@
+//=============================================================================
+// File:       boyermor.cpp
+// Contents:   Definitions for DwBoyerMoore
+// Maintainer: Doug Sauder <dwsauder@fwb.gulf.net>
+// WWW:        http://www.fwb.gulf.net/~dwsauder/mimepp.html
+//
+// Copyright (c) 1996, 1997 Douglas W. Sauder
+// All rights reserved.
+//
+// IN NO EVENT SHALL DOUGLAS W. SAUDER BE LIABLE TO ANY PARTY FOR DIRECT,
+// INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT OF
+// THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF DOUGLAS W. SAUDER
+// HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+//
+// DOUGLAS W. SAUDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT
+// NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
+// PARTICULAR PURPOSE.  THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS IS"
+// BASIS, AND DOUGLAS W. SAUDER HAS NO OBLIGATION TO PROVIDE MAINTENANCE,
+// SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
+//
+//=============================================================================
+
+#define DW_IMPLEMENTATION
+
+#include <mimelib/config.h>
+#include <mimelib/debug.h>
+#include <ctype.h>
+#include <string.h>
+#include <mimelib/boyermor.h>
+
+
+DwBoyerMoore::DwBoyerMoore(const char* aCstr)
+  : mPat( 0 ), mCiPat( 0 )
+{
+    size_t len = strlen(aCstr);
+    _Assign(aCstr, len);
+}
+
+
+DwBoyerMoore::DwBoyerMoore(const DwString& aStr)
+  : mPat( 0 ), mCiPat( 0 )
+{
+    _Assign(aStr.data(), aStr.length());
+}
+
+DwBoyerMoore::DwBoyerMoore(const DwBoyerMoore & other)
+  : mPat( 0 ), mCiPat( 0 )
+{
+    _Assign(other.mPat, other.mPatLen);
+}
+
+
+DwBoyerMoore::~DwBoyerMoore()
+{
+    delete[] mPat; mPat = 0;
+    delete[] mCiPat; mCiPat = 0;
+}
+
+const DwBoyerMoore & DwBoyerMoore::operator=( const DwBoyerMoore & other )
+{
+    if (this != &other)
+        _Assign(other.mPat, other.mPatLen);
+    return *this;
+}
+
+
+void DwBoyerMoore::Assign(const char* aCstr)
+{
+    size_t len = strlen(aCstr);
+    _Assign(aCstr, len);
+}
+
+
+void DwBoyerMoore::Assign(const DwString& aStr)
+{
+    _Assign(aStr.data(), aStr.length());
+}
+
+
+void DwBoyerMoore::_Assign(const char* aPat, size_t aPatLen)
+{
+    mPatLen = 0;
+    delete[] mPat; mPat = 0;
+    delete[] mCiPat; mCiPat = 0;
+    mPat = new char[aPatLen+1];
+    mCiPat = new char[aPatLen+1];
+    if (mPat != 0 && aPatLen) {
+        mPatLen = aPatLen;
+        strncpy(mPat, aPat, mPatLen);
+        mCiPat[mPatLen] = mPat[mPatLen] = 0;
+        // Initialize the jump table for Boyer-Moore-Horspool algorithm
+        size_t i;
+        for (i=0; i < 256; ++i)
+            mSkipAmt[i] = mCiSkipAmt[i] = (unsigned char) mPatLen;
+        for (i=0; i < mPatLen-1; ++i) {
+	    unsigned char skip = mPatLen - i - 1;
+	    mCiPat[i] = tolower(mPat[i]);
+	    mCiSkipAmt[(unsigned char)mCiPat[i]] = skip;
+	    mCiSkipAmt[(unsigned char)toupper(mCiPat[i])] = skip;
+	    mSkipAmt[(unsigned char)mPat[i]] = skip;
+	}
+	mCiPat[i] = tolower(mPat[i]);
+    }
+}
+
+
+size_t DwBoyerMoore::FindIn(const DwString& aStr, size_t aPos, bool aCs) const
+{
+    char *pat = aCs ? mPat : mCiPat;
+    const unsigned char *skipAmt = aCs ? mSkipAmt : mCiSkipAmt;
+    if (aStr.length() <= aPos) {
+        return (size_t) -1;
+    }
+    if (pat == 0 || mPatLen == 0) {
+        return 0;
+    }
+    size_t bufLen = aStr.length() - aPos;
+    const char* buf = aStr.data() + aPos;
+    size_t i;
+    for (i=mPatLen-1; i < bufLen; i += skipAmt[(unsigned char)buf[i]]) {
+        int iBuf = i;
+        int iPat = mPatLen - 1;
+        while (iPat >= 0 && (aCs ? buf[iBuf] : tolower(buf[iBuf])) == pat[iPat]) {
+            --iBuf;
+            --iPat;
+        }
+        if (iPat == -1)
+            return aPos + iBuf + 1;
+    }
+    return (size_t)-1;
+}
-- 
cgit v1.2.1