connectivity/source/commontools/TSortIndex.cxx

   1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
   2 /*
   3  * This file is part of the LibreOffice project.
   4  *
   5  * This Source Code Form is subject to the terms of the Mozilla Public
   6  * License, v. 2.0. If a copy of the MPL was not distributed with this
   7  * file, You can obtain one at http://mozilla.org/MPL/2.0/.
   8  *
   9  * This file incorporates work covered by the following license notice:
  10  *
  11  *   Licensed to the Apache Software Foundation (ASF) under one or more
  12  *   contributor license agreements. See the NOTICE file distributed
  13  *   with this work for additional information regarding copyright
  14  *   ownership. The ASF licenses this file to you under the Apache
  15  *   License, Version 2.0 (the "License"); you may not use this file
  16  *   except in compliance with the License. You may obtain a copy of
  17  *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
  18  */
  19
  20 #include "TSortIndex.hxx"
  21 #include <algorithm>
  22 #include <iterator>
  23
  24 #include <o3tl/compat_functional.hxx>
  25
  26 using namespace connectivity;
  27
  28 /// binary_function Functor object for class OSortIndex::TIntValuePairVector::value_type returntype is bool
  29 struct TKeyValueFunc : ::std::binary_function<OSortIndex::TIntValuePairVector::value_type,OSortIndex::TIntValuePairVector::value_type,bool>
  30 {
  31     OSortIndex* pIndex;
  32
  33     TKeyValueFunc(OSortIndex* _pIndex) : pIndex(_pIndex)
  34     {
  35     }
  36     // return false if compared values are equal otherwise true
  37     inline bool operator()(const OSortIndex::TIntValuePairVector::value_type& lhs,const OSortIndex::TIntValuePairVector::value_type& rhs)   const
  38     {
  39         const ::std::vector<OKeyType>& aKeyType = pIndex->getKeyType();
  40         ::std::vector<OKeyType>::const_iterator aIter = aKeyType.begin();
  41         for (::std::vector<sal_Int16>::size_type i=0;aIter != aKeyType.end(); ++aIter,++i)
  42         {
  43             const bool nGreater = (pIndex->getAscending(i) == SQL_ASC) ? false : true;
  44             const bool nLess = !nGreater;
  45
  46             // compare depending for type
  47             switch (*aIter)
  48             {
  49                 case SQL_ORDERBYKEY_STRING:
  50                 {
  51                     sal_Int32 nRes = lhs.second->getKeyString(i).compareTo(rhs.second->getKeyString(i));
  52                     if (nRes < 0)
  53                         return nLess;
  54                     else if (nRes > 0)
  55                         return nGreater;
  56                 }
  57                 break;
  58                 case SQL_ORDERBYKEY_DOUBLE:
  59                 {
  60                     double d1 = lhs.second->getKeyDouble(i);
  61                     double d2 = rhs.second->getKeyDouble(i);
  62
  63                     if (d1 < d2)
  64                         return nLess;
  65                     else if (d1 > d2)
  66                         return nGreater;
  67                 }
  68                 break;
  69                 case SQL_ORDERBYKEY_NONE:
  70                     break;
  71             }
  72         }
  73
  74         // know we know that the values are equal
  75         return false;
  76     }
  77 };
  78
  79
  80 ::rtl::Reference<OKeySet> OSortIndex::CreateKeySet()
  81 {
  82     Freeze();
  83
  84     ::rtl::Reference<OKeySet> pKeySet = new OKeySet();
  85     pKeySet->get().reserve(m_aKeyValues.size());
  86     ::std::transform(m_aKeyValues.begin()
  87                     ,m_aKeyValues.end()
  88                     ,::std::back_inserter(pKeySet->get())
  89                     ,::o3tl::select1st<TIntValuePairVector::value_type>());
  90     pKeySet->setFrozen();
  91     return pKeySet;
  92 }
  93
  94 OSortIndex::OSortIndex( const ::std::vector<OKeyType>& _aKeyType,
  95                         const ::std::vector<TAscendingOrder>& _aAscending)
  96     :m_aKeyType(_aKeyType)
  97     ,m_aAscending(_aAscending)
  98     ,m_bFrozen(false)
  99 {
 100 }
 101
 102 OSortIndex::~OSortIndex()
 103 {
 104 }
 105
 106 void OSortIndex::AddKeyValue(OKeyValue * pKeyValue)
 107 {
 108     OSL_ENSURE(pKeyValue,"Can not be null here!");
 109     if(m_bFrozen)
 110     {
 111         m_aKeyValues.push_back(TIntValuePairVector::value_type(pKeyValue->getValue(),(OKeyValue *)NULL));
 112         delete pKeyValue;
 113     }
 114     else
 115         m_aKeyValues.push_back(TIntValuePairVector::value_type(pKeyValue->getValue(),pKeyValue));
 116 }
 117
 118
 119
 120 void OSortIndex::Freeze()
 121 {
 122     OSL_ENSURE(! m_bFrozen,"OSortIndex::Freeze: already frozen!");
 123     // Sortierung:
 124     if (m_aKeyType[0] != SQL_ORDERBYKEY_NONE)
 125         // we will sort ourself when the first keyType say so
 126         ::std::sort(m_aKeyValues.begin(),m_aKeyValues.end(),TKeyValueFunc(this));
 127
 128     TIntValuePairVector::iterator aIter = m_aKeyValues.begin();
 129     for(;aIter != m_aKeyValues.end();++aIter)
 130     {
 131         delete aIter->second;
 132         aIter->second = NULL;
 133     }
 134
 135     m_bFrozen = true;
 136 }
 137
 138
 139 OKeyValue::OKeyValue(sal_Int32 nVal)
 140 : m_nValue(nVal)
 141 {
 142 }
 143
 144 OKeyValue::~OKeyValue()
 145 {
 146 }
 147
 148 OKeyValue* OKeyValue::createKeyValue(sal_Int32 _nVal)
 149 {
 150     return new OKeyValue(_nVal);
 151 }
 152
 153
 154 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */