1 #ifndef DALI_TOOLKIT_TEXT_BOUNDED_PARAGRAPH_RUN_H
2 #define DALI_TOOLKIT_TEXT_BOUNDED_PARAGRAPH_RUN_H
5 * Copyright (c) 2022 Samsung Electronics Co., Ltd.
7 * Licensed under the Apache License, Version 2.0 (the "License");
8 * you may not use this file except in compliance with the License.
9 * You may obtain a copy of the License at
11 * http://www.apache.org/licenses/LICENSE-2.0
13 * Unless required by applicable law or agreed to in writing, software
14 * distributed under the License is distributed on an "AS IS" BASIS,
15 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 * See the License for the specific language governing permissions and
17 * limitations under the License.
22 #include <dali/public-api/math/vector2.h>
25 #include <dali-toolkit/internal/text/character-run.h>
34 * @brief BoundedParagraphRun
36 * In terms of the bidirectional algorithm, a 'paragraph' is understood as a run of characters between Paragraph Separators or appropriate Newline Functions.
37 * A 'paragraph' may also be determined by higher-level protocols like a mark-up tag.
38 * Bounded-paragraph is a pragraph that have been bounded by explicit tags like a mark-up tag.
39 * Bounded-paragraph could contain multi paragraphs that have been breaked by Paragraph Separators or appropriate Newline Functions.
40 * This will be used to handle information for the attributes of markup tag. Like TextAlign, TextDirection, TextIndent, LineHeight, etc.
42 struct BoundedParagraphRun
44 CharacterRun characterRun; ///< The initial character index within the whole text and the number of characters of the run.
49 } // namespace Toolkit
53 #endif // DALI_TOOLKIT_TEXT_BOUNDED_PARAGRAPH_RUN_H