blob: 40b66a70c574b83ffe1020086aa9eeb560db3970 (
plain)
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
103
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include <comphelper/sequence.hxx>
//.........................................................................
namespace comphelper
{
//.........................................................................
//------------------------------------------------------------------------------
staruno::Sequence<sal_Int16> findValue(const staruno::Sequence< ::rtl::OUString >& _rList, const ::rtl::OUString& _rValue, sal_Bool _bOnlyFirst)
{
sal_Int32 nLength = _rList.getLength();
if( _bOnlyFirst )
{
//////////////////////////////////////////////////////////////////////
// An welcher Position finde ich den Wert?
sal_Int32 nPos = -1;
const ::rtl::OUString* pTArray = _rList.getConstArray();
for (sal_Int32 i = 0; i < nLength; ++i, ++pTArray)
{
if( pTArray->equals(_rValue) )
{
nPos = i;
break;
}
}
//////////////////////////////////////////////////////////////////////
// Sequence fuellen
if( nPos>-1 )
{
staruno::Sequence<sal_Int16> aRetSeq( 1 );
aRetSeq.getArray()[0] = (sal_Int16)nPos;
return aRetSeq;
}
return staruno::Sequence<sal_Int16>();
}
else
{
staruno::Sequence<sal_Int16> aRetSeq( nLength );
sal_Int16* pReturn = aRetSeq.getArray();
//////////////////////////////////////////////////////////////////////
// Wie oft kommt der Wert vor?
const ::rtl::OUString* pTArray = _rList.getConstArray();
for (sal_Int32 i = 0; i < nLength; ++i, ++pTArray)
{
if( pTArray->equals(_rValue) )
{
*pReturn = (sal_Int16)i;
++pReturn;
}
}
aRetSeq.realloc(pReturn - aRetSeq.getArray());
return aRetSeq;
}
}
// -----------------------------------------------------------------------------
sal_Bool existsValue(const ::rtl::OUString& Value,const staruno::Sequence< ::rtl::OUString >& _aList)
{
const ::rtl::OUString * pIter = _aList.getConstArray();
const ::rtl::OUString * pEnd = pIter + _aList.getLength();
return ::std::find(pIter,pEnd,Value) != pEnd;
}
//.........................................................................
} // namespace comphelper
//.........................................................................
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
