t8_dprism_bits.h

Go to the documentation of this file.

/*
  This file is part of t8code.
  t8code is a C library to manage a collection (a forest) of multiple
  connected adaptive space-trees of general element classes in parallel.
 
  Copyright (C) 2015 the developers
 
  t8code 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.
 
  t8code 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 t8code; if not, write to the Free Software Foundation, Inc.,
  51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
 
#ifndef T8_DPRISM_BITS_H
#define T8_DPRISM_BITS_H
 
#include <t8_element.h>
#include <t8_schemes/t8_default/t8_default_prism/t8_dprism.h>
 
T8_EXTERN_C_BEGIN ();
 
extern int t8_dprism_face_corners[5][4];
 
int
t8_dprism_get_level (const t8_dprism_t *p);
 
void
t8_dprism_copy (const t8_dprism_t *p, t8_dprism_t *dest);
 
int
t8_dprism_compare (const t8_dprism_t *p1, const t8_dprism_t *p2);
 
int
t8_dprism_equal (const t8_dprism_t *elem1, const t8_dprism_t *elem2);
 
void
t8_dprism_init_linear_id (t8_dprism_t *p, int level, t8_linearidx_t id);
 
void
t8_dprism_successor (const t8_dprism_t *p, t8_dprism_t *succ, int level);
 
void
t8_dprism_parent (const t8_dprism_t *p, t8_dprism_t *parent);
 
void
t8_dprism_first_descendant (const t8_dprism_t *p, t8_dprism_t *desc, int level);
int
t8_dprism_child_id (const t8_dprism_t *p);
 
int
t8_dprism_is_familypv (t8_dprism_t **fam);
 
void
t8_dprism_nearest_common_ancestor (const t8_dprism_t *p1, const t8_dprism_t *p2, t8_dprism_t *r);
 
void
t8_dprism_boundary_face (const t8_dprism_t *p, int face, t8_element_t *boundary);
 
int
t8_dprism_is_root_boundary (const t8_dprism_t *p, int face);
 
int
t8_dprism_is_inside_root (t8_dprism_t *p);
 
void
t8_dprism_child (const t8_dprism_t *p, int childid, t8_dprism_t *child);
 
t8_element_shape_t
t8_dprism_face_shape (const t8_dprism_t *p, int face);
 
int
t8_dprism_num_face_children (const t8_dprism_t *p, int face);
 
int
t8_dprism_face_neighbour (const t8_dprism_t *p, int face, t8_dprism_t *neigh);
 
int
t8_dprism_get_face_corner (const t8_dprism_t *p, int face, int corner);
 
void
t8_dprism_childrenpv (const t8_dprism_t *p, int length, t8_dprism_t *c[]);
 
int
t8_dprism_ancestor_id (t8_dprism_t *p, int level);
 
void
t8_dprism_children_at_face (const t8_dprism_t *p, int face, t8_dprism_t **children, int num_children,
                            int *child_indices);
 
int
t8_dprism_face_child_face (const t8_dprism_t *elem, int face, int face_child);
 
int
t8_dprism_face_parent_face (const t8_dprism_t *prism, int face);
 
int
t8_dprism_tree_face (const t8_dprism_t *p, int face);
 
void
t8_dprism_extrude_face (const t8_element_t *face, t8_element_t *elem, const int root_face);
 
void
t8_dprism_last_descendant (const t8_dprism_t *p, t8_dprism_t *s, int level);
 
void
t8_dprism_corner_descendant (const t8_dprism_t *p, t8_dprism_t *s, int corner, int level);
 
void
t8_dprism_vertex_integer_coords (const t8_dprism_t *elem, int vertex, int coords[3]);
 
void
t8_dprism_vertex_ref_coords (const t8_dprism_t *elem, int vertex, double coords[3]);
 
void
t8_dprism_compute_reference_coords (const t8_dprism_t *elem, const double *ref_coords, const size_t num_coords,
                                    double *out_coords);
 
t8_linearidx_t
t8_dprism_linear_id (const t8_dprism_t *p, int level);
 
int
t8_dprism_is_valid (const t8_dprism_t *p);
 
T8_EXTERN_C_END ();
 
#endif /* T8_DPRISM_BITS_H */