1 /*
2 * Copyright © 2019 Adobe, Inc.
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 * Adobe Author(s): Michiharu Ariza
25 */
26
27 #include "hb.hh"
28 #include "hb-bimap.hh"
29
30 int
main(int argc,char ** argv)31 main (int argc, char **argv)
32 {
33 hb_bimap_t bm;
34
35 assert (bm.is_empty () == true);
36 bm.set (1, 4);
37 bm.set (2, 5);
38 bm.set (3, 6);
39 assert (bm.get_population () == 3);
40 assert (bm.has (1) == true);
41 assert (bm.has (4) == false);
42 assert (bm[2] == 5);
43 assert (bm.backward (6) == 3);
44 bm.del (1);
45 assert (bm.has (1) == false);
46 assert (bm.has (3) == true);
47 bm.clear ();
48 assert (bm.get_population () == 0);
49
50 hb_inc_bimap_t ibm;
51
52 assert (ibm.add (13) == 0);
53 assert (ibm.add (8) == 1);
54 assert (ibm.add (10) == 2);
55 assert (ibm.add (8) == 1);
56 assert (ibm.add (7) == 3);
57 assert (ibm.get_population () == 4);
58 assert (ibm[7] == 3);
59
60 ibm.sort ();
61 assert (ibm.get_population () == 4);
62 assert (ibm[7] == 0);
63 assert (ibm[13] == 3);
64
65 ibm.identity (3);
66 assert (ibm.get_population () == 3);
67 assert (ibm[0] == 0);
68 assert (ibm[1] == 1);
69 assert (ibm[2] == 2);
70 assert (ibm.backward (0) == 0);
71 assert (ibm.backward (1) == 1);
72 assert (ibm.backward (2) == 2);
73 assert (ibm.has (4) == false);
74
75 return 0;
76 }
77