Adding upstream version 4:7.4.7.upstream/4%7.4.7upstream

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>

1 files changed, 146 insertions, 0 deletions

diff --git a/connectivity/source/drivers/file/quotedstring.cxx b/connectivity/source/drivers/file/quotedstring.cxx
new file mode 100644
index 000000000..f654c709e
--- /dev/null
+++ b/connectivity/source/drivers/file/quotedstring.cxx
@@ -0,0 +1,146 @@
+/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
+/*
+ * This file is part of the LibreOffice project.
+ *
+ * This Source Code Form is subject to the terms of the Mozilla Public
+ * License, v. 2.0. If a copy of the MPL was not distributed with this
+ * file, You can obtain one at http://mozilla.org/MPL/2.0/.
+ *
+ * This file incorporates work covered by the following license notice:
+ *
+ *   Licensed to the Apache Software Foundation (ASF) under one or more
+ *   contributor license agreements. See the NOTICE file distributed
+ *   with this work for additional information regarding copyright
+ *   ownership. The ASF licenses this file to you under the Apache
+ *   License, Version 2.0 (the "License"); you may not use this file
+ *   except in compliance with the License. You may obtain a copy of
+ *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
+ */
+
+#include <file/quotedstring.hxx>
+#include <rtl/ustrbuf.hxx>
+
+namespace connectivity
+{
+
+    sal_Int32 QuotedTokenizedString::GetTokenCount( sal_Unicode cTok, sal_Unicode cStrDel ) const
+    {
+        const sal_Int32 nLen = m_sString.getLength();
+        if ( !nLen )
+            return 0;
+
+        sal_Int32 nTokCount = 1;
+        bool bStart = true;     // Are we on the first character in the Token?
+        bool bInString = false; // Are we WITHIN a (cStrDel delimited) String?
+
+        // Search for String-end after the first not matching character
+        for( sal_Int32 i = 0; i < nLen; ++i )
+        {
+            const sal_Unicode cChar = m_sString[i];
+            if (bStart)
+            {
+                bStart = false;
+                // First character a String-Delimiter?
+                if ( cChar == cStrDel )
+                {
+                    bInString = true;   // then we are now WITHIN the string!
+                    continue;           // skip this character!
+                }
+            }
+
+            if (bInString)
+            {
+                // when now the String-Delimiter-character occurs...
+                if ( cChar == cStrDel )
+                {
+                    if ((i+1 < nLen) && (m_sString[i+1] == cStrDel))
+                    {
+                        // double String-Delimiter-character:
+                        ++i;    // no string-end, skip next character.
+                    }
+                    else
+                    {
+                        // String-End
+                        bInString = false;
+                    }
+                }
+            } // if (bInString)
+            else
+            {
+                // does the Token-character match, then raise TokCount
+                if ( cChar == cTok )
+                {
+                    ++nTokCount;
+                    bStart = true;
+                }
+            }
+        }
+
+        return nTokCount;
+    }
+
+
+    OUString QuotedTokenizedString::GetTokenSpecial(sal_Int32& nStartPos, sal_Unicode cTok, sal_Unicode cStrDel) const
+    {
+        const sal_Int32 nLen = m_sString.getLength();
+        if ( nLen )
+        {
+            bool bInString = (nStartPos < nLen) && (m_sString[nStartPos] == cStrDel);   // are we WITHIN a (cStrDel delimited) String?
+
+            // First character a String-Delimiter?
+            if (bInString )
+                ++nStartPos;            // skip this character!
+            if ( nStartPos >= nLen )
+                return OUString();
+
+            OUStringBuffer sBuff( nLen - nStartPos + 1 );
+
+            // Search until end of string for the first not matching character
+            for( sal_Int32 i = nStartPos; i < nLen; ++i )
+            {
+                const sal_Unicode cChar = m_sString[i];
+                if (bInString)
+                {
+                    // when now the String-Delimiter-character occurs ...
+                    if ( cChar == cStrDel )
+                    {
+                        if ((i+1 < nLen) && (m_sString[i+1] == cStrDel))
+                        {
+                            // double String Delimiter-character
+                            // no end of string, skip next character.
+                            ++i;
+                            sBuff.append(m_sString[i]);    // character belongs to Result-String
+                        }
+                        else
+                        {
+                            //end of String
+                            bInString = false;
+                        }
+                    }
+                    else
+                    {
+                        sBuff.append(cChar);
+                    }
+                }
+                else
+                {
+                    // does the Token-sign match, then raise nTok
+                    if ( cChar == cTok )
+                    {
+                        // premature break of loop possible, because we found what we were looking for
+                        nStartPos = i+1;
+                        break;
+                    }
+                    else
+                    {
+                        sBuff.append(cChar);
+                    }
+                }
+            } // for( sal_Int32 i = nStartPos; i < nLen; ++i )
+            return sBuff.makeStringAndClear();
+        }
+        return OUString();
+    }
+}
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */