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
|
/* -*- 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 "collect.hxx"
#include <string.h>
#define MAXCOLLECTIONSIZE 16384
#define MAXDELTA 1024
ScDataObject::~ScDataObject()
{
}
// Collection
static void lcl_DeleteScDataObjects( ScDataObject** p, sal_uInt16 nCount )
{
if ( p )
{
for (sal_uInt16 i = 0; i < nCount; i++) delete p[i];
delete[] p;
p = NULL;
}
}
ScCollection::ScCollection(sal_uInt16 nLim, sal_uInt16 nDel) :
nCount ( 0 ),
nLimit ( nLim ),
nDelta ( nDel ),
pItems ( NULL )
{
if (nDelta > MAXDELTA)
nDelta = MAXDELTA;
else if (nDelta == 0)
nDelta = 1;
if (nLimit > MAXCOLLECTIONSIZE)
nLimit = MAXCOLLECTIONSIZE;
else if (nLimit < nDelta)
nLimit = nDelta;
pItems = new ScDataObject*[nLimit];
}
ScCollection::ScCollection(const ScCollection& rCollection)
: ScDataObject(),
nCount ( 0 ),
nLimit ( 0 ),
nDelta ( 0 ),
pItems ( NULL )
{
*this = rCollection;
}
ScCollection::~ScCollection()
{
lcl_DeleteScDataObjects( pItems, nCount );
}
sal_uInt16 ScCollection::GetCount() const { return nCount; }
bool ScCollection::AtInsert(sal_uInt16 nIndex, ScDataObject* pScDataObject)
{
if ((nCount < MAXCOLLECTIONSIZE) && (nIndex <= nCount) && pItems)
{
if (nCount == nLimit)
{
ScDataObject** pNewItems = new ScDataObject*[nLimit + nDelta];
if (!pNewItems)
return false;
nLimit = sal::static_int_cast<sal_uInt16>( nLimit + nDelta );
memcpy(pNewItems, pItems, nCount * sizeof(ScDataObject*));
delete[] pItems;
pItems = pNewItems;
}
if (nCount > nIndex)
memmove(&pItems[nIndex + 1], &pItems[nIndex], (nCount - nIndex) * sizeof(ScDataObject*));
pItems[nIndex] = pScDataObject;
nCount++;
return true;
}
return false;
}
bool ScCollection::Insert(ScDataObject* pScDataObject)
{
return AtInsert(nCount, pScDataObject);
}
ScDataObject* ScCollection::At(sal_uInt16 nIndex) const
{
if (nIndex < nCount)
return pItems[nIndex];
else
return NULL;
}
ScCollection& ScCollection::operator=( const ScCollection& r )
{
// Check for self-assignment
if (this == &r)
return *this;
lcl_DeleteScDataObjects( pItems, nCount );
nCount = r.nCount;
nLimit = r.nLimit;
nDelta = r.nDelta;
pItems = new ScDataObject*[nLimit];
for ( sal_uInt16 i=0; i<nCount; i++ )
pItems[i] = r.pItems[i]->Clone();
return *this;
}
ScDataObject* ScCollection::Clone() const
{
return new ScCollection(*this);
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
