/src/harfbuzz/src/hb-multimap.hh
Line | Count | Source (jump to first uncovered line) |
1 | | /* |
2 | | * Copyright © 2022 Behdad Esfahbod |
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 | | |
25 | | #ifndef HB_MULTIMAP_HH |
26 | | #define HB_MULTIMAP_HH |
27 | | |
28 | | #include "hb.hh" |
29 | | #include "hb-map.hh" |
30 | | #include "hb-vector.hh" |
31 | | |
32 | | |
33 | | /* |
34 | | * hb_multimap_t |
35 | | */ |
36 | | |
37 | | struct hb_multimap_t |
38 | | { |
39 | | void add (hb_codepoint_t k, hb_codepoint_t v) |
40 | 0 | { |
41 | 0 | hb_codepoint_t *i; |
42 | 0 | if (multiples_indices.has (k, &i)) |
43 | 0 | { |
44 | 0 | multiples_values[*i].push (v); |
45 | 0 | return; |
46 | 0 | } |
47 | 0 |
|
48 | 0 | hb_codepoint_t *old_v; |
49 | 0 | if (singulars.has (k, &old_v)) |
50 | 0 | { |
51 | 0 | hb_codepoint_t old = *old_v; |
52 | 0 | singulars.del (k); |
53 | 0 |
|
54 | 0 | multiples_indices.set (k, multiples_values.length); |
55 | 0 | auto *vec = multiples_values.push (); |
56 | 0 |
|
57 | 0 | vec->push (old); |
58 | 0 | vec->push (v); |
59 | 0 |
|
60 | 0 | return; |
61 | 0 | } |
62 | 0 |
|
63 | 0 | singulars.set (k, v); |
64 | 0 | } |
65 | | |
66 | | hb_array_t<const hb_codepoint_t> get (hb_codepoint_t k) const |
67 | 0 | { |
68 | 0 | const hb_codepoint_t *v; |
69 | 0 | if (singulars.has (k, &v)) |
70 | 0 | return hb_array (v, 1); |
71 | 0 |
|
72 | 0 | hb_codepoint_t *i; |
73 | 0 | if (multiples_indices.has (k, &i)) |
74 | 0 | return multiples_values[*i].as_array (); |
75 | 0 |
|
76 | 0 | return hb_array_t<const hb_codepoint_t> (); |
77 | 0 | } |
78 | | |
79 | | bool in_error () const |
80 | 0 | { |
81 | 0 | return singulars.in_error () || multiples_indices.in_error () || multiples_values.in_error (); |
82 | 0 | } |
83 | | |
84 | | protected: |
85 | | hb_map_t singulars; |
86 | | hb_map_t multiples_indices; |
87 | | hb_vector_t<hb_vector_t<hb_codepoint_t>> multiples_values; |
88 | | }; |
89 | | |
90 | | |
91 | | |
92 | | #endif /* HB_MULTIMAP_HH */ |