tor-browser

The Tor Browser
git clone https://git.dasho.dev/tor-browser.git
Log | Files | Refs | README | LICENSE

hb-multimap.hh (2378B)

      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  {
     41    hb_vector_t<hb_codepoint_t> *m;
     42    if (multiples.has (k, &m))
     43    {
     44      m->push (v);
     45      return;
     46    }
     47 
     48    hb_codepoint_t *old_v;
     49    if (singulars.has (k, &old_v))
     50    {
     51      hb_codepoint_t old = *old_v;
     52      singulars.del (k);
     53 
     54      multiples.set (k, hb_vector_t<hb_codepoint_t> {old, v});
     55      return;
     56    }
     57 
     58    singulars.set (k, v);
     59  }
     60 
     61  hb_array_t<const hb_codepoint_t> get (hb_codepoint_t k) const
     62  {
     63    const hb_codepoint_t *v;
     64    if (singulars.has (k, &v))
     65      return hb_array (v, 1);
     66 
     67    hb_vector_t<hb_codepoint_t> *m;
     68    if (multiples.has (k, &m))
     69      return m->as_array ();
     70 
     71    return hb_array_t<const hb_codepoint_t> ();
     72  }
     73 
     74  bool in_error () const
     75  {
     76    if (singulars.in_error () || multiples.in_error ())
     77      return true;
     78    for (const auto &m : multiples.values_ref ())
     79      if (m.in_error ())
     80        return true;
     81    return false;
     82  }
     83 
     84  void alloc (unsigned size)
     85  {
     86    singulars.alloc (size);
     87  }
     88 
     89  protected:
     90  hb_map_t singulars;
     91  hb_hashmap_t<hb_codepoint_t, hb_vector_t<hb_codepoint_t>> multiples;
     92 };
     93 
     94 
     95 
     96 #endif /* HB_MULTIMAP_HH */