summaryrefslogtreecommitdiff
path: root/vcl/inc/ImplLayoutRuns.hxx
blob: 33f9048924fd4dff6233fe90f6224cf318f9061e (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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
/* -*- 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 .
 */

#pragma once

#include <vcl/dllapi.h>
#include <boost/container/small_vector.hpp>

// used for managing runs e.g. for BiDi, glyph and script fallback
class VCL_DLLPUBLIC ImplLayoutRuns
{
public:
    struct Run
    {
        int m_nMinRunPos;
        int m_nEndRunPos;
        bool m_bRTL;

        Run(int nMinRunPos, int nEndRunPos, bool bRTL)
            : m_nMinRunPos(nMinRunPos)
            , m_nEndRunPos(nEndRunPos)
            , m_bRTL(bRTL)
        {
        }

        inline bool Contains(int nCharPos) const
        {
            return (m_nMinRunPos <= nCharPos) && (nCharPos < m_nEndRunPos);
        }

        bool operator==(const Run&) const = default;
    };

private:
    int mnRunIndex;
    boost::container::small_vector<Run, 8> maRuns;

public:
    ImplLayoutRuns() { mnRunIndex = 0; }

    void Clear() { maRuns.clear(); }
    void AddPos(int nCharPos, bool bRTL);
    void AddRun(int nMinRunPos, int nEndRunPos, bool bRTL);

    void Normalize();
    void ReverseTail(size_t nTailIndex);

    bool IsEmpty() const { return maRuns.empty(); }
    void ResetPos() { mnRunIndex = 0; }
    void NextRun() { ++mnRunIndex; }
    bool GetRun(int* nMinRunPos, int* nEndRunPos, bool* bRTL) const;
    bool GetNextPos(int* nCharPos, bool* bRTL);
    bool PosIsInRun(int nCharPos) const;
    bool PosIsInAnyRun(int nCharPos) const;

    inline auto begin() const { return maRuns.begin(); }
    inline auto end() const { return maRuns.end(); }
    inline const auto& at(size_t nIndex) const { return maRuns.at(nIndex); }
    inline auto size() const { return maRuns.size(); }

    static void PrepareFallbackRuns(ImplLayoutRuns* paRuns, ImplLayoutRuns* paFallbackRuns);
};

/* vim:set shiftwidth=4 softtabstop=4 expandtab: */