blob: a86b72eab87939abf2f3f31187814b644a0953d1 (
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
|
/* -*- 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/.
*
* 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 .
*/
#pragma once
#include <sal/config.h>
#include <sal/types.h>
#include <svl/whichranges.hxx>
#include <utility>
namespace svl::detail
{
/**
* Determines the number of sal_uInt16s in a container of pairs of
* sal_uInt16s, each representing a range of sal_uInt16s, and total capacity of the ranges.
*/
inline sal_uInt16 CountRanges(const WhichRangesContainer& pRanges)
{
sal_uInt16 nCapacity = 0;
for (const auto& rPair : pRanges)
{
nCapacity += rangeSize(rPair.first, rPair.second);
}
return nCapacity;
}
inline bool validRanges2(const WhichRangesContainer& pRanges)
{
for (sal_Int32 i = 0; i < pRanges.size(); ++i)
{
auto p = pRanges[i];
if (!validRange(p.first, p.second))
return false;
// ranges must be sorted
if (i < pRanges.size() - 1 && !validGap(p.second, pRanges[i + 1].first))
return false;
}
return true;
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab cinoptions=b1,g0,N-s cinkeys+=0=break: */
|
