p4est
1.1
|
![]() ![]() | A 1D quadrant datatype: this is used to encode a "layer" of a column in the 2D+1D AMR scheme |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This structure holds the 2D inter-tree connectivity information |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This structure can be filled or allocated by the user |
![]() ![]() | Quadrants that neighbor the local domain |
![]() ![]() | Store a hanging node that depends on two independent nodes |
![]() ![]() | Store an independent node |
![]() ![]() | Data pertaining to selecting, inspecting, and profiling algorithms |
![]() ![]() | |
![]() ![]() | The information that is available to the user-defined p4est_iter_corner_t callback |
![]() ![]() | Information about one side of a corner in the forest |
![]() ![]() | |
![]() ![]() | The information that is available to the user-defined p4est_iter_face_t callback |
![]() ![]() | Information about one side of a face in the forest |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | The information that is available to the user-defined p4est_iter_volume_t callback function |
![]() ![]() | Buf_info: encodes/decodes the transmission of node information |
![]() ![]() | P4est_lnodes_buffer_t handles the communication of data associated with nodes |
![]() ![]() | |
![]() ![]() | Dep: dependent quads and processes |
![]() ![]() | The structure stored in the sharers array |
![]() ![]() | Store a parallel numbering of Lobatto points of a given degree > 0 |
![]() ![]() | This structure can be used as the status of a face neighbor iterator |
![]() ![]() | This structure contains complete mesh information on the forest |
![]() ![]() | This structure holds complete parallel node information |
![]() ![]() | |
![]() ![]() | The 2D quadrant datatype |
![]() ![]() | The p4est forest datatype |
![]() ![]() | The p4est tree datatype |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This structure holds the 2D+1D inter-tree connectivity information |
![]() ![]() | Columns of layers that neighbor the local domain |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | The p6est forest datatype |
![]() ![]() | |
![]() ![]() | This structure holds the 3D inter-tree connectivity information |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | This structure can be created by the user, p4est will never change its contents |
![]() ![]() | Quadrants that neighbor the local domain |
![]() ![]() | Store a hanging node that depends on two independent nodes |
![]() ![]() | Store a hanging node that depends on four independent nodes |
![]() ![]() | Store an independent node |
![]() ![]() | Data pertaining to selecting, inspecting, and profiling algorithms |
![]() ![]() | The information that is availalbe to the user-defined p8est_iter_corner_t callback |
![]() ![]() | |
![]() ![]() | The information about all sides of an edge in the forest |
![]() ![]() | |
![]() ![]() | The information that is available to the user-defined p8est_iter_face_t callback |
![]() ![]() | Information about one side of a face in the forest |
![]() ![]() | The information that is available to the user-defined p8est_iter_volume_t callback function |
![]() ![]() | P8est_lnodes_buffer_t handles the communication of data associated with nodes |
![]() ![]() | The structure stored in the sharers array |
![]() ![]() | Store a parallel numbering of Lobatto points of a given degree > 0 |
![]() ![]() | This structure can be used as the status of a face neighbor iterator |
![]() ![]() | This structure contains complete mesh information on the forest |
![]() ![]() | This structure holds complete parallel node information |
![]() ![]() | The 3D quadrant (i.e |
![]() ![]() | The p8est forest datatype |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | The p8est tree datatype |
![]() ![]() | |
![]() ![]() | |
![]() ![]() | The sc_array object provides a large array of equal-size elements |
![]() ![]() | |
![]() ![]() | The sc_hash_array implements an array backed up by a hash table |
![]() ![]() | The sc_hash implements a hash table |
![]() ![]() | The sc_link structure is one link of a linked list |
![]() ![]() | The sc_list object provides a linked list |
![]() ![]() | The sc_mempool object provides a large pool of equal-size elements |
![]() ![]() | The sc_recycle_array object provides an array of slots that can be reused |
![]() ![]() | The example parameters |
![]() ![]() | Per-quadrant data for this example |