sc/source/ui/dbgui/csvsplits.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 "csvsplits.hxx"
  21
  22 #include <algorithm>
  23
  24
  25 // ============================================================================
  26
  27 bool ScCsvSplits::Insert( sal_Int32 nPos )
  28 {
  29     bool bValid = (nPos >= 0);
  30     if( bValid )
  31     {
  32         iterator aIter = ::std::lower_bound( maVec.begin(), maVec.end(), nPos );
  33         bValid = (aIter == maVec.end()) || (*aIter != nPos);
  34         if( bValid )
  35             aIter = maVec.insert( aIter, nPos );
  36     }
  37     return bValid;
  38 }
  39
  40 bool ScCsvSplits::Remove( sal_Int32 nPos )
  41 {
  42     sal_uInt32 nIndex = GetIndex( nPos );
  43     bool bValid = (nIndex != CSV_VEC_NOTFOUND);
  44     if( bValid )
  45         maVec.erase( maVec.begin() + nIndex );
  46     return bValid;
  47 }
  48
  49 void ScCsvSplits::RemoveRange( sal_Int32 nPosStart, sal_Int32 nPosEnd )
  50 {
  51     sal_uInt32 nStartIx = LowerBound( nPosStart );
  52     sal_uInt32 nEndIx = UpperBound( nPosEnd );
  53     if( (nStartIx != CSV_VEC_NOTFOUND) && (nEndIx != CSV_VEC_NOTFOUND) && (nStartIx <= nEndIx) )
  54         maVec.erase( maVec.begin() + nStartIx, maVec.begin() + nEndIx + 1 );
  55 }
  56
  57 void ScCsvSplits::Clear()
  58 {
  59     maVec.clear();
  60 }
  61
  62 bool ScCsvSplits::HasSplit( sal_Int32 nPos ) const
  63 {
  64     return GetIndex( nPos ) != CSV_VEC_NOTFOUND;
  65 }
  66
  67
  68 // ----------------------------------------------------------------------------
  69
  70 sal_uInt32 ScCsvSplits::GetIndex( sal_Int32 nPos ) const
  71 {
  72     const_iterator aIter = ::std::lower_bound( maVec.begin(), maVec.end(), nPos );
  73     return GetIterIndex( ((aIter != maVec.end()) && (*aIter == nPos)) ? aIter : maVec.end() );
  74 }
  75
  76 sal_uInt32 ScCsvSplits::LowerBound( sal_Int32 nPos ) const
  77 {
  78     return GetIterIndex( ::std::lower_bound( maVec.begin(), maVec.end(), nPos ) );
  79 }
  80
  81 sal_uInt32 ScCsvSplits::UpperBound( sal_Int32 nPos ) const
  82 {
  83     sal_uInt32 nIndex = LowerBound( nPos );
  84     if( nIndex == CSV_VEC_NOTFOUND )
  85         return Count() ? (Count() - 1) : CSV_VEC_NOTFOUND;
  86     if( GetPos( nIndex ) == nPos )
  87         return nIndex;
  88     return nIndex ? (nIndex - 1) : CSV_VEC_NOTFOUND;
  89 }
  90
  91 sal_Int32 ScCsvSplits::GetPos( sal_uInt32 nIndex ) const
  92 {
  93     return (nIndex < Count()) ? maVec[ nIndex ] : CSV_POS_INVALID;
  94 }
  95
  96
  97 // ----------------------------------------------------------------------------
  98
  99 sal_uInt32 ScCsvSplits::GetIterIndex( const_iterator aIter ) const
 100 {
 101     return (aIter == maVec.end()) ? CSV_VEC_NOTFOUND : (aIter - maVec.begin());
 102 }
 103
 104
 105 // ============================================================================
 106
 107 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */