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