Coverage Report

Created: 2026-07-10 11:04

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/libreoffice/vcl/inc/ImplLayoutRuns.hxx
Line
Count
Source
1
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2
/*
3
 * This file is part of the LibreOffice project.
4
 *
5
 * This Source Code Form is subject to the terms of the Mozilla Public
6
 * License, v. 2.0. If a copy of the MPL was not distributed with this
7
 * file, You can obtain one at http://mozilla.org/MPL/2.0/.
8
 *
9
 * This file incorporates work covered by the following license notice:
10
 *
11
 *   Licensed to the Apache Software Foundation (ASF) under one or more
12
 *   contributor license agreements. See the NOTICE file distributed
13
 *   with this work for additional information regarding copyright
14
 *   ownership. The ASF licenses this file to you under the Apache
15
 *   License, Version 2.0 (the "License"); you may not use this file
16
 *   except in compliance with the License. You may obtain a copy of
17
 *   the License at http://www.apache.org/licenses/LICENSE-2.0 .
18
 */
19
20
#pragma once
21
22
#include <vcl/dllapi.h>
23
#include <boost/container/small_vector.hpp>
24
25
// used for managing runs e.g. for BiDi, glyph and script fallback
26
class VCL_DLLPUBLIC ImplLayoutRuns
27
{
28
public:
29
    struct Run
30
    {
31
        int m_nMinRunPos;
32
        int m_nEndRunPos;
33
        bool m_bRTL;
34
35
        Run(int nMinRunPos, int nEndRunPos, bool bRTL)
36
35.5M
            : m_nMinRunPos(nMinRunPos)
37
35.5M
            , m_nEndRunPos(nEndRunPos)
38
35.5M
            , m_bRTL(bRTL)
39
35.5M
        {
40
35.5M
        }
41
42
        inline bool Contains(int nCharPos) const
43
0
        {
44
0
            return (m_nMinRunPos <= nCharPos) && (nCharPos < m_nEndRunPos);
45
0
        }
46
47
        bool operator==(const Run&) const = default;
48
    };
49
50
private:
51
    int mnRunIndex;
52
    boost::container::small_vector<Run, 8> maRuns;
53
54
public:
55
44.4M
    ImplLayoutRuns() { mnRunIndex = 0; }
56
57
0
    void Clear() { maRuns.clear(); }
58
    void AddPos(int nCharPos, bool bRTL);
59
    void AddRun(int nMinRunPos, int nEndRunPos, bool bRTL);
60
61
    void Normalize();
62
    void ReverseTail(size_t nTailIndex);
63
64
14.7M
    bool IsEmpty() const { return maRuns.empty(); }
65
14.8M
    void ResetPos() { mnRunIndex = 0; }
66
21.0M
    void NextRun() { ++mnRunIndex; }
67
    bool GetRun(int* nMinRunPos, int* nEndRunPos, bool* bRTL) const;
68
    bool GetNextPos(int* nCharPos, bool* bRTL);
69
    bool PosIsInRun(int nCharPos) const;
70
    bool PosIsInAnyRun(int nCharPos) const;
71
72
14.7M
    inline auto begin() const { return maRuns.begin(); }
73
14.7M
    inline auto end() const { return maRuns.end(); }
74
0
    inline const auto& at(size_t nIndex) const { return maRuns.at(nIndex); }
75
0
    inline auto size() const { return maRuns.size(); }
76
77
    static void PrepareFallbackRuns(ImplLayoutRuns* paRuns, ImplLayoutRuns* paFallbackRuns);
78
};
79
80
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */