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
|
/* -*- 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 .
*/
#ifndef WW_SORTEDARRAY_HXX
#define WW_SORTEDARRAY_HXX
#include <algorithm>
//simple template that manages a static [] array by sorting at construction
namespace ww
{
/** simple template that manages a static array
The template sorts the array at construction in place.
@author
<a href="mailto:cmc@openoffice.org">Caolán McNamara</a>
*/
template<class C> class SortedArray
{
private:
//The array e.g. of sprms.
C *mpWwSprmTab;
size_t mnNoElems;
//No copying
SortedArray(const SortedArray&);
SortedArray& operator=(const SortedArray&);
public:
//Find an entry, return its address if found and 0 if not
const C *search(C aSrch) const
{
std::pair<C *, C *> aPair =
std::equal_range(mpWwSprmTab, mpWwSprmTab + mnNoElems, aSrch);
if (aPair.first != aPair.second)
return aPair.first;
else
return 0;
}
SortedArray(C *pWwSprmTab, size_t nNoElems)
: mpWwSprmTab(pWwSprmTab), mnNoElems(nNoElems)
{
OSL_ENSURE(mnNoElems && pWwSprmTab, "WW8: empty Array: Don't do that");
std::sort(mpWwSprmTab, mpWwSprmTab + mnNoElems);
#if OSL_DEBUG_LEVEL > 1
bool bBroken=false;
rtl::OUString sError;
const C *pIter = mpWwSprmTab;
const C *pBeforeEnd = mpWwSprmTab + mnNoElems - 1;
while (pIter < pBeforeEnd)
{
if (*pIter == *(pIter+1))
{
if (!bBroken)
{
sError =
"WW8: Duplicate in list, almost certainly don't "
"want that!\n"
"(You will not see this message again unless you "
"restart)\n"
"Extra entries are...\n";
bBroken=true;
}
size_t nSize = sizeof(C);
const sal_uInt8 *pHack =
reinterpret_cast<const sal_uInt8 *>(&(*pIter));
for (size_t i=0; i < nSize; ++i)
{
sError += rtl::OUString::valueOf(
static_cast<sal_Int32>(pHack[i]), 16);
sError += rtl::OUString::valueOf(sal_Unicode(' '));
}
sError += rtl::OUString::valueOf(sal_Unicode('\n'));
while (*pIter == *(pIter+1) && pIter < pBeforeEnd)
++pIter;
}
else
++pIter;
}
if (bBroken)
{
OSL_FAIL( rtl::OUStringToOString( sError, RTL_TEXTENCODING_ASCII_US ).getStr() );
}
#endif
}
};
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
