blob: 06cda449a9c58ddb1e9017a440fa8b80efa457b2 (
plain)
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
|
/* -*- 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 <tools/unqidx.hxx>
UniqueIndexImpl::Index const UniqueIndexImpl::IndexNotFound(SAL_MAX_UINT32);
UniqueIndexImpl::Index UniqueIndexImpl::Insert( void* p )
{
// NULL-Pointer not allowed
if ( !p )
return IndexNotFound;
// Insert the pointer, starting from the current nUniqIndex "hint"
// and increasing it until a free one is found (this may happen
// after removals followed by multiple insertions).
while ( !maMap.emplace(nUniqIndex, p).second )
++nUniqIndex;
// Take care of updating hint key for next insertion
return nUniqIndex++;
}
void* UniqueIndexImpl::Remove( Index nIndex )
{
std::map<Index, void*>::iterator it = maMap.find( nIndex );
if ( it != maMap.end() )
{
// Allow to recycle freed indexes, as was done by
// original implementation based on a vector
// This is not really needed when using a map, and
// really unique indexes might be better/safer?
if ( nIndex < nUniqIndex )
nUniqIndex = nIndex;
void* p = it->second;
maMap.erase( it );
return p;
}
return nullptr;
}
void* UniqueIndexImpl::Get( Index nIndex ) const
{
std::map<Index, void*>::const_iterator it = maMap.find( nIndex );
if ( it != maMap.end() )
return it->second;
return nullptr;
}
UniqueIndexImpl::Index UniqueIndexImpl::GetIndexOf(void const * p) const
{
for( std::map<Index, void*>::const_iterator it = maMap.begin(); it != maMap.end(); ++it )
if( it->second == p )
return it->first;
return IndexNotFound;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
