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
|
/* -*- 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 <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: */
|
