Mercurial > hgrepos > Python2 > PyMuPDF

comparison mupdf-source/thirdparty/leptonica/src/list.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
28 #ifndef LEPTONICA_LIST_H
29 #define LEPTONICA_LIST_H
30
31 /*!
32 * \file list.h
33 *
34 * <pre>
35 * Cell for double-linked lists
36 *
37 * This allows composition of a list of cells with
38 * prev, next and data pointers. Generic data
39 * structures hang on the list cell data pointers.
40 *
41 * The list is not circular because that would add much
42 * complexity in traversing the list under general
43 * conditions where list cells can be added and removed.
44 * The only disadvantage of not having the head point to
45 * the last cell is that the list must be traversed to
46 * find its tail. However, this traversal is fast, and
47 * the listRemoveFromTail() function updates the tail
48 * so there is no searching overhead with repeated use.
49 *
50 * The list macros are used to run through a list, and their
51 * use is encouraged. They are invoked, e.g., as
52 *
53 * DLLIST *head, *elem;
54 * ...
55 * L_BEGIN_LIST_FORWARD(head, elem)
56 * <do something with elem and/or elem->data >
57 * L_END_LIST
58 * </pre>
59 */
60
61 struct DoubleLinkedList
62 {
63 struct DoubleLinkedList *prev;
64 struct DoubleLinkedList *next;
65 void *data;
66 };
67 typedef struct DoubleLinkedList DLLIST;
68
69
70 /*! Simple list traverse macro - forward */
71 #define L_BEGIN_LIST_FORWARD(head, element) \
72 { \
73 DLLIST *_leptvar_nextelem_; \
74 for ((element) = (head); (element); (element) = _leptvar_nextelem_) { \
75 _leptvar_nextelem_ = (element)->next;
76
77
78 /*! Simple list traverse macro - reverse */
79 #define L_BEGIN_LIST_REVERSE(tail, element) \
80 { \
81 DLLIST *_leptvar_prevelem_; \
82 for ((element) = (tail); (element); (element) = _leptvar_prevelem_) { \
83 _leptvar_prevelem_ = (element)->prev;
84
85
86 /*! Simple list traverse macro - end of a list traverse */
87 #define L_END_LIST }}
88
89
90 #endif /* LEPTONICA_LIST_H */