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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
/* -*- 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 <ImplLayoutRuns.hxx>
#include <algorithm>
#include <tuple>
void ImplLayoutRuns::AddPos( int nCharPos, bool bRTL )
{
// check if charpos could extend current run
if (!maRuns.empty())
{
auto& rLastRun = maRuns.back();
if (bRTL == rLastRun.m_bRTL)
{
if (nCharPos + 1 == rLastRun.m_nMinRunPos)
{
// extend current run by new charpos
rLastRun.m_nMinRunPos = nCharPos;
}
if (nCharPos == rLastRun.m_nEndRunPos)
{
// extend current run by new charpos
++rLastRun.m_nEndRunPos;
}
}
// ignore new charpos when it is in current run
if ((rLastRun.m_nMinRunPos <= nCharPos) && (nCharPos < rLastRun.m_nEndRunPos))
{
return;
}
}
// else append a new run consisting of the new charpos
maRuns.emplace_back(nCharPos, nCharPos + 1, bRTL);
}
void ImplLayoutRuns::AddRun( int nCharPos0, int nCharPos1, bool bRTL )
{
if( nCharPos0 == nCharPos1 )
return;
auto nOrderedCharPos0 = std::min(nCharPos0, nCharPos1);
auto nOrderedCharPos1 = std::max(nCharPos0, nCharPos1);
if (!maRuns.empty())
{
auto& rLastRun = maRuns.back();
if ((rLastRun.m_nMinRunPos <= nOrderedCharPos0)
&& (nOrderedCharPos0 <= rLastRun.m_nEndRunPos)
&& (nOrderedCharPos0 < rLastRun.m_nEndRunPos || bRTL == rLastRun.m_bRTL))
{
rLastRun.m_nEndRunPos = std::max(rLastRun.m_nEndRunPos, nOrderedCharPos1);
return;
}
}
// append new run
maRuns.emplace_back(nOrderedCharPos0, nOrderedCharPos1, bRTL);
}
void ImplLayoutRuns::Normalize()
{
boost::container::small_vector<Run, 8> aOldRuns;
std::swap(aOldRuns, maRuns);
std::sort(aOldRuns.begin(), aOldRuns.end(),
[](const Run& rA, const Run& rB)
{
return std::tie(rA.m_nMinRunPos, rA.m_nEndRunPos)
< std::tie(rB.m_nMinRunPos, rB.m_nEndRunPos);
});
for (const auto& rRun : aOldRuns)
{
AddRun(rRun.m_nMinRunPos, rRun.m_nEndRunPos, false);
}
}
void ImplLayoutRuns::ReverseTail(size_t nTailIndex)
{
std::reverse(maRuns.begin() + nTailIndex, maRuns.end());
}
bool ImplLayoutRuns::PosIsInRun( int nCharPos ) const
{
if( mnRunIndex >= static_cast<int>(maRuns.size()) )
return false;
return maRuns.at(mnRunIndex).Contains(nCharPos);
}
bool ImplLayoutRuns::PosIsInAnyRun( int nCharPos ) const
{
return std::any_of(maRuns.begin(), maRuns.end(),
[nCharPos](const auto& rRun) { return rRun.Contains(nCharPos); });
}
bool ImplLayoutRuns::GetNextPos( int* nCharPos, bool* bRightToLeft )
{
// negative nCharPos => reset to first run
if( *nCharPos < 0 )
mnRunIndex = 0;
// return false when all runs completed
if( mnRunIndex >= static_cast<int>(maRuns.size()) )
return false;
const auto& rRun = maRuns.at(mnRunIndex);
if( *nCharPos < 0 )
{
// get first valid nCharPos in run
*nCharPos = rRun.m_nMinRunPos;
}
else
{
// advance to next nCharPos
++(*nCharPos);
// advance to next run if current run is completed
if (*nCharPos == rRun.m_nEndRunPos)
{
++mnRunIndex;
if (mnRunIndex >= static_cast<int>(maRuns.size()))
{
return false;
}
const auto& rNextRun = maRuns.at(mnRunIndex);
*nCharPos = rNextRun.m_nMinRunPos;
*bRightToLeft = rNextRun.m_bRTL;
}
}
return true;
}
bool ImplLayoutRuns::GetRun( int* nMinRunPos, int* nEndRunPos, bool* bRightToLeft ) const
{
if( mnRunIndex >= static_cast<int>(maRuns.size()) )
return false;
const auto& rRun = maRuns.at(mnRunIndex);
*nMinRunPos = rRun.m_nMinRunPos;
*nEndRunPos = rRun.m_nEndRunPos;
*bRightToLeft = rRun.m_bRTL;
return true;
}
void ImplLayoutRuns::PrepareFallbackRuns(ImplLayoutRuns* paRuns, ImplLayoutRuns* paFallbackRuns)
{
// Normalize the input fallback runs. This is required for efficient lookup.
paFallbackRuns->Normalize();
// Adjust fallback runs to have the same order and limits of the original runs.
ImplLayoutRuns aNewRuns;
for (const auto& rRun : *paRuns)
{
auto nTailIndex = aNewRuns.size();
// Search for the first fallback run intersecting this run
auto it = std::lower_bound(paFallbackRuns->begin(), paFallbackRuns->end(),
rRun.m_nMinRunPos, [](const auto& rCompRun, int nValue)
{ return rCompRun.m_nEndRunPos < nValue; });
for (; it != paFallbackRuns->end(); ++it)
{
if (rRun.m_nEndRunPos <= it->m_nMinRunPos)
{
break;
}
int nSubMin = std::max(rRun.m_nMinRunPos, it->m_nMinRunPos);
int nSubMax = std::min(rRun.m_nEndRunPos, it->m_nEndRunPos);
aNewRuns.AddRun(nSubMin, nSubMax, rRun.m_bRTL);
}
// RTL subruns must be added in reverse order
if (rRun.m_bRTL)
{
aNewRuns.ReverseTail(nTailIndex);
}
}
*paRuns = aNewRuns;
paRuns->ResetPos();
paFallbackRuns->Clear();
paFallbackRuns->ResetPos();
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
