| /* |
| * Copyright © 2012,2017 Google, Inc. |
| * Copyright © 2021 Behdad Esfahbod |
| * |
| * This is part of HarfBuzz, a text shaping library. |
| * |
| * Permission is hereby granted, without written agreement and without |
| * license or royalty fees, to use, copy, modify, and distribute this |
| * software and its documentation for any purpose, provided that the |
| * above copyright notice and the following two paragraphs appear in |
| * all copies of this software. |
| * |
| * IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE TO ANY PARTY FOR |
| * DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES |
| * ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN |
| * IF THE COPYRIGHT HOLDER HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH |
| * DAMAGE. |
| * |
| * THE COPYRIGHT HOLDER SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, |
| * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND |
| * FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS |
| * ON AN "AS IS" BASIS, AND THE COPYRIGHT HOLDER HAS NO OBLIGATION TO |
| * PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS. |
| * |
| * Google Author(s): Behdad Esfahbod |
| */ |
| |
| #ifndef HB_SET_HH |
| #define HB_SET_HH |
| |
| #include "hb.hh" |
| #include "hb-bit-set-invertible.hh" |
| |
| |
| template <typename impl_t> |
| struct hb_sparseset_t |
| { |
| hb_object_header_t header; |
| impl_t s; |
| |
| hb_sparseset_t () { init (); } |
| ~hb_sparseset_t () { fini (); } |
| |
| hb_sparseset_t (const hb_sparseset_t& other) : hb_sparseset_t () { set (other); } |
| hb_sparseset_t (hb_sparseset_t&& other) : hb_sparseset_t () { s = std::move (other.s); } |
| hb_sparseset_t& operator = (const hb_sparseset_t& other) { set (other); return *this; } |
| hb_sparseset_t& operator = (hb_sparseset_t&& other) { s = std::move (other.s); return *this; } |
| friend void swap (hb_sparseset_t& a, hb_sparseset_t& b) { hb_swap (a.s, b.s); } |
| |
| hb_sparseset_t (std::initializer_list<hb_codepoint_t> lst) : hb_sparseset_t () |
| { |
| for (auto&& item : lst) |
| add (item); |
| } |
| template <typename Iterable, |
| hb_requires (hb_is_iterable (Iterable))> |
| hb_sparseset_t (const Iterable &o) : hb_sparseset_t () |
| { |
| hb_copy (o, *this); |
| } |
| |
| void init () |
| { |
| hb_object_init (this); |
| s.init (); |
| } |
| void fini () |
| { |
| hb_object_fini (this); |
| s.fini (); |
| } |
| |
| explicit operator bool () const { return !is_empty (); } |
| |
| void err () { s.err (); } |
| bool in_error () const { return s.in_error (); } |
| |
| void alloc (unsigned sz) { s.alloc (sz); } |
| void reset () { s.reset (); } |
| void clear () { s.clear (); } |
| void invert () { s.invert (); } |
| bool is_empty () const { return s.is_empty (); } |
| uint32_t hash () const { return s.hash (); } |
| |
| void add (hb_codepoint_t g) { s.add (g); } |
| bool add_range (hb_codepoint_t a, hb_codepoint_t b) { return s.add_range (a, b); } |
| |
| template <typename T> |
| void add_array (const T *array, unsigned int count, unsigned int stride=sizeof(T)) |
| { s.add_array (array, count, stride); } |
| template <typename T> |
| void add_array (const hb_array_t<const T>& arr) { add_array (&arr, arr.len ()); } |
| |
| /* Might return false if array looks unsorted. |
| * Used for faster rejection of corrupt data. */ |
| template <typename T> |
| bool add_sorted_array (const T *array, unsigned int count, unsigned int stride=sizeof(T)) |
| { return s.add_sorted_array (array, count, stride); } |
| template <typename T> |
| bool add_sorted_array (const hb_sorted_array_t<const T>& arr) { return add_sorted_array (&arr, arr.len ()); } |
| |
| void del (hb_codepoint_t g) { s.del (g); } |
| void del_range (hb_codepoint_t a, hb_codepoint_t b) { s.del_range (a, b); } |
| |
| bool get (hb_codepoint_t g) const { return s.get (g); } |
| |
| /* Has interface. */ |
| static constexpr bool SENTINEL = false; |
| typedef bool value_t; |
| value_t operator [] (hb_codepoint_t k) const { return get (k); } |
| bool has (hb_codepoint_t k) const { return (*this)[k] != SENTINEL; } |
| |
| /* Predicate. */ |
| bool operator () (hb_codepoint_t k) const { return has (k); } |
| |
| /* Sink interface. */ |
| hb_sparseset_t& operator << (hb_codepoint_t v) |
| { add (v); return *this; } |
| hb_sparseset_t& operator << (const hb_pair_t<hb_codepoint_t, hb_codepoint_t>& range) |
| { add_range (range.first, range.second); return *this; } |
| |
| bool intersects (hb_codepoint_t first, hb_codepoint_t last) const |
| { return s.intersects (first, last); } |
| |
| void set (const hb_sparseset_t &other) { s.set (other.s); } |
| |
| bool is_equal (const hb_sparseset_t &other) const { return s.is_equal (other.s); } |
| bool operator == (const hb_set_t &other) const { return is_equal (other); } |
| bool operator != (const hb_set_t &other) const { return !is_equal (other); } |
| |
| bool is_subset (const hb_sparseset_t &larger_set) const { return s.is_subset (larger_set.s); } |
| |
| void union_ (const hb_sparseset_t &other) { s.union_ (other.s); } |
| void intersect (const hb_sparseset_t &other) { s.intersect (other.s); } |
| void subtract (const hb_sparseset_t &other) { s.subtract (other.s); } |
| void symmetric_difference (const hb_sparseset_t &other) { s.symmetric_difference (other.s); } |
| |
| bool next (hb_codepoint_t *codepoint) const { return s.next (codepoint); } |
| bool previous (hb_codepoint_t *codepoint) const { return s.previous (codepoint); } |
| bool next_range (hb_codepoint_t *first, hb_codepoint_t *last) const |
| { return s.next_range (first, last); } |
| bool previous_range (hb_codepoint_t *first, hb_codepoint_t *last) const |
| { return s.previous_range (first, last); } |
| unsigned int next_many (hb_codepoint_t codepoint, hb_codepoint_t *out, unsigned int size) const |
| { return s.next_many (codepoint, out, size); } |
| |
| unsigned int get_population () const { return s.get_population (); } |
| hb_codepoint_t get_min () const { return s.get_min (); } |
| hb_codepoint_t get_max () const { return s.get_max (); } |
| |
| static constexpr hb_codepoint_t INVALID = impl_t::INVALID; |
| |
| /* |
| * Iterator implementation. |
| */ |
| using iter_t = typename impl_t::iter_t; |
| iter_t iter () const { return iter_t (this->s); } |
| operator iter_t () const { return iter (); } |
| }; |
| |
| struct hb_set_t : hb_sparseset_t<hb_bit_set_invertible_t> |
| { |
| using sparseset = hb_sparseset_t<hb_bit_set_invertible_t>; |
| |
| ~hb_set_t () = default; |
| hb_set_t () : sparseset () {}; |
| hb_set_t (const hb_set_t &o) : sparseset ((sparseset &) o) {}; |
| hb_set_t (hb_set_t&& o) : sparseset (std::move ((sparseset &) o)) {} |
| hb_set_t& operator = (const hb_set_t&) = default; |
| hb_set_t& operator = (hb_set_t&&) = default; |
| hb_set_t (std::initializer_list<hb_codepoint_t> lst) : sparseset (lst) {} |
| template <typename Iterable, |
| hb_requires (hb_is_iterable (Iterable))> |
| hb_set_t (const Iterable &o) : sparseset (o) {} |
| }; |
| |
| static_assert (hb_set_t::INVALID == HB_SET_VALUE_INVALID, ""); |
| |
| |
| #endif /* HB_SET_HH */ |