Mercurial > hgrepos > Python2 > PyMuPDF

comparison mupdf-source/thirdparty/leptonica/src/queue.h @ 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 (C) 2001 Leptonica. All rights reserved.
3 -
4 - Redistribution and use in source and binary forms, with or without
5 - modification, are permitted provided that the following conditions
6 - are met:
7 - 1. Redistributions of source code must retain the above copyright
8 - notice, this list of conditions and the following disclaimer.
9 - 2. Redistributions in binary form must reproduce the above
10 - copyright notice, this list of conditions and the following
11 - disclaimer in the documentation and/or other materials
12 - provided with the distribution.
13 -
14 - THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
15 - ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
16 - LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
17 - A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
18 - CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
19 - EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
20 - PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
21 - PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
22 - OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
23 - NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
24 - SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
25 *====================================================================*/
26
27 #ifndef LEPTONICA_QUEUE_H
28 #define LEPTONICA_QUEUE_H
29
30 /*!
31 * \file queue.h
32 *
33 * <pre>
34 * Expandable pointer queue for arbitrary void* data.
35 *
36 * The L_Queue is a fifo that implements a queue of void* pointers.
37 * It can be used to hold a queue of any type of struct.
38 *
39 * Internally, it maintains two counters:
40 * nhead: location of head (in ptrs) from the beginning
41 * of the array.
42 * nelem: number of ptr elements stored in the queue.
43 *
44 * The element at the head of the queue, which is the next to
45 * be removed, is array[nhead]. The location at the tail of the
46 * queue to which the next element will be added is
47 * array[nhead + nelem].
48 *
49 * As items are added to the queue, nelem increases.
50 * As items are removed, nhead increases and nelem decreases.
51 * Any time the tail reaches the end of the allocated array,
52 * all the pointers are shifted to the left, so that the head
53 * is at the beginning of the array.
54 * If the array becomes more than 3/4 full, it doubles in size.
55 *
56 * The auxiliary stack can be used in a wrapper for re-using
57 * items popped from the queue. It is not made by default.
58 *
59 * For further implementation details, see queue.c.
60 * </pre>
61 */
62
63 /*! Expandable pointer queue for arbitrary void* data */
64 struct L_Queue
65 {
66 l_int32 nalloc; /*!< size of allocated ptr array */
67 l_int32 nhead; /*!< location of head (in ptrs) from the */
68 /*!< beginning of the array */
69 l_int32 nelem; /*!< number of elements stored in the queue */
70 void **array; /*!< ptr array */
71 struct L_Stack *stack; /*!< auxiliary stack */
72
73 };
74 typedef struct L_Queue L_QUEUE;
75
76
77 #endif /* LEPTONICA_QUEUE_H */