Mercurial > hgrepos > Python2 > PyMuPDF

comparison mupdf-source/include/mupdf/fitz/tree.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 // Copyright (C) 2004-2021 Artifex Software, Inc.
2 //
3 // This file is part of MuPDF.
4 //
5 // MuPDF is free software: you can redistribute it and/or modify it under the
6 // terms of the GNU Affero General Public License as published by the Free
7 // Software Foundation, either version 3 of the License, or (at your option)
8 // any later version.
9 //
10 // MuPDF is distributed in the hope that it will be useful, but WITHOUT ANY
11 // WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
12 // FOR A PARTICULAR PURPOSE. See the GNU Affero General Public License for more
13 // details.
14 //
15 // You should have received a copy of the GNU Affero General Public License
16 // along with MuPDF. If not, see <https://www.gnu.org/licenses/agpl-3.0.en.html>
17 //
18 // Alternative licensing terms are available from the licensor.
19 // For commercial licensing, see <https://www.artifex.com/> or contact
20 // Artifex Software, Inc., 39 Mesa Street, Suite 108A, San Francisco,
21 // CA 94129, USA, for further information.
22
23 #ifndef MUPDF_FITZ_TREE_H
24 #define MUPDF_FITZ_TREE_H
25
26 #include "mupdf/fitz/system.h"
27 #include "mupdf/fitz/context.h"
28
29 /**
30 AA-tree to look up things by strings.
31 */
32
33 typedef struct fz_tree fz_tree;
34
35 /**
36 Look for the value of a node in the tree with the given key.
37
38 Simple pointer equivalence is used for key.
39
40 Returns NULL for no match.
41 */
42 void *fz_tree_lookup(fz_context *ctx, fz_tree *node, const char *key);
43
44 /**
45 Insert a new key/value pair and rebalance the tree.
46 Return the new root of the tree after inserting and rebalancing.
47 May be called with a NULL root to create a new tree.
48
49 No data is copied into the tree structure; key and value are
50 merely kept as pointers.
51 */
52 fz_tree *fz_tree_insert(fz_context *ctx, fz_tree *root, const char *key, void *value);
53
54 /**
55 Drop the tree.
56
57 The storage used by the tree is freed, and each value has
58 dropfunc called on it.
59 */
60 void fz_drop_tree(fz_context *ctx, fz_tree *node, void (*dropfunc)(fz_context *ctx, void *value));
61
62 #endif