1*b1cdbd2cSJim Jagielski /**************************************************************
2*b1cdbd2cSJim Jagielski *
3*b1cdbd2cSJim Jagielski * Licensed to the Apache Software Foundation (ASF) under one
4*b1cdbd2cSJim Jagielski * or more contributor license agreements. See the NOTICE file
5*b1cdbd2cSJim Jagielski * distributed with this work for additional information
6*b1cdbd2cSJim Jagielski * regarding copyright ownership. The ASF licenses this file
7*b1cdbd2cSJim Jagielski * to you under the Apache License, Version 2.0 (the
8*b1cdbd2cSJim Jagielski * "License"); you may not use this file except in compliance
9*b1cdbd2cSJim Jagielski * with the License. You may obtain a copy of the License at
10*b1cdbd2cSJim Jagielski *
11*b1cdbd2cSJim Jagielski * http://www.apache.org/licenses/LICENSE-2.0
12*b1cdbd2cSJim Jagielski *
13*b1cdbd2cSJim Jagielski * Unless required by applicable law or agreed to in writing,
14*b1cdbd2cSJim Jagielski * software distributed under the License is distributed on an
15*b1cdbd2cSJim Jagielski * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
16*b1cdbd2cSJim Jagielski * KIND, either express or implied. See the License for the
17*b1cdbd2cSJim Jagielski * specific language governing permissions and limitations
18*b1cdbd2cSJim Jagielski * under the License.
19*b1cdbd2cSJim Jagielski *
20*b1cdbd2cSJim Jagielski *************************************************************/
21*b1cdbd2cSJim Jagielski
22*b1cdbd2cSJim Jagielski
23*b1cdbd2cSJim Jagielski
24*b1cdbd2cSJim Jagielski // MARKER(update_precomp.py): autogen include statement, do not remove
25*b1cdbd2cSJim Jagielski #include "precompiled_comphelper.hxx"
26*b1cdbd2cSJim Jagielski #include <comphelper/sequence.hxx>
27*b1cdbd2cSJim Jagielski
28*b1cdbd2cSJim Jagielski //.........................................................................
29*b1cdbd2cSJim Jagielski namespace comphelper
30*b1cdbd2cSJim Jagielski {
31*b1cdbd2cSJim Jagielski //.........................................................................
32*b1cdbd2cSJim Jagielski
33*b1cdbd2cSJim Jagielski //------------------------------------------------------------------------------
findValue(const staruno::Sequence<::rtl::OUString> & _rList,const::rtl::OUString & _rValue,sal_Bool _bOnlyFirst)34*b1cdbd2cSJim Jagielski staruno::Sequence<sal_Int16> findValue(const staruno::Sequence< ::rtl::OUString >& _rList, const ::rtl::OUString& _rValue, sal_Bool _bOnlyFirst)
35*b1cdbd2cSJim Jagielski {
36*b1cdbd2cSJim Jagielski sal_Int32 nLength = _rList.getLength();
37*b1cdbd2cSJim Jagielski
38*b1cdbd2cSJim Jagielski if( _bOnlyFirst )
39*b1cdbd2cSJim Jagielski {
40*b1cdbd2cSJim Jagielski //////////////////////////////////////////////////////////////////////
41*b1cdbd2cSJim Jagielski // An welcher Position finde ich den Wert?
42*b1cdbd2cSJim Jagielski sal_Int32 nPos = -1;
43*b1cdbd2cSJim Jagielski const ::rtl::OUString* pTArray = _rList.getConstArray();
44*b1cdbd2cSJim Jagielski for (sal_Int32 i = 0; i < nLength; ++i, ++pTArray)
45*b1cdbd2cSJim Jagielski {
46*b1cdbd2cSJim Jagielski if( pTArray->equals(_rValue) )
47*b1cdbd2cSJim Jagielski {
48*b1cdbd2cSJim Jagielski nPos = i;
49*b1cdbd2cSJim Jagielski break;
50*b1cdbd2cSJim Jagielski }
51*b1cdbd2cSJim Jagielski }
52*b1cdbd2cSJim Jagielski
53*b1cdbd2cSJim Jagielski //////////////////////////////////////////////////////////////////////
54*b1cdbd2cSJim Jagielski // Sequence fuellen
55*b1cdbd2cSJim Jagielski if( nPos>-1 )
56*b1cdbd2cSJim Jagielski {
57*b1cdbd2cSJim Jagielski staruno::Sequence<sal_Int16> aRetSeq( 1 );
58*b1cdbd2cSJim Jagielski aRetSeq.getArray()[0] = (sal_Int16)nPos;
59*b1cdbd2cSJim Jagielski
60*b1cdbd2cSJim Jagielski return aRetSeq;
61*b1cdbd2cSJim Jagielski }
62*b1cdbd2cSJim Jagielski
63*b1cdbd2cSJim Jagielski return staruno::Sequence<sal_Int16>();
64*b1cdbd2cSJim Jagielski
65*b1cdbd2cSJim Jagielski }
66*b1cdbd2cSJim Jagielski else
67*b1cdbd2cSJim Jagielski {
68*b1cdbd2cSJim Jagielski staruno::Sequence<sal_Int16> aRetSeq( nLength );
69*b1cdbd2cSJim Jagielski sal_Int16* pReturn = aRetSeq.getArray();
70*b1cdbd2cSJim Jagielski
71*b1cdbd2cSJim Jagielski //////////////////////////////////////////////////////////////////////
72*b1cdbd2cSJim Jagielski // Wie oft kommt der Wert vor?
73*b1cdbd2cSJim Jagielski const ::rtl::OUString* pTArray = _rList.getConstArray();
74*b1cdbd2cSJim Jagielski for (sal_Int32 i = 0; i < nLength; ++i, ++pTArray)
75*b1cdbd2cSJim Jagielski {
76*b1cdbd2cSJim Jagielski if( pTArray->equals(_rValue) )
77*b1cdbd2cSJim Jagielski {
78*b1cdbd2cSJim Jagielski *pReturn = (sal_Int16)i;
79*b1cdbd2cSJim Jagielski ++pReturn;
80*b1cdbd2cSJim Jagielski }
81*b1cdbd2cSJim Jagielski }
82*b1cdbd2cSJim Jagielski
83*b1cdbd2cSJim Jagielski aRetSeq.realloc(pReturn - aRetSeq.getArray());
84*b1cdbd2cSJim Jagielski
85*b1cdbd2cSJim Jagielski return aRetSeq;
86*b1cdbd2cSJim Jagielski }
87*b1cdbd2cSJim Jagielski }
88*b1cdbd2cSJim Jagielski // -----------------------------------------------------------------------------
existsValue(const::rtl::OUString & Value,const staruno::Sequence<::rtl::OUString> & _aList)89*b1cdbd2cSJim Jagielski sal_Bool existsValue(const ::rtl::OUString& Value,const staruno::Sequence< ::rtl::OUString >& _aList)
90*b1cdbd2cSJim Jagielski {
91*b1cdbd2cSJim Jagielski const ::rtl::OUString * pIter = _aList.getConstArray();
92*b1cdbd2cSJim Jagielski const ::rtl::OUString * pEnd = pIter + _aList.getLength();
93*b1cdbd2cSJim Jagielski return ::std::find(pIter,pEnd,Value) != pEnd;
94*b1cdbd2cSJim Jagielski }
95*b1cdbd2cSJim Jagielski
96*b1cdbd2cSJim Jagielski //.........................................................................
97*b1cdbd2cSJim Jagielski } // namespace comphelper
98*b1cdbd2cSJim Jagielski //.........................................................................
99*b1cdbd2cSJim Jagielski
100