findpos.cxx (24acc546) findpos.cxx (bd656f79)
1/**************************************************************
2 *
3 * Licensed to the Apache Software Foundation (ASF) under one
4 * or more contributor license agreements. See the NOTICE file
5 * distributed with this work for additional information
6 * regarding copyright ownership. The ASF licenses this file
7 * to you under the Apache License, Version 2.0 (the
8 * "License"); you may not use this file except in compliance

--- 21 unchanged lines hidden (view full) ---

30
31#include "com/sun/star/uno/Sequence.hxx"
32#include "comphelper/types.hxx"
33#include "rtl/ustring.hxx"
34#include "sal/types.h"
35
36#include <algorithm>
37
1/**************************************************************
2 *
3 * Licensed to the Apache Software Foundation (ASF) under one
4 * or more contributor license agreements. See the NOTICE file
5 * distributed with this work for additional information
6 * regarding copyright ownership. The ASF licenses this file
7 * to you under the Apache License, Version 2.0 (the
8 * "License"); you may not use this file except in compliance

--- 21 unchanged lines hidden (view full) ---

30
31#include "com/sun/star/uno/Sequence.hxx"
32#include "comphelper/types.hxx"
33#include "rtl/ustring.hxx"
34#include "sal/types.h"
35
36#include <algorithm>
37
38namespace detail {
38namespace forms_detail {
39
40sal_Int32 findPos(
41 const ::rtl::OUString& aStr,
42 const ::com::sun::star::uno::Sequence< ::rtl::OUString >& rList)
43{
44 const ::rtl::OUString* pStrList = rList.getConstArray();
45 const ::rtl::OUString* pResult = ::std::lower_bound(
46 pStrList, pStrList + rList.getLength(), aStr );
47 if ( ( pResult != pStrList + rList.getLength() ) && ( *pResult == aStr ) )
48 return ( pResult - pStrList );
49
50 return -1;
51}
52
53}
39
40sal_Int32 findPos(
41 const ::rtl::OUString& aStr,
42 const ::com::sun::star::uno::Sequence< ::rtl::OUString >& rList)
43{
44 const ::rtl::OUString* pStrList = rList.getConstArray();
45 const ::rtl::OUString* pResult = ::std::lower_bound(
46 pStrList, pStrList + rList.getLength(), aStr );
47 if ( ( pResult != pStrList + rList.getLength() ) && ( *pResult == aStr ) )
48 return ( pResult - pStrList );
49
50 return -1;
51}
52
53}