2 * Copyright © 2020 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): Garret Rieger
28 #include "hb-priority-queue.hh"
33 hb_priority_queue_t<int64_t> queue;
34 assert (queue.is_empty ());
37 assert (!queue.is_empty ());
38 assert (queue.minimum () == hb_pair (10, 0));
41 assert (queue.minimum () == hb_pair (10, 0));
44 assert (queue.minimum () == hb_pair (5, 2));
47 assert (queue.minimum () == hb_pair (5, 2));
50 assert (queue.minimum () == hb_pair (1, 4));
56 hb_priority_queue_t<int32_t> queue;
66 for (int i = 0; i < 8; i++)
68 assert (!queue.is_empty ());
69 assert (queue.minimum () == hb_pair (i * 10, i));
70 assert (queue.pop_minimum () == hb_pair (i * 10, i));
73 assert (queue.is_empty ());
77 main (int argc, char **argv)