p8est_search.h

Go to the documentation of this file.

/*
  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
  Additional copyright (C) 2011 individual authors
  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 P8EST_SEARCH_H
#define P8EST_SEARCH_H
 
#include <p8est.h>
 
SC_EXTERN_C_BEGIN;
 
void                p8est_find_partition (const int num_procs,
                                          p4est_gloidx_t * search_in,
                                          p4est_gloidx_t my_begin,
                                          p4est_gloidx_t my_end,
                                          p4est_gloidx_t * begin,
                                          p4est_gloidx_t * end);
 
ssize_t             p8est_find_lower_bound (sc_array_t * array,
                                            const p8est_quadrant_t * q,
                                            size_t guess);
 
ssize_t             p8est_find_higher_bound (sc_array_t * array,
                                             const p8est_quadrant_t * q,
                                             size_t guess);
 
p8est_quadrant_t   *p8est_find_quadrant_cumulative (p8est_t * p8est,
                                                    p4est_locidx_t
                                                    cumulative_id,
                                                    p4est_topidx_t *
                                                    which_tree,
                                                    p4est_locidx_t *
                                                    quadrant_id);
 
void                p8est_split_array (sc_array_t * array, int level,
                                       size_t indices[]);
 
int32_t             p8est_find_range_boundaries (p8est_quadrant_t * lq,
                                                 p8est_quadrant_t * uq,
                                                 int level, int faces[],
                                                 int edges[], int corners[]);
 
typedef int         (*p8est_search_local_t) (p8est_t * p4est,
                                             p4est_topidx_t which_tree,
                                             p8est_quadrant_t * quadrant,
                                             p4est_locidx_t local_num,
                                             void *point);
 
typedef p8est_search_local_t p8est_search_query_t;
 
void                p8est_search_local (p8est_t * p4est, int call_post,
                                        p8est_search_local_t quadrant_fn,
                                        p8est_search_local_t point_fn,
                                        sc_array_t * points);
 
void                p8est_search (p8est_t * p4est,
                                  p8est_search_query_t quadrant_fn,
                                  p8est_search_query_t point_fn,
                                  sc_array_t * points);
 
typedef int         (*p8est_search_reorder_t) (p8est_t * p4est,
                                               sc_array_t * quadrants,
                                               sc_array_t * indices);
 
void                p8est_search_reorder (p8est_t * p4est,
                                          int skip_levels,
                                          p8est_search_reorder_t reorder_fn,
                                          p8est_search_local_t
                                          pre_quadrant_fn,
                                          p8est_search_local_t
                                          post_quadrant_fn,
                                          p8est_search_local_t point_fn,
                                          sc_array_t * points);
 
typedef int         (*p8est_search_partition_t) (p8est_t * p4est,
                                                 p4est_topidx_t which_tree,
                                                 p8est_quadrant_t * quadrant,
                                                 int pfirst, int plast,
                                                 void *point);
 
void                p8est_search_partition (p8est_t *p4est, int call_post,
                                            p8est_search_partition_t
                                            quadrant_fn,
                                            p8est_search_partition_t point_fn,
                                            sc_array_t *points);
 
void                p8est_search_partition_gfx
  (const p4est_gloidx_t *gfq, const p8est_quadrant_t *gfp,
   int nmemb, p4est_topidx_t num_trees, int call_post, void *user,
   p8est_search_partition_t quadrant_fn, p8est_search_partition_t point_fn,
   sc_array_t *points);
 
void                p8est_search_partition_gfp
  (const p8est_quadrant_t *gfp, int nmemb, p4est_topidx_t num_trees,
   int call_post, void *user, p8est_search_partition_t quadrant_fn,
   p8est_search_partition_t point_fn, sc_array_t *points);
 
typedef int         (*p8est_search_all_t) (p8est_t * p4est,
                                           p4est_topidx_t which_tree,
                                           p8est_quadrant_t * quadrant,
                                           int pfirst, int plast,
                                           p4est_locidx_t local_num,
                                           void *point);
 
void                p8est_search_all (p8est_t * p4est, int call_post,
                                      p8est_search_all_t quadrant_fn,
                                      p8est_search_all_t point_fn,
                                      sc_array_t * points);
 
SC_EXTERN_C_END;
 
#endif /* !P8EST_SEARCH_H */