blob: 50888ce339c37bd87fe43e5ff99460c394c5cf28 (
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
|
/* -*- 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 INCLUDED_SW_INC_EDIMP_HXX
#define INCLUDED_SW_INC_EDIMP_HXX
#include <o3tl/sorted_vector.hxx>
#include "nodeoffset.hxx"
class SwPaM;
class SwNodeIndex;
struct SwPamRange
{
SwNodeOffset nStart, nEnd;
SwPamRange( SwNodeOffset nS, SwNodeOffset nE ) : nStart( nS ), nEnd( nE ) {}
bool operator==( const SwPamRange& rRg ) const
{ return nStart == rRg.nStart; }
bool operator<( const SwPamRange& rRg ) const
{ return nStart < rRg.nStart; }
};
class SwPamRanges
{
public:
SwPamRanges( const SwPaM& rRing );
void Insert( const SwNode& rIdx1, const SwNode& rIdx2 );
SwPaM& SetPam( size_t nArrPos, SwPaM& rPam );
size_t Count() const
{ return maVector.size(); }
private:
o3tl::sorted_vector<SwPamRange> maVector;
};
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
