p4est  1.0
Data Structures
Here are the data structures with brief descriptions:
int32link_tInt32link_t: linked list entry recording processor ids
octor_neighbor_tOctor_neighbor_t:
octor_neighborhood_t
p4est_balance_peer_t
p4est_conn_face_info_t
p4est_connectivity_tThis structure holds the 2D inter-tree connectivity information
p4est_corner_info_t
p4est_corner_transform_t
p4est_geometry_tThis structure can be created by the user, p4est will never change its contents
p4est_ghost_mirror_tData structure that contains temporary mirror information
p4est_ghost_tQuadrants that neighbor the local domain
p4est_hang2_t::p4est_hang2_data
p4est_hang2_tStore a hanging node that depends on two independent nodes
p4est_indep_t::p4est_indep_data
p8est_indep_t::p4est_indep_data
p4est_indep_tStore an independent node
p4est_inspect_tData pertaining to selecting, inspecting, and profiling algorithms
p4est_iter_corner_args_t
p4est_iter_corner_info_tThe information that is availalbe to the user-defined p4est_iter_corner_t callback
p4est_iter_corner_side_tInformation about one side of a corner in the forest
p4est_iter_face_args_t
p4est_iter_face_info_tThe information that is available to the user-defined p4est_iter_face_t callback
p4est_iter_face_side_t::p4est_iter_face_side_data
p4est_iter_face_side_tInformation about one side of a face in the forest
p4est_iter_loop_args_t
p4est_iter_tier_ring_t
p4est_iter_tier_t
p4est_iter_volume_args_t
p4est_iter_volume_info_tThe information that is available to the user-defined p4est_iter_volume_t callback function
p4est_lnodes_buf_info_tBuf_info: encodes/decodes the transmission of node information
p4est_lnodes_buffer_tP4est_lnodes_buffer_t handles the communication of data associated with nodes
p4est_lnodes_data_t
p4est_lnodes_dep_tDep: dependent quads and processes
p4est_lnodes_rank_tThe structure stored in the sharers array
p4est_lnodes_tStore a parallel numbering of Lobatto points of a given degree > 0
p4est_mesh_face_neighbor_tThis structure can be used as the status of a face neighbor iterator
p4est_mesh_tThis structure contains complete mesh information on the forest
p4est_node_peer_t
p4est_nodes_tThis structure holds complete parallel node information
p4est_points_state_t
p4est_quadrant_t::p4est_quadrant_data
p4est_quadrant_tThe 2D quadrant datatype
p4est_tThe p4est forest datatype
p4est_tree_tThe p4est tree datatype
p4est_wrap_leaf_t
p4est_wrap_t
p8est_connectivity_tThis structure holds the 3D inter-tree connectivity information
p8est_corner_info_t
p8est_corner_transform_t
p8est_edge_info_t
p8est_edge_transform_t
p8est_geometry_builtin_shell_t
p8est_geometry_builtin_sphere_t
p8est_geometry_builtin_t
p8est_geometry_tThis structure can be created by the user, p4est will never change its contents
p8est_ghost_tQuadrants that neighbor the local domain
p8est_hang2_t::p8est_hang2_data
p8est_hang2_tStore a hanging node that depends on two independent nodes
p8est_hang4_t::p8est_hang4_data
p8est_hang4_tStore a hanging node that depends on four independent nodes
p8est_indep_tStore an independent node
p8est_inspect_tData pertaining to selecting, inspecting, and profiling algorithms
p8est_iter_corner_info_tThe information that is availalbe to the user-defined p8est_iter_corner_t callback
p8est_iter_corner_side_t
p8est_iter_edge_info_tThe information about all sides of an edge in the forest
p8est_iter_edge_side_t::p8est_iter_edge_side_data
p8est_iter_edge_side_t
p8est_iter_face_info_tThe information that is available to the user-defined p8est_iter_face_t callback
p8est_iter_face_side_t::p8est_iter_face_side_data
p8est_iter_face_side_tInformation about one side of a face in the forest
p8est_iter_volume_info_tThe information that is available to the user-defined p8est_iter_volume_t callback function
p8est_lnodes_buffer_tP8est_lnodes_buffer_t handles the communication of data associated with nodes
p8est_lnodes_rank_tThe structure stored in the sharers array
p8est_lnodes_tStore a parallel numbering of Lobatto points of a given degree > 0
p8est_mesh_face_neighbor_tThis structure can be used as the status of a face neighbor iterator
p8est_mesh_tThis structure contains complete mesh information on the forest
p8est_nodes_tThis structure holds complete parallel node information
p8est_quadrant_t::p8est_quadrant_data
p8est_quadrant_tThe 3D quadrant (i.e
p8est_tThe p8est forest datatype
p8est_tet_edge_info_t
p8est_tet_face_info_t
p8est_tets_t
p8est_tree_tThe p8est tree datatype
p8est_wrap_leaf_t
p8est_wrap_t
phantom_elem_t
point_t
step3_ctx_tThe example parameters
step3_data_tPer-quadrant data for this example
trilinear_anode_tTrilinear_anode_t: anchored node (associated with free variables)
trilinear_dnode_t
trilinear_elem_t
trilinear_element_info2_tTrilinear_element_info2: a structure precomputed after mesh extraction
trilinear_mesh_extra_t
trilinear_mesh_tTrilinear_mesh_t: main mesh structure used in Rhea
trilinear_node_t
 All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Defines