1 /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
3 * This file is part of the LibreOffice project.
5 * This Source Code Form is subject to the terms of the Mozilla Public
6 * License, v. 2.0. If a copy of the MPL was not distributed with this
7 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
9 * This file incorporates work covered by the following license notice:
11 * Licensed to the Apache Software Foundation (ASF) under one or more
12 * contributor license agreements. See the NOTICE file distributed
13 * with this work for additional information regarding copyright
14 * ownership. The ASF licenses this file to you under the Apache
15 * License, Version 2.0 (the "License"); you may not use this file
16 * except in compliance with the License. You may obtain a copy of
17 * the License at http://www.apache.org/licenses/LICENSE-2.0 .
22 #include <oox/helper/containerhelper.hxx>
24 #include <com/sun/star/container/XNameContainer.hpp>
25 #include <osl/diagnose.h>
29 using namespace ::com::sun::star::container
;
30 using namespace ::com::sun::star::uno
;
36 bool operator()( const ValueRange
& rLHS
, const ValueRange
& rRHS
) const
38 return rLHS
.mnLast
< rRHS
.mnFirst
;
44 void ValueRangeSet::insert( const ValueRange
& rRange
)
46 // find the first range that contains or follows the starting point of the passed range
47 ValueRangeVector::iterator aBeg
= maRanges
.begin();
48 ValueRangeVector::iterator aEnd
= maRanges
.end();
49 ValueRangeVector::iterator aIt
= ::std::lower_bound( aBeg
, aEnd
, rRange
, ValueRangeComp() );
50 // nothing to do if found range contains passed range
51 if( (aIt
!= aEnd
) && aIt
->contains( rRange
) ) return;
52 // check if previous range can be used to merge with the passed range
53 if( (aIt
!= aBeg
) && ((aIt
- 1)->mnLast
+ 1 == rRange
.mnFirst
) ) --aIt
;
54 // check if current range (aIt) can be used to merge with passed range
55 if( (aIt
!= aEnd
) && aIt
->intersects( rRange
) )
57 // set new start value to existing range
58 aIt
->mnFirst
= ::std::min( aIt
->mnFirst
, rRange
.mnFirst
);
59 // search first range that cannot be merged anymore (aNext)
60 ValueRangeVector::iterator aNext
= aIt
+ 1;
61 while( (aNext
!= aEnd
) && aNext
->intersects( rRange
) ) ++aNext
;
62 // set new end value to existing range
63 aIt
->mnLast
= ::std::max( (aNext
- 1)->mnLast
, rRange
.mnLast
);
64 // remove ranges covered by new existing range (aIt)
65 maRanges
.erase( aIt
+ 1, aNext
);
69 // merging not possible: insert new range
70 maRanges
.insert( aIt
, rRange
);
74 OUString
ContainerHelper::getUnusedName(
75 const Reference
< XNameAccess
>& rxNameAccess
, const OUString
& rSuggestedName
,
76 sal_Unicode cSeparator
)
78 OSL_ENSURE( rxNameAccess
.is(), "ContainerHelper::getUnusedName - missing XNameAccess interface" );
80 OUString aNewName
= rSuggestedName
;
81 sal_Int32 nIndex
= -1;
82 while( rxNameAccess
->hasByName( aNewName
) )
83 aNewName
= rSuggestedName
+ OUStringChar(cSeparator
) + OUString::number( nIndex
++ );
87 bool ContainerHelper::insertByName(
88 const Reference
< XNameContainer
>& rxNameContainer
,
89 const OUString
& rName
, const Any
& rObject
)
91 OSL_ENSURE( rxNameContainer
.is(), "ContainerHelper::insertByName - missing XNameContainer interface" );
95 if( rxNameContainer
->hasByName( rName
) )
96 rxNameContainer
->replaceByName( rName
, rObject
);
98 rxNameContainer
->insertByName( rName
, rObject
);
104 OSL_ENSURE( bRet
, "ContainerHelper::insertByName - cannot insert object" );
108 OUString
ContainerHelper::insertByUnusedName(
109 const Reference
< XNameContainer
>& rxNameContainer
,
110 const OUString
& rSuggestedName
, sal_Unicode cSeparator
,
113 OSL_ENSURE( rxNameContainer
.is(), "ContainerHelper::insertByUnusedName - missing XNameContainer interface" );
115 // find an unused name
116 OUString aNewName
= getUnusedName( rxNameContainer
, rSuggestedName
, cSeparator
);
118 // insert the new object and return its resulting name
119 insertByName( rxNameContainer
, aNewName
, rObject
);
125 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */