blob: 726c96c07b031a2a2b71556e7cf9c9be92d1170e (
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
|
/* -*- 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>
sal_uIntPtr UniqueIndexImpl::Insert( void* p )
{
// NULL-Pointer not allowed
if ( !p )
return UNIQUEINDEX_ENTRY_NOTFOUND;
// Expend array if full
sal_uIntPtr nTmp = 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::Insert( sal_uIntPtr nIndex, void* p )
{
// NULL-Pointer not allowed
if ( !p )
return;
sal_uIntPtr nContIndex = nIndex - nStartIndex;
bool bFound = maMap.find( nContIndex ) != maMap.end();
// Insert object to array
maMap[ nContIndex ] = p;
if( !bFound )
nCount++;
}
void* UniqueIndexImpl::Remove( sal_uIntPtr nIndex )
{
// Check for valid index
if ( (nIndex >= nStartIndex) &&
(nIndex < (size() + nStartIndex)) )
{
// insert index as empty entry, and reduce indexcount,
// if this entry was used
std::map<sal_uInt32, void*>::iterator it = maMap.find( nIndex - nStartIndex );
if( it != maMap.end() )
{
void* p = it->second;
maMap.erase( it );
nCount--;
return p;
}
}
return NULL;
}
void* UniqueIndexImpl::Get( sal_uIntPtr nIndex ) const
{
// check for valid index
if ( (nIndex >= nStartIndex) &&
(nIndex < (size() + nStartIndex)) )
{
std::map<sal_uInt32, void*>::const_iterator it = maMap.find( nIndex - nStartIndex );
if( it != maMap.end() )
return it->second;
}
return NULL;
}
sal_uIntPtr UniqueIndexImpl::FirstIndex() const
{
if ( maMap.empty() )
return UNIQUEINDEX_ENTRY_NOTFOUND;
return maMap.begin()->first;
}
sal_uIntPtr UniqueIndexImpl::LastIndex() const
{
if ( maMap.empty() )
return UNIQUEINDEX_ENTRY_NOTFOUND;
return maMap.rbegin()->first;
}
sal_uIntPtr UniqueIndexImpl::NextIndex(sal_uIntPtr aIndex) const
{
std::map<sal_uInt32, void*>::const_iterator it = maMap.find( aIndex );
if ( it == maMap.end() )
return UNIQUEINDEX_ENTRY_NOTFOUND;
++it;
if ( it == maMap.end() )
return UNIQUEINDEX_ENTRY_NOTFOUND;
return it->first;
}
sal_uIntPtr UniqueIndexImpl::GetIndexOf(void* p) const
{
for( std::map<sal_uInt32, void*>::const_iterator it = maMap.begin(); it != maMap.end(); ++it )
if( it->second == p )
return it->first;
return UNIQUEINDEX_ENTRY_NOTFOUND;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
