blob: 3d60fb847a1c4db6f809660ad3bac84d2797518d (
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
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
|
/* -*- 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 UniqueIndexImpl::Insert( void* p )
{
// NULL-Pointer not allowed
if ( !p )
return IndexNotFound;
// Expend array if full
Index nTmp = static_cast<Index>(maMap.size());
if( nTmp == nCount )
nTmp++;
// Avoid overflow of UniqIndex upon deletion
nUniqIndex = nUniqIndex % nTmp;
// Search next empty index
while ( maMap.find( nUniqIndex ) != maMap.end() )
nUniqIndex = (nUniqIndex+1) % nTmp;
// Insert object to array
maMap[ nUniqIndex ] = p;
nCount++;
nUniqIndex++;
return ( nUniqIndex + nStartIndex - 1 );
}
void* UniqueIndexImpl::Remove( Index nIndex )
{
// Check for valid index
if ( (nIndex >= nStartIndex) &&
(nIndex < (maMap.size() + nStartIndex)) )
{
// insert index as empty entry, and reduce indexcount,
// if this entry was used
std::map<Index, void*>::iterator it = maMap.find( nIndex - nStartIndex );
if( it != maMap.end() )
{
void* p = it->second;
maMap.erase( it );
nCount--;
return p;
}
}
return nullptr;
}
void* UniqueIndexImpl::Get( Index nIndex ) const
{
// check for valid index
if ( (nIndex >= nStartIndex) &&
(nIndex < (maMap.size() + nStartIndex)) )
{
std::map<Index, void*>::const_iterator it = maMap.find( nIndex - nStartIndex );
if( it != maMap.end() )
return it->second;
}
return nullptr;
}
UniqueIndexImpl::Index UniqueIndexImpl::FirstIndex() const
{
if ( maMap.empty() )
return IndexNotFound;
return maMap.begin()->first;
}
UniqueIndexImpl::Index UniqueIndexImpl::LastIndex() const
{
if ( maMap.empty() )
return IndexNotFound;
return maMap.rbegin()->first;
}
UniqueIndexImpl::Index UniqueIndexImpl::NextIndex(Index aIndex) const
{
std::map<Index, void*>::const_iterator it = maMap.find( aIndex );
if ( it == maMap.end() )
return IndexNotFound;
++it;
if ( it == maMap.end() )
return IndexNotFound;
return it->first;
}
UniqueIndexImpl::Index UniqueIndexImpl::GetIndexOf(void* 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: */
|
