|
p4est
1.1
|
|
p4est
1.1
|
  p2est_quadrant_t | A 1D quadrant datatype: this is used to encode a "layer" of a column in the 2D+1D AMR scheme |
 p4est_balance_peer_t | |
| p4est_conn_face_info_t | |
| p4est_connectivity_t | This structure holds the 2D inter-tree connectivity information |
| p4est_corner_info_t | |
| p4est_corner_transform_t | |
| p4est_geometry_t | This structure can be filled or allocated by the user |
| p4est_ghost_t | Quadrants that neighbor the local domain |
| p4est_hang2_t | Store a hanging node that depends on two independent nodes |
| p4est_indep_t | Store an independent node |
| p4est_inspect_t | Data pertaining to selecting, inspecting, and profiling algorithms |
| p4est_iter_corner_args_t | |
| p4est_iter_corner_info_t | The information that is available to the user-defined p4est_iter_corner_t callback |
| p4est_iter_corner_side_t | Information about one side of a corner in the forest |
| p4est_iter_face_args_t | |
| p4est_iter_face_info_t | The information that is available to the user-defined p4est_iter_face_t callback |
| p4est_iter_face_side_t | Information 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_t | The information that is available to the user-defined p4est_iter_volume_t callback function |
| p4est_lnodes_buf_info_t | Buf_info: encodes/decodes the transmission of node information |
| p4est_lnodes_buffer_t | P4est_lnodes_buffer_t handles the communication of data associated with nodes |
| p4est_lnodes_data_t | |
| p4est_lnodes_dep_t | Dep: dependent quads and processes |
| p4est_lnodes_rank_t | The structure stored in the sharers array |
| p4est_lnodes_t | Store a parallel numbering of Lobatto points of a given degree > 0 |
| p4est_mesh_face_neighbor_t | This structure can be used as the status of a face neighbor iterator |
| p4est_mesh_t | This structure contains complete mesh information on the forest |
| p4est_nodes_t | This structure holds complete parallel node information |
| p4est_points_state_t | |
| p4est_quadrant_t | The 2D quadrant datatype |
| p4est_t | The p4est forest datatype |
| p4est_tree_t | The p4est tree datatype |
| p4est_wrap_leaf_t | |
| p4est_wrap_t | |
| p6est_coarsen_col_data_t | |
| p6est_connectivity_t | This structure holds the 2D+1D inter-tree connectivity information |
| p6est_ghost_t | Columns of layers that neighbor the local domain |
| p6est_init_data_t | |
| p6est_profile_t | |
| p6est_refine_col_data_t | |
| p6est_t | The p6est forest datatype |
| p6est_weight_column_t | |
| p8est_connectivity_t | This 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_t | This structure can be created by the user, p4est will never change its contents |
| p8est_ghost_t | Quadrants that neighbor the local domain |
| p8est_hang2_t | Store a hanging node that depends on two independent nodes |
| p8est_hang4_t | Store a hanging node that depends on four independent nodes |
| p8est_indep_t | Store an independent node |
| p8est_inspect_t | Data pertaining to selecting, inspecting, and profiling algorithms |
| p8est_iter_corner_info_t | The information that is availalbe to the user-defined p8est_iter_corner_t callback |
| p8est_iter_corner_side_t | |
| p8est_iter_edge_info_t | The information about all sides of an edge in the forest |
| p8est_iter_edge_side_t | |
| p8est_iter_face_info_t | The information that is available to the user-defined p8est_iter_face_t callback |
| p8est_iter_face_side_t | Information about one side of a face in the forest |
| p8est_iter_volume_info_t | The information that is available to the user-defined p8est_iter_volume_t callback function |
| p8est_lnodes_buffer_t | P8est_lnodes_buffer_t handles the communication of data associated with nodes |
| p8est_lnodes_rank_t | The structure stored in the sharers array |
| p8est_lnodes_t | Store a parallel numbering of Lobatto points of a given degree > 0 |
| p8est_mesh_face_neighbor_t | This structure can be used as the status of a face neighbor iterator |
| p8est_mesh_t | This structure contains complete mesh information on the forest |
| p8est_nodes_t | This structure holds complete parallel node information |
| p8est_quadrant_t | The 3D quadrant (i.e |
| p8est_t | The p8est forest datatype |
| p8est_tet_edge_info_t | |
| p8est_tet_face_info_t | |
| p8est_tets_t | |
| p8est_tree_t | The p8est tree datatype |
| p8est_wrap_leaf_t | |
| p8est_wrap_t | |
| sc_array_t | The sc_array object provides a large array of equal-size elements |
| sc_hash_array_data_t | |
| sc_hash_array_t | The sc_hash_array implements an array backed up by a hash table |
| sc_hash_t | The sc_hash implements a hash table |
| sc_link_t | The sc_link structure is one link of a linked list |
| sc_list_t | The sc_list object provides a linked list |
| sc_mempool_t | The sc_mempool object provides a large pool of equal-size elements |
| sc_recycle_array_t | The sc_recycle_array object provides an array of slots that can be reused |
| step3_ctx_t | The example parameters |
 step3_data_t | Per-quadrant data for this example |
1.8.6
