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
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
/* -*- 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 <sal/config.h>
#include <o3tl/safeint.hxx>
#include <xmloff/unointerfacetouniqueidentifiermapper.hxx>
#include <o3tl/string_view.hxx>
#include <algorithm>
using namespace ::com::sun::star;
using css::uno::Reference;
using css::uno::XInterface;
namespace comphelper
{
UnoInterfaceToUniqueIdentifierMapper::UnoInterfaceToUniqueIdentifierMapper()
: mnNextId( 1 )
{
}
const OUString& UnoInterfaceToUniqueIdentifierMapper::registerReference( const Reference< XInterface >& rInterface )
{
// Be certain that the references we store in our table are to the
// leading / primary XInterface - cf. findReference
uno::Reference< uno::XInterface > xRef( rInterface, uno::UNO_QUERY );
IdMap_t::const_iterator aIter;
if( findReference( xRef, aIter ) )
{
return (*aIter).first;
}
else
{
OUString aId = "id" + OUString::number( mnNextId++ );
return (*maEntries.emplace( aId, xRef ).first).first;
}
}
bool UnoInterfaceToUniqueIdentifierMapper::registerReference( const OUString& rIdentifier, const Reference< XInterface >& rInterface )
{
IdMap_t::const_iterator aIter;
// Be certain that the references we store in our table are to the
// leading / primary XInterface - cf. findReference
uno::Reference< uno::XInterface > xRef( rInterface, uno::UNO_QUERY );
if( findReference( xRef, aIter ) )
{
return rIdentifier != (*aIter).first;
}
else if( findIdentifier( rIdentifier, aIter ) || findReserved( rIdentifier ) )
{
return false;
}
else
{
maEntries.insert( IdMap_t::value_type( rIdentifier, xRef ) );
// see if this is a reference like something we would generate in the future
const sal_Unicode *p = rIdentifier.getStr();
sal_Int32 nLength = rIdentifier.getLength();
// see if the identifier is 'id' followed by a pure integer value
if( nLength < 2 || p[0] != 'i' || p[1] != 'd' )
return true;
nLength -= 2;
p += 2;
while(nLength--)
{
if( (*p < '0') || (*p > '9') )
return true; // a custom id, that will never conflict with generated id's
p++;
}
// the identifier is a pure integer value
// so we make sure we will never generate
// an integer value like this one
sal_Int32 nId = o3tl::toInt32(rIdentifier.subView(2));
if (nId > 0 && mnNextId <= o3tl::make_unsigned(nId))
mnNextId = nId + 1;
return true;
}
}
const OUString& UnoInterfaceToUniqueIdentifierMapper::getIdentifier( const Reference< XInterface >& rInterface ) const
{
IdMap_t::const_iterator aIter;
if( findReference( rInterface, aIter ) )
{
return (*aIter).first;
}
else
{
return EMPTY_OUSTRING;
}
}
const Reference< XInterface >& UnoInterfaceToUniqueIdentifierMapper::getReference( const OUString& rIdentifier ) const
{
IdMap_t::const_iterator aIter;
if( findIdentifier( rIdentifier, aIter ) )
{
return (*aIter).second;
}
else
{
static const Reference< XInterface > aEmpty;
return aEmpty;
}
}
bool UnoInterfaceToUniqueIdentifierMapper::findReference( const Reference< XInterface >& rInterface, IdMap_t::const_iterator& rIter ) const
{
uno::Reference< uno::XInterface > xRef( rInterface, uno::UNO_QUERY );
const IdMap_t::const_iterator aEnd( maEntries.end() );
rIter = std::find_if(maEntries.begin(), aEnd, [&xRef](const IdMap_t::value_type& rItem) {
// The Reference == operator, does a repeated queryInterface on
// this to ensure we got the right XInterface base-class. However,
// we can be sure that this has been done already by the time we
// get to here.
return rItem.second.get() == xRef.get();
});
return rIter != aEnd;
}
bool UnoInterfaceToUniqueIdentifierMapper::findIdentifier( const OUString& rIdentifier, IdMap_t::const_iterator& rIter ) const
{
rIter = maEntries.find( rIdentifier );
return rIter != maEntries.end();
}
bool UnoInterfaceToUniqueIdentifierMapper::reserveIdentifier( const OUString& rIdentifier )
{
if ( findReserved( rIdentifier ) )
return false;
maReserved.push_back( rIdentifier );
return true;
}
bool UnoInterfaceToUniqueIdentifierMapper::registerReservedReference(
const OUString& rIdentifier,
const css::uno::Reference< css::uno::XInterface >& rInterface )
{
Reserved_t::const_iterator aIt;
if ( !findReserved( rIdentifier, aIt ) )
return false;
Reserved_t::iterator aRemoveIt( maReserved.begin() + ( aIt - maReserved.begin() ) );
maReserved.erase( aRemoveIt );
registerReference( rIdentifier, rInterface );
return true;
}
bool UnoInterfaceToUniqueIdentifierMapper::findReserved( const OUString& rIdentifier ) const
{
Reserved_t::const_iterator aDummy;
return findReserved( rIdentifier, aDummy );
}
bool UnoInterfaceToUniqueIdentifierMapper::findReserved(
const OUString& rIdentifier,
Reserved_t::const_iterator& rIter ) const
{
rIter = std::find( maReserved.begin(), maReserved.end(), rIdentifier );
return rIter != maReserved.end();
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
