Mercurial > hgrepos > Python2 > PyMuPDF

comparison mupdf-source/thirdparty/harfbuzz/src/test-priority-queue.cc @ 2:b50eed0cc0ef upstream

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
ADD: MuPDF v1.26.7: the MuPDF source as downloaded by a default build of PyMuPDF 1.26.4. The directory name has changed: no version number in the expanded directory now.
author Franz Glasner <fzglas.hg@dom66.de>
date Mon, 15 Sep 2025 11:43:07 +0200
parents
children
comparison
equal deleted inserted replaced
1:1d09e1dec1d9 2:b50eed0cc0ef
1 /*
2 * Copyright © 2020 Google, 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 * Google Author(s): Garret Rieger
25 */
26
27 #include "hb.hh"
28 #include "hb-priority-queue.hh"
29
30 static void
31 test_insert ()
32 {
33 hb_priority_queue_t queue;
34 assert (queue.is_empty ());
35
36 queue.insert (10, 0);
37 assert (!queue.is_empty ());
38 assert (queue.minimum () == hb_pair (10, 0));
39
40 queue.insert (20, 1);
41 assert (queue.minimum () == hb_pair (10, 0));
42
43 queue.insert (5, 2);
44 assert (queue.minimum () == hb_pair (5, 2));
45
46 queue.insert (15, 3);
47 assert (queue.minimum () == hb_pair (5, 2));
48
49 queue.insert (1, 4);
50 assert (queue.minimum () == hb_pair (1, 4));
51 }
52
53 static void
54 test_extract ()
55 {
56 hb_priority_queue_t queue;
57 queue.insert (0, 0);
58 queue.insert (60, 6);
59 queue.insert (30, 3);
60 queue.insert (40 ,4);
61 queue.insert (20, 2);
62 queue.insert (50, 5);
63 queue.insert (70, 7);
64 queue.insert (10, 1);
65
66 for (int i = 0; i < 8; i++)
67 {
68 assert (!queue.is_empty ());
69 assert (queue.minimum () == hb_pair (i * 10, i));
70 assert (queue.pop_minimum () == hb_pair (i * 10, i));
71 }
72
73 assert (queue.is_empty ());
74 }
75
76 int
77 main (int argc, char **argv)
78 {
79 test_insert ();
80 test_extract ();
81 }