/usr/include/leptonica/rbtree.h is in libleptonica-dev 1.75.3-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 | /*====================================================================*
- Copyright (C) 2001 Leptonica. All rights reserved.
-
- Redistribution and use in source and binary forms, with or without
- modification, are permitted provided that the following conditions
- are met:
- 1. Redistributions of source code must retain the above copyright
- notice, this list of conditions and the following disclaimer.
- 2. Redistributions in binary form must reproduce the above
- copyright notice, this list of conditions and the following
- disclaimer in the documentation and/or other materials
- provided with the distribution.
-
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL ANY
- CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
- EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
- PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
- OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*====================================================================*/
/*
* Modified from the excellent code here:
* http://en.literateprograms.org/Red-black_tree_(C)?oldid=19567
* which has been placed in the public domain under the Creative Commons
* CC0 1.0 waiver (http://creativecommons.org/publicdomain/zero/1.0/).
*
* When the key is generated from a hash (e.g., string --> uint64),
* there is always the possibility of having collisions, but to make
* the collision probability very low requires using a large hash.
* For that reason, the key types are 64 bit quantities, which will result
* in a negligible probabililty of collisions for millions of hashed values.
* Using 8 byte keys instead of 4 byte keys requires a little more
* storage, but the simplification in being able to ignore collisions
* with the red-black trees for most applications is worth it.
*/
#ifndef LEPTONICA_RBTREE_H
#define LEPTONICA_RBTREE_H
/*! The three valid key types for red-black trees, maps and sets. */
enum {
L_INT_TYPE = 1,
L_UINT_TYPE = 2,
L_FLOAT_TYPE = 3
};
/*!
* Storage for keys and values for red-black trees, maps and sets.
* <pre>
* Note:
* (1) Keys and values of the valid key types are all 64-bit
* (2) (void *) can be used for values but not for keys.
* </pre>
*/
union Rb_Type {
l_int64 itype;
l_uint64 utype;
l_float64 ftype;
void *ptype;
};
typedef union Rb_Type RB_TYPE;
struct L_Rbtree {
struct L_Rbtree_Node *root;
l_int32 keytype;
};
typedef struct L_Rbtree L_RBTREE;
typedef struct L_Rbtree L_AMAP; /* hide underlying implementation for map */
typedef struct L_Rbtree L_ASET; /* hide underlying implementation for set */
struct L_Rbtree_Node {
union Rb_Type key;
union Rb_Type value;
struct L_Rbtree_Node *left;
struct L_Rbtree_Node *right;
struct L_Rbtree_Node *parent;
l_int32 color;
};
typedef struct L_Rbtree_Node L_RBTREE_NODE;
typedef struct L_Rbtree_Node L_AMAP_NODE; /* hide tree implementation */
typedef struct L_Rbtree_Node L_ASET_NODE; /* hide tree implementation */
#endif /* LEPTONICA_RBTREE_H */
|