From 940b4d1848e8c70ab7642901a68594e8016caffc Mon Sep 17 00:00:00 2001
From: Daniel Baumann <daniel.baumann@progress-linux.org>
Date: Sat, 27 Apr 2024 18:51:28 +0200
Subject: Adding upstream version 1:7.0.4.

Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
---
 connectivity/source/commontools/TSortIndex.cxx | 152 +++++++++++++++++++++++++
 1 file changed, 152 insertions(+)
 create mode 100644 connectivity/source/commontools/TSortIndex.cxx

(limited to 'connectivity/source/commontools/TSortIndex.cxx')

diff --git a/connectivity/source/commontools/TSortIndex.cxx b/connectivity/source/commontools/TSortIndex.cxx
new file mode 100644
index 000000000..6b94216a3
--- /dev/null
+++ b/connectivity/source/commontools/TSortIndex.cxx
@@ -0,0 +1,152 @@
+/* -*- 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 <TSortIndex.hxx>
+#include <algorithm>
+#include <iterator>
+#include <o3tl/functional.hxx>
+
+using namespace connectivity;
+
+namespace {
+
+/// Functor object for class OSortIndex::TIntValuePairVector::value_type returntype is bool
+struct TKeyValueFunc
+{
+    OSortIndex* pIndex;
+
+    explicit TKeyValueFunc(OSortIndex* _pIndex) : pIndex(_pIndex)
+    {
+    }
+    // return false if compared values are equal otherwise true
+    bool operator()(const OSortIndex::TIntValuePairVector::value_type& lhs,const OSortIndex::TIntValuePairVector::value_type& rhs)   const
+    {
+        const std::vector<OKeyType>& aKeyType = pIndex->getKeyType();
+        size_t i = 0;
+        for (auto const& elem : aKeyType)
+        {
+            const bool bGreater = pIndex->getAscending(i) != TAscendingOrder::ASC;
+            const bool bLess = !bGreater;
+
+            // compare depending for type
+            switch (elem)
+            {
+                case OKeyType::String:
+                {
+                    sal_Int32 nRes = lhs.second->getKeyString(i).compareTo(rhs.second->getKeyString(i));
+                    if (nRes < 0)
+                        return bLess;
+                    else if (nRes > 0)
+                        return bGreater;
+                }
+                break;
+                case OKeyType::Double:
+                {
+                    double d1 = lhs.second->getKeyDouble(i);
+                    double d2 = rhs.second->getKeyDouble(i);
+
+                    if (d1 < d2)
+                        return bLess;
+                    else if (d1 > d2)
+                        return bGreater;
+                }
+                break;
+                case OKeyType::NONE:
+                    break;
+            }
+            ++i;
+        }
+
+        // know we know that the values are equal
+        return false;
+    }
+};
+
+}
+
+::rtl::Reference<OKeySet> OSortIndex::CreateKeySet()
+{
+    Freeze();
+
+    ::rtl::Reference<OKeySet> pKeySet = new OKeySet();
+    pKeySet->reserve(m_aKeyValues.size());
+    std::transform(m_aKeyValues.begin()
+                    ,m_aKeyValues.end()
+                    ,std::back_inserter(*pKeySet)
+                    ,::o3tl::select1st<TIntValuePairVector::value_type>());
+    pKeySet->setFrozen();
+    return pKeySet;
+}
+
+OSortIndex::OSortIndex( const std::vector<OKeyType>& _aKeyType,
+                        const std::vector<TAscendingOrder>& _aAscending)
+    :m_aKeyType(_aKeyType)
+    ,m_aAscending(_aAscending)
+    ,m_bFrozen(false)
+{
+}
+
+OSortIndex::~OSortIndex()
+{
+}
+
+void OSortIndex::AddKeyValue(std::unique_ptr<OKeyValue> pKeyValue)
+{
+    assert(pKeyValue && "Can not be null here!");
+    if(m_bFrozen)
+    {
+        m_aKeyValues.push_back({pKeyValue->getValue(),nullptr});
+    }
+    else
+        m_aKeyValues.push_back({pKeyValue->getValue(),std::move(pKeyValue)});
+}
+
+void OSortIndex::Freeze()
+{
+    OSL_ENSURE(! m_bFrozen,"OSortIndex::Freeze: already frozen!");
+    // sorting:
+    if (m_aKeyType[0] != OKeyType::NONE)
+        // we will sort ourself when the first keyType say so
+        std::sort(m_aKeyValues.begin(),m_aKeyValues.end(),TKeyValueFunc(this));
+
+    for (auto & keyValue : m_aKeyValues)
+    {
+        keyValue.second.reset();
+    }
+
+    m_bFrozen = true;
+}
+
+
+OKeyValue::OKeyValue(sal_Int32 nVal)
+: m_nValue(nVal)
+{
+}
+
+OKeyValue::~OKeyValue()
+{
+}
+
+std::unique_ptr<OKeyValue> OKeyValue::createKeyValue(sal_Int32 _nVal)
+{
+    return std::unique_ptr<OKeyValue>(new OKeyValue(_nVal));
+}
+
+
+/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
-- 
cgit v1.2.3