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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4; fill-column: 100 -*- */
/*
* 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/.
*/
#pragma once
#include <sal/config.h>
#include <sal/types.h>
#include <svl/svldllapi.h>
#include <array>
#include <memory>
#include <cassert>
typedef std::pair<sal_uInt16, sal_uInt16> WhichPair;
/**
* Most of the time, the which ranges we point at are a compile-time literal.
* So we take advantage of that, and avoid the cost of allocating our own array and copying into it.
*/
struct SVL_DLLPUBLIC WhichRangesContainer
{
using const_iterator = WhichPair const*;
WhichPair const* m_pairs = nullptr;
sal_Int32 m_size = 0;
/** if true, we allocated and need to delete the pairs, if not, we are pointing
* at a global const literal */
bool m_bOwnRanges = false;
WhichRangesContainer() = default;
WhichRangesContainer(std::unique_ptr<WhichPair[]> wids, sal_Int32 nSize)
: m_pairs(wids.release())
, m_size(nSize)
, m_bOwnRanges(true)
{
}
template <std::size_t N>
WhichRangesContainer(const std::array<WhichPair, N>& ranges)
: m_pairs(ranges.data())
, m_size(N)
, m_bOwnRanges(false)
{
}
WhichRangesContainer(const WhichPair* wids, sal_Int32 nSize);
WhichRangesContainer(sal_uInt16 nWhichStart, sal_uInt16 nWhichEnd);
WhichRangesContainer(WhichRangesContainer const& other) { operator=(other); }
WhichRangesContainer(WhichRangesContainer&& other);
~WhichRangesContainer();
WhichRangesContainer& operator=(WhichRangesContainer&& other);
WhichRangesContainer& operator=(WhichRangesContainer const& other);
bool operator==(WhichRangesContainer const& other) const;
const_iterator begin() const noexcept { return m_pairs; }
const_iterator end() const noexcept { return begin() + size(); }
bool empty() const noexcept { return m_size == 0; }
sal_Int32 size() const noexcept { return m_size; }
WhichPair const& operator[](sal_Int32 idx) const noexcept
{
assert(idx >= 0 && idx < size() && "index out of range");
return m_pairs[idx];
}
void reset();
// Adds a range to which ranges, keeping the ranges in valid state (sorted, non-overlapping)
WhichRangesContainer MergeRange(sal_uInt16 nFrom, sal_uInt16 nTo) const;
};
/* vim:set shiftwidth=4 softtabstop=4 expandtab cinoptions=b1,g0,N-s cinkeys+=0=break: */
|
