/src/harfbuzz/src/graph/split-helpers.hh
Line | Count | Source |
1 | | /* |
2 | | * Copyright © 2022 Google, Inc. |
3 | | * |
4 | | * This is part of HarfBuzz, a text shaping library. |
5 | | * |
6 | | * Permission is hereby granted, without written agreement and without |
7 | | * license or royalty fees, to use, copy, modify, and distribute this |
8 | | * software and its documentation for any purpose, provided that the |
9 | | * above copyright notice and the following two paragraphs appear in |
10 | | * all copies of this software. |
11 | | * |
12 | | * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR |
13 | | * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES |
14 | | * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN |
15 | | * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH |
16 | | * DAMAGE. |
17 | | * |
18 | | * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, |
19 | | * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
20 | | * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS |
21 | | * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO |
22 | | * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. |
23 | | * |
24 | | * Google Author(s): Garret Rieger |
25 | | */ |
26 | | |
27 | | #ifndef GRAPH_SPLIT_HELPERS_HH |
28 | | #define GRAPH_SPLIT_HELPERS_HH |
29 | | |
30 | | namespace graph { |
31 | | |
32 | | template<typename Context> |
33 | | HB_INTERNAL |
34 | | hb_vector_t<unsigned> actuate_subtable_split (Context& split_context, |
35 | | const hb_vector_t<unsigned>& split_points) |
36 | 963 | { |
37 | 963 | hb_vector_t<unsigned> new_objects; |
38 | 963 | if (!split_points) |
39 | 94 | return new_objects; |
40 | | |
41 | 29.2k | for (unsigned i = 0; i < split_points.length; i++) |
42 | 28.3k | { |
43 | 28.3k | unsigned start = split_points[i]; |
44 | 28.3k | unsigned end = (i < split_points.length - 1) |
45 | 28.3k | ? split_points[i + 1] |
46 | 28.3k | : split_context.original_count (); |
47 | 28.3k | unsigned id = split_context.clone_range (start, end); |
48 | | |
49 | 28.3k | if (id == (unsigned) -1) |
50 | 0 | { |
51 | 0 | new_objects.reset (); |
52 | 0 | new_objects.ensure_error (); |
53 | 0 | return new_objects; |
54 | 0 | } |
55 | 28.3k | new_objects.push (id); |
56 | 28.3k | } |
57 | | |
58 | 869 | if (!split_context.shrink (split_points[0])) |
59 | 2 | { |
60 | 2 | new_objects.reset (); |
61 | 2 | new_objects.ensure_error (); |
62 | 2 | } |
63 | | |
64 | 869 | return new_objects; |
65 | 869 | } hb_vector_t<unsigned int, false> graph::actuate_subtable_split<graph::PairPosFormat1::split_context_t>(graph::PairPosFormat1::split_context_t&, hb_vector_t<unsigned int, false> const&) Line | Count | Source | 36 | 567 | { | 37 | 567 | hb_vector_t<unsigned> new_objects; | 38 | 567 | if (!split_points) | 39 | 78 | return new_objects; | 40 | | | 41 | 5.14k | for (unsigned i = 0; i < split_points.length; i++) | 42 | 4.65k | { | 43 | 4.65k | unsigned start = split_points[i]; | 44 | 4.65k | unsigned end = (i < split_points.length - 1) | 45 | 4.65k | ? split_points[i + 1] | 46 | 4.65k | : split_context.original_count (); | 47 | 4.65k | unsigned id = split_context.clone_range (start, end); | 48 | | | 49 | 4.65k | if (id == (unsigned) -1) | 50 | 0 | { | 51 | 0 | new_objects.reset (); | 52 | 0 | new_objects.ensure_error (); | 53 | 0 | return new_objects; | 54 | 0 | } | 55 | 4.65k | new_objects.push (id); | 56 | 4.65k | } | 57 | | | 58 | 489 | if (!split_context.shrink (split_points[0])) | 59 | 0 | { | 60 | 0 | new_objects.reset (); | 61 | 0 | new_objects.ensure_error (); | 62 | 0 | } | 63 | | | 64 | 489 | return new_objects; | 65 | 489 | } |
Unexecuted instantiation: hb_vector_t<unsigned int, false> graph::actuate_subtable_split<graph::PairPosFormat2::split_context_t>(graph::PairPosFormat2::split_context_t&, hb_vector_t<unsigned int, false> const&) Unexecuted instantiation: hb_vector_t<unsigned int, false> graph::actuate_subtable_split<graph::MarkBasePosFormat1::split_context_t>(graph::MarkBasePosFormat1::split_context_t&, hb_vector_t<unsigned int, false> const&) hb_vector_t<unsigned int, false> graph::actuate_subtable_split<graph::LigatureSubstFormat1::split_context_t>(graph::LigatureSubstFormat1::split_context_t&, hb_vector_t<unsigned int, false> const&) Line | Count | Source | 36 | 396 | { | 37 | 396 | hb_vector_t<unsigned> new_objects; | 38 | 396 | if (!split_points) | 39 | 16 | return new_objects; | 40 | | | 41 | 24.1k | for (unsigned i = 0; i < split_points.length; i++) | 42 | 23.7k | { | 43 | 23.7k | unsigned start = split_points[i]; | 44 | 23.7k | unsigned end = (i < split_points.length - 1) | 45 | 23.7k | ? split_points[i + 1] | 46 | 23.7k | : split_context.original_count (); | 47 | 23.7k | unsigned id = split_context.clone_range (start, end); | 48 | | | 49 | 23.7k | if (id == (unsigned) -1) | 50 | 0 | { | 51 | 0 | new_objects.reset (); | 52 | 0 | new_objects.ensure_error (); | 53 | 0 | return new_objects; | 54 | 0 | } | 55 | 23.7k | new_objects.push (id); | 56 | 23.7k | } | 57 | | | 58 | 380 | if (!split_context.shrink (split_points[0])) | 59 | 2 | { | 60 | 2 | new_objects.reset (); | 61 | 2 | new_objects.ensure_error (); | 62 | 2 | } | 63 | | | 64 | 380 | return new_objects; | 65 | 380 | } |
|
66 | | |
67 | | } |
68 | | |
69 | | #endif // GRAPH_SPLIT_HELPERS_HH |