t8  UNKNOWN
t8code is a C library to manage a forest of adaptive space-trees of general element classes in parallel.
t8_element_cxx.hxx
Go to the documentation of this file.
1 /*
2  This file is part of t8code.
3  t8code is a C library to manage a collection (a forest) of multiple
4  connected adaptive space-trees of general element classes in parallel.
5 
6  Copyright (C) 2015 the developers
7 
8  t8code is free software; you can redistribute it and/or modify
9  it under the terms of the GNU General Public License as published by
10  the Free Software Foundation; either version 2 of the License, or
11  (at your option) any later version.
12 
13  t8code is distributed in the hope that it will be useful,
14  but WITHOUT ANY WARRANTY; without even the implied warranty of
15  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16  GNU General Public License for more details.
17 
18  You should have received a copy of the GNU General Public License
19  along with t8code; if not, write to the Free Software Foundation, Inc.,
20  51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
21 */
22 
30 #ifndef T8_ELEMENT_CXX_HXX
31 #define T8_ELEMENT_CXX_HXX
32 
33 #include <sc_refcount.h>
34 #include <t8_eclass.h>
35 #include <t8_element.h>
36 
37 T8_EXTERN_C_BEGIN ();
38 
39 /* TODO: Implement a set of rules that have to hold between different eclass,
40  * i.e. lines must have a greater or equal maxlevel than quads and triangles.
41  * Check whether this rules are fulfilled in the construction of a scheme.
42  */
43 /* TODO: Implement a test that boundary and extrude leads to the original element. */
44 
47 {
49  protected:
50  size_t element_size;
51  void *ts_context;
53  public:
62  virtual ~t8_eclass_scheme ()
63  {
64  }
65 
73  virtual size_t
74  t8_element_size (void) const;
75 
80  virtual int
82  = 0;
83 
87  virtual int
88  t8_element_maxlevel (void) const
89  = 0;
90 
96  virtual t8_eclass_t
97  t8_element_child_eclass (int childid) const
98  = 0;
99 
104  virtual int
105  t8_element_level (const t8_element_t *elem) const
106  = 0;
107 
115  virtual void
116  t8_element_copy (const t8_element_t *source, t8_element_t *dest) const
117  = 0;
118 
126  virtual int
127  t8_element_compare (const t8_element_t *elem1, const t8_element_t *elem2) const
128  = 0;
129 
136  virtual int
137  t8_element_equal (const t8_element_t *elem1, const t8_element_t *elem2) const
138  = 0;
139 
152  virtual void
153  t8_element_parent (const t8_element_t *elem, t8_element_t *parent) const
154  = 0;
155 
162  virtual int
164  = 0;
165 
177  virtual void
178  t8_element_sibling (const t8_element_t *elem, int sibid, t8_element_t *sibling) const
179  = 0;
180 
185  virtual int
187  = 0;
188 
193  virtual int
194  t8_element_num_faces (const t8_element_t *elem) const
195  = 0;
196 
202  virtual int
204  = 0;
205 
210  virtual int
212  = 0;
213 
219  virtual int
220  t8_element_num_face_children (const t8_element_t *elem, int face) const
221  = 0;
222 
241  /* TODO: Prism order, Pyramid order. */
242  virtual int
243  t8_element_get_face_corner (const t8_element_t *element, int face, int corner) const
244  = 0;
245 
258  virtual int
259  t8_element_get_corner_face (const t8_element_t *element, int corner, int face) const
260  = 0;
261 
274  virtual void
275  t8_element_child (const t8_element_t *elem, int childid, t8_element_t *child) const
276  = 0;
277 
289  virtual void
290  t8_element_children (const t8_element_t *elem, int length, t8_element_t *c[]) const
291  = 0;
292 
297  virtual int
298  t8_element_child_id (const t8_element_t *elem) const
299  = 0;
300 
307  virtual int
308  t8_element_ancestor_id (const t8_element_t *elem, int level) const
309  = 0;
310 
317  virtual int
319  = 0;
320 
321  /* TODO: This could be problematic for pyramids, since elem1 and elem2
322  * could be of different classes. Would need two eclass_schemes as input */
333  virtual void
334  t8_element_nca (const t8_element_t *elem1, const t8_element_t *elem2, t8_element_t *nca) const
335  = 0;
336 
345  virtual t8_element_shape_t
346  t8_element_face_shape (const t8_element_t *elem, int face) const
347  = 0;
348 
363  virtual void
364  t8_element_children_at_face (const t8_element_t *elem, int face, t8_element_t *children[], int num_children,
365  int *child_indices) const
366  = 0;
367 
388  virtual int
389  t8_element_face_child_face (const t8_element_t *elem, int face, int face_child) const
390  = 0;
391 
402  virtual int
403  t8_element_face_parent_face (const t8_element_t *elem, int face) const
404  = 0;
405 
419  virtual int
420  t8_element_tree_face (const t8_element_t *elem, int face) const
421  = 0;
422 
444  virtual void
445  t8_element_transform_face (const t8_element_t *elem1, t8_element_t *elem2, int orientation, int sign,
446  int is_smaller_face) const
447  = 0;
448 
462  virtual int
463  t8_element_extrude_face (const t8_element_t *face, const t8_eclass_scheme_c *face_scheme, t8_element_t *elem,
464  int root_face) const
465  = 0;
466 
478  virtual void
479  t8_element_boundary_face (const t8_element_t *elem, int face, t8_element_t *boundary,
480  const t8_eclass_scheme_c *boundary_scheme) const
481  = 0;
482 
491  virtual void
492  t8_element_first_descendant_face (const t8_element_t *elem, int face, t8_element_t *first_desc, int level) const
493  = 0;
494 
503  virtual void
504  t8_element_last_descendant_face (const t8_element_t *elem, int face, t8_element_t *last_desc, int level) const
505  = 0;
506 
513  virtual int
514  t8_element_is_root_boundary (const t8_element_t *elem, int face) const
515  = 0;
516 
532  virtual int
533  t8_element_face_neighbor_inside (const t8_element_t *elem, t8_element_t *neigh, int face, int *neigh_face) const
534  = 0;
541  virtual t8_element_shape_t
542  t8_element_shape (const t8_element_t *elem) const
543  = 0;
544 
552  virtual void
554  = 0;
555 
562  virtual t8_linearidx_t
563  t8_element_get_linear_id (const t8_element_t *elem, int level) const
564  = 0;
565 
572  virtual void
573  t8_element_first_descendant (const t8_element_t *elem, t8_element_t *desc, int level) const
574  = 0;
575 
582  virtual void
583  t8_element_last_descendant (const t8_element_t *elem, t8_element_t *desc, int level) const
584  = 0;
585 
591  virtual void
592  t8_element_successor (const t8_element_t *t, t8_element_t *s, int level) const
593  = 0;
594 
602  virtual void
603  t8_element_vertex_reference_coords (const t8_element_t *t, const int vertex, double coords[]) const
604  = 0;
605 
616  virtual void
617  t8_element_reference_coords (const t8_element_t *elem, const double *ref_coords, const size_t num_coords,
618  double *out_coords) const
619  = 0;
620 
621  /* TODO: deactivate */
629  virtual t8_element_t *
630  t8_element_array_index (sc_array_t *array, size_t it) const;
631 
643  virtual t8_gloidx_t
644  t8_element_count_leafs (const t8_element_t *t, int level) const
645  = 0;
646 
655  virtual t8_gloidx_t
657  = 0;
658 
670  virtual void
671  t8_element_general_function (const t8_element_t *elem, const void *indata, void *outdata) const
672  = 0;
673 
674 #ifdef T8_ENABLE_DEBUG
691  virtual int
692  t8_element_is_valid (const t8_element_t *elem) const
693  = 0;
694 
702  virtual void
704  = 0;
705 
712  virtual void
713  t8_element_to_string (const t8_element_t *elem, char *debug_string, const int string_size) const
714  = 0;
715 #endif
716 
734  /* TODO: would it be better to directly allocate an array of elements,
735  * not element pointers? */
736  virtual void
737  t8_element_new (int length, t8_element_t **elem) const
738  = 0;
739 
757  virtual void
758  t8_element_init (int length, t8_element_t *elem, int called_new) const
759  = 0;
760 
768  virtual void
769  t8_element_destroy (int length, t8_element_t **elem) const
770  = 0;
771 };
772 
775 void
777 
778 T8_EXTERN_C_END ();
779 
780 #endif /* !T8_ELEMENT_CXX_HXX */
This struct holds virtual functions for a particular element class.
Definition: t8_element_cxx.hxx:47
virtual void t8_element_first_descendant_face(const t8_element_t *elem, int face, t8_element_t *first_desc, int level) const =0
Construct the first descendant of an element at a given level that touches a given face.
virtual int t8_element_num_face_children(const t8_element_t *elem, int face) const =0
Return the number of children of an element's face when the element is refined.
virtual void t8_element_transform_face(const t8_element_t *elem1, t8_element_t *elem2, int orientation, int sign, int is_smaller_face) const =0
Suppose we have two trees that share a common face f.
virtual void t8_element_last_descendant_face(const t8_element_t *elem, int face, t8_element_t *last_desc, int level) const =0
Construct the last descendant of an element at a given level that touches a given face.
virtual size_t t8_element_size(void) const
The virtual table for a particular implementation of an element class.
Definition: t8_element_cxx.cxx:48
virtual int t8_element_is_family(t8_element_t **fam) const =0
Query whether a given set of elements is a family or not.
t8_eclass_t eclass
The element class.
Definition: t8_element_cxx.hxx:54
virtual int t8_element_compare(const t8_element_t *elem1, const t8_element_t *elem2) const =0
Compare two elements.
virtual void t8_element_boundary_face(const t8_element_t *elem, int face, t8_element_t *boundary, const t8_eclass_scheme_c *boundary_scheme) const =0
Construct the boundary element at a specific face.
virtual int t8_element_child_id(const t8_element_t *elem) const =0
Compute the child id of an element.
virtual int t8_element_num_faces(const t8_element_t *elem) const =0
Compute the number of faces of a given element.
virtual void t8_element_destroy(int length, t8_element_t **elem) const =0
Deallocate an array of elements.
virtual t8_eclass_t t8_element_child_eclass(int childid) const =0
Return the type of each child in the ordering of the implementation.
virtual t8_element_shape_t t8_element_face_shape(const t8_element_t *elem, int face) const =0
Compute the shape of the face of an element.
virtual int t8_element_equal(const t8_element_t *elem1, const t8_element_t *elem2) const =0
Check if two elements are equal.
virtual int t8_element_level(const t8_element_t *elem) const =0
Return the level of a particular element.
virtual int t8_element_num_children(const t8_element_t *elem) const =0
Return the number of children of an element when it is refined.
virtual int t8_element_face_parent_face(const t8_element_t *elem, int face) const =0
Given a face of an element return the face number of the parent of the element that matches the eleme...
virtual int t8_element_extrude_face(const t8_element_t *face, const t8_eclass_scheme_c *face_scheme, t8_element_t *elem, int root_face) const =0
Given a boundary face inside a root tree's face construct the element inside the root tree that has t...
virtual t8_gloidx_t t8_element_count_leafs_from_root(int level) const =0
Count how many leaf descendants of a given uniform level the root element will produce.
virtual int t8_element_refines_irregular(void) const =0
Returns true, if there is one element in the tree, that does not refine into 2^dim children.
size_t element_size
This scheme defines the operations for a particular element class.
Definition: t8_element_cxx.hxx:50
virtual int t8_element_is_valid(const t8_element_t *elem) const =0
Query whether a given element can be considered as 'valid' and it is safe to perform any of the above...
virtual void t8_element_children_at_face(const t8_element_t *elem, int face, t8_element_t *children[], int num_children, int *child_indices) const =0
Given an element and a face of the element, compute all children of the element that touch the face.
virtual t8_element_t * t8_element_array_index(sc_array_t *array, size_t it) const
Return a pointer to a t8_element in an array indexed by a size_t.
Definition: t8_element_cxx.cxx:55
virtual void t8_element_children(const t8_element_t *elem, int length, t8_element_t *c[]) const =0
Construct all children of a given element.
virtual void t8_element_first_descendant(const t8_element_t *elem, t8_element_t *desc, int level) const =0
Compute the first descendant of a given element.
virtual int t8_element_maxlevel(void) const =0
Return the maximum allowed level for any element of a given class.
virtual void t8_element_last_descendant(const t8_element_t *elem, t8_element_t *desc, int level) const =0
Compute the last descendant of a given element.
virtual void t8_element_set_linear_id(t8_element_t *elem, int level, t8_linearidx_t id) const =0
Initialize the entries of an allocated element according to a given linear id in a uniform refinement...
virtual int t8_element_get_corner_face(const t8_element_t *element, int corner, int face) const =0
Return the face numbers of the faces sharing an element's corner.
virtual void t8_element_successor(const t8_element_t *t, t8_element_t *s, int level) const =0
Construct the successor in a uniform refinement of a given element.
virtual int t8_element_max_num_faces(const t8_element_t *elem) const =0
Compute the maximum number of faces of a given element and all of its descendants.
virtual void t8_element_general_function(const t8_element_t *elem, const void *indata, void *outdata) const =0
This function has no defined effect but each implementation is free to provide its own meaning of it.
virtual int t8_element_get_face_corner(const t8_element_t *element, int face, int corner) const =0
Return the corner number of an element's face corner.
virtual int t8_element_ancestor_id(const t8_element_t *elem, int level) const =0
Compute the ancestor id of an element, that is the child id at a given level.
virtual void t8_element_child(const t8_element_t *elem, int childid, t8_element_t *child) const =0
Construct the child element of a given number.
virtual int t8_element_num_corners(const t8_element_t *elem) const =0
Compute the number of corners of a given element.
virtual void t8_element_parent(const t8_element_t *elem, t8_element_t *parent) const =0
Compute the parent of a given element elem and store it in parent.
virtual void t8_element_to_string(const t8_element_t *elem, char *debug_string, const int string_size) const =0
Fill a string with readable information about the element.
void * ts_context
Anonymous implementation context.
Definition: t8_element_cxx.hxx:51
virtual void t8_element_init(int length, t8_element_t *elem, int called_new) const =0
Initialize an array of allocated elements.
virtual int t8_element_face_child_face(const t8_element_t *elem, int face, int face_child) const =0
Given a face of an element and a child number of a child of that face, return the face number of the ...
virtual ~t8_eclass_scheme()
The destructor.
Definition: t8_element_cxx.hxx:62
virtual t8_element_shape_t t8_element_shape(const t8_element_t *elem) const =0
Return the shape of an allocated element according its type.
virtual int t8_element_num_siblings(const t8_element_t *elem) const =0
Compute the number of siblings of an element.
virtual t8_gloidx_t t8_element_count_leafs(const t8_element_t *t, int level) const =0
Count how many leaf descendants of a given uniform level an element would produce.
virtual void t8_element_sibling(const t8_element_t *elem, int sibid, t8_element_t *sibling) const =0
Compute a specific sibling of a given element elem and store it in sibling.
virtual void t8_element_copy(const t8_element_t *source, t8_element_t *dest) const =0
Copy all entries of source to dest.
virtual void t8_element_vertex_reference_coords(const t8_element_t *t, const int vertex, double coords[]) const =0
Compute the coordinates of a given element vertex inside a reference tree that is embedded into [0,...
virtual void t8_element_debug_print(const t8_element_t *elem) const =0
Print a given element.
virtual t8_linearidx_t t8_element_get_linear_id(const t8_element_t *elem, int level) const =0
Compute the linear id of a given element in a hypothetical uniform refinement of a given level.
virtual int t8_element_face_neighbor_inside(const t8_element_t *elem, t8_element_t *neigh, int face, int *neigh_face) const =0
Construct the face neighbor of a given element if this face neighbor is inside the root tree.
virtual void t8_element_reference_coords(const t8_element_t *elem, const double *ref_coords, const size_t num_coords, double *out_coords) const =0
Convert points in the reference space of an element to points in the reference space of the tree.
virtual void t8_element_new(int length, t8_element_t **elem) const =0
Allocate memory for an array of elements of a given class and initialize them.
virtual int t8_element_is_root_boundary(const t8_element_t *elem, int face) const =0
Compute whether a given element shares a given face with its root tree.
virtual int t8_element_tree_face(const t8_element_t *elem, int face) const =0
Given an element and a face of this element.
virtual void t8_element_nca(const t8_element_t *elem1, const t8_element_t *elem2, t8_element_t *nca) const =0
Compute the nearest common ancestor of two elements.
The scheme holds implementations for one or more element classes.
Definition: t8_element.h:51
int64_t t8_gloidx_t
A type for global indexing that holds really big numbers.
Definition: t8.h:98
uint64_t t8_linearidx_t
A type for storing SFC indices.
Definition: t8.h:107
We define all possible element classes that occur in hybrid meshes.
enum t8_eclass t8_eclass_t
This enumeration contains all possible element classes.
This file defines basic operations on an element in a refinement tree.
struct t8_element t8_element_t
Opaque structure for a generic element, only used as pointer.
Definition: t8_element.h:42
void t8_scheme_cxx_destroy(t8_scheme_cxx_t *s)
Destroy an implementation of a particular element class.
Definition: t8_element_cxx.cxx:31
t8_eclass_t t8_element_shape_t
Type definition for the geometric shape of an element.
Definition: t8_element_shape.h:38