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"
39 typedef struct hb_set_t hb_set_t;
46 hb_set_get_empty (void);
49 hb_set_reference (hb_set_t *set);
52 hb_set_destroy (hb_set_t *set);
55 hb_set_set_user_data (hb_set_t *set,
56 hb_user_data_key_t *key,
58 hb_destroy_func_t destroy,
62 hb_set_get_user_data (hb_set_t *set,
63 hb_user_data_key_t *key);
66 /* Returns false if allocation has failed before */
68 hb_set_allocation_successful (hb_set_t *set);
71 hb_set_clear (hb_set_t *set);
74 hb_set_empty (hb_set_t *set);
77 hb_set_has (hb_set_t *set,
78 hb_codepoint_t codepoint);
80 /* Right now limited to 16-bit integers. Eventually will do full codepoint range, sans -1
81 * which we will use as a sentinel. */
83 hb_set_add (hb_set_t *set,
84 hb_codepoint_t codepoint);
87 hb_set_del (hb_set_t *set,
88 hb_codepoint_t codepoint);
91 hb_set_equal (hb_set_t *set,
95 hb_set_set (hb_set_t *set,
99 hb_set_union (hb_set_t *set,
103 hb_set_intersect (hb_set_t *set,
107 hb_set_subtract (hb_set_t *set,
111 hb_set_symmetric_difference (hb_set_t *set,
114 /* Returns -1 if set empty. */
116 hb_set_min (hb_set_t *set);
118 /* Returns -1 if set empty. */
120 hb_set_max (hb_set_t *set);
122 /* Pass -1 in to get started. */
124 hb_set_next (hb_set_t *set,
125 hb_codepoint_t *codepoint);
127 /* TODO: Add faster iteration API? */
132 #endif /* HB_SET_H */