2 * Copyright © 2012 Google, Inc.
4 * This is part of HarfBuzz, a text shaping library.
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.
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
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.
24 * Google Author(s): Behdad Esfahbod
28 #error "Include <hb.h> instead."
34 #include "hb-common.h"
42 #define HB_SET_VALUE_INVALID ((hb_codepoint_t) -1)
44 typedef struct hb_set_t hb_set_t;
51 hb_set_get_empty (void);
54 hb_set_reference (hb_set_t *set);
57 hb_set_destroy (hb_set_t *set);
60 hb_set_set_user_data (hb_set_t *set,
61 hb_user_data_key_t *key,
63 hb_destroy_func_t destroy,
67 hb_set_get_user_data (hb_set_t *set,
68 hb_user_data_key_t *key);
71 /* Returns false if allocation has failed before */
73 hb_set_allocation_successful (const hb_set_t *set);
76 hb_set_clear (hb_set_t *set);
79 hb_set_is_empty (const hb_set_t *set);
82 hb_set_has (const hb_set_t *set,
83 hb_codepoint_t codepoint);
86 hb_set_add (hb_set_t *set,
87 hb_codepoint_t codepoint);
90 hb_set_add_range (hb_set_t *set,
95 hb_set_del (hb_set_t *set,
96 hb_codepoint_t codepoint);
99 hb_set_del_range (hb_set_t *set,
100 hb_codepoint_t first,
101 hb_codepoint_t last);
104 hb_set_is_equal (const hb_set_t *set,
105 const hb_set_t *other);
108 hb_set_is_subset (const hb_set_t *set,
109 const hb_set_t *larger_set);
112 hb_set_set (hb_set_t *set,
113 const hb_set_t *other);
116 hb_set_union (hb_set_t *set,
117 const hb_set_t *other);
120 hb_set_intersect (hb_set_t *set,
121 const hb_set_t *other);
124 hb_set_subtract (hb_set_t *set,
125 const hb_set_t *other);
128 hb_set_symmetric_difference (hb_set_t *set,
129 const hb_set_t *other);
131 HB_EXTERN unsigned int
132 hb_set_get_population (const hb_set_t *set);
134 /* Returns HB_SET_VALUE_INVALID if set empty. */
135 HB_EXTERN hb_codepoint_t
136 hb_set_get_min (const hb_set_t *set);
138 /* Returns HB_SET_VALUE_INVALID if set empty. */
139 HB_EXTERN hb_codepoint_t
140 hb_set_get_max (const hb_set_t *set);
142 /* Pass HB_SET_VALUE_INVALID in to get started. */
144 hb_set_next (const hb_set_t *set,
145 hb_codepoint_t *codepoint);
147 /* Pass HB_SET_VALUE_INVALID in to get started. */
149 hb_set_previous (const hb_set_t *set,
150 hb_codepoint_t *codepoint);
152 /* Pass HB_SET_VALUE_INVALID for first and last to get started. */
154 hb_set_next_range (const hb_set_t *set,
155 hb_codepoint_t *first,
156 hb_codepoint_t *last);
158 /* Pass HB_SET_VALUE_INVALID for first and last to get started. */
160 hb_set_previous_range (const hb_set_t *set,
161 hb_codepoint_t *first,
162 hb_codepoint_t *last);
167 #endif /* HB_SET_H */