/usr/include/p4est_search.h is in libp4est-dev 1.1-4.
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 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 | /*
This file is part of p4est.
p4est is a C library to manage a collection (a forest) of multiple
connected adaptive quadtrees or octrees in parallel.
Copyright (C) 2010 The University of Texas System
Written by Carsten Burstedde, Lucas C. Wilcox, and Tobin Isaac
p4est is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
p4est is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with p4est; if not, write to the Free Software Foundation, Inc.,
51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef P4EST_SEARCH_H
#define P4EST_SEARCH_H
#include <p4est.h>
SC_EXTERN_C_BEGIN;
/** Find the lowest position tq in a quadrant array such that tq >= q.
* \return Returns the id of the matching quadrant
* or -1 if array < q or the array is empty.
*/
ssize_t p4est_find_lower_bound (sc_array_t * array,
const p4est_quadrant_t * q,
size_t guess);
/** Find the highest position tq in a quadrant array such that tq <= q.
* \return Returns the id of the matching quadrant
* or -1 if array > q or the array is empty.
*/
ssize_t p4est_find_higher_bound (sc_array_t * array,
const p4est_quadrant_t * q,
size_t guess);
/** Given a sorted \a array of quadrants that have a common ancestor at level
* \a level, compute the \a indices of the first quadrant in each of the common
* ancestor's children at level \a level + 1;
* \param [in] array The sorted array of quadrants of level > \a level.
* \param [in] level The level at which there is a common ancestor.
* \param [in,out] indices The indices of the first quadrant in each of
* the ancestors's children, plus an additional
* index on the end. The quadrants of \a array
* that are descendants of child i have indices
* between indices[i] and indices[i + 1] - 1. If
* indices[i] = indices[i+1], this indicates that
* no quadrant in the array is contained in
* child i.
*/
void p4est_split_array (sc_array_t * array, int level,
size_t indices[]);
/** Given two smallest quadrants, \a lq and \a uq, that mark the first and the
* last quadrant in a range of quadrants, determine which portions of the tree
* boundary the range touches.
* \param [in] lq The smallest quadrant at the start of the range: if
* NULL, the tree's first quadrant is taken to be the
* start of the range.
* \param [in] uq The smallest quadrant at the end of the range: if
* NULL, the tree's last quadrant is taken to be the
* end of the range.
* \param [in] level The level of the containing quadrant whose boundaries
* are tested: 0 if we want to test the boundaries of the
* whole tree.
* \param [in/out] faces An array of size 4 that is filled: faces[i] is
* true if the range touches that face.
* \param [in/out] corners An array of size 4 that is filled: corners[i] is
* true if the range touches that corner.
* \faces or \corners may be NULL.
* \return Returns an int32_t encoded with the same information in \faces and
* \corners: the first (least) four bits represent the four faces,
* the next four bits represent the four corners.
*/
int32_t p4est_find_range_boundaries (p4est_quadrant_t * lq,
p4est_quadrant_t * uq,
int level, int faces[],
int corners[]);
/** Callback function to query the match of a "point" with a quadrant.
*
* This function can be called in two roles: Per-quadrant, in which case the
* parameter \a point is NULL, or per-point, possibly many times per quadrant.
*
* \param [in] p4est The forest to be queried.
* \param [in] which_tree The tree id under consideration.
* \param [in] quadrant The quadrant under consideration.
* This quadrant may be coarser than the quadrants
* that are contained in the forest (an ancestor), in
* which case it is a temporary variable and not part
* of the forest storage. Otherwise, it is a leaf and
* points directly into the forest storage.
* \param [in] local_num If the quadrant is not a leaf, this is -1. Otherwise
* it is the (non-negative) index of the quadrant
* relative to the processor-local quadrant storage.
* \param [in] point Representation of a "point"; user-defined.
* If \a point is NULL, the callback may be used to
* prepare quadrant-related search meta data.
* \return If \a point is NULL, true if the search confined to
* \a quadrant should be executed, false to skip it.
* Else, true if point may be contained in the
* quadrant and false otherwise; the return value has
* no effect on a leaf.
*/
typedef int (*p4est_search_query_t) (p4est_t * p4est,
p4est_topidx_t which_tree,
p4est_quadrant_t * quadrant,
p4est_locidx_t local_num,
void *point);
/** Search "points" from a given set in the forest.
*
* The search runs over all local quadrants and proceeds recursively top-down.
* Its outer loop is thus a depth-first, processor-local forest traversal.
* Each quadrant in that loop either is a leaf, or a (direct or indirect)
* strict ancestor of a leaf. On entering a new quadrant, a user-provided
* quadrant-callback is executed.
* The set of points that potentially matches a given quadrant diminishes from
* the root down to the leaves: For each quadrant, an inner loop over the
* potentially matching points executes a point-callback for each candidate
* that determines whether the point may be a match. If not, it is discarded
* immediately, otherwise it is passed to the next finer level.
* The callback is allowed to return true for the same point and more than one
* quadrant; in this case more than one matching quadrant may be identified.
* The callback is also allowed to return false for all children of a quadrant
* that it returned true for earlier.
* The points can really be anything, p4est does not perform any
* interpretation, just passes the pointer along to the callback function.
*
* \param [in] p4est The forest to be searched.
* \param [in] search_quadrant_fn Executed once for each quadrant that is
* entered. This quadrant is always local. If the
* callback returns false, this quadrant and its
* descendants are excluded from the search.
* May be NULL in which case it is ignored.
* \param [in] search_point_fn Must return true for a possible match.
* \param [in] points User-defined array of "points".
*/
void p4est_search (p4est_t * p4est,
p4est_search_query_t search_quadrant_fn,
p4est_search_query_t search_point_fn,
sc_array_t * points);
SC_EXTERN_C_END;
#endif
|