Here is a list of all documented files with brief descriptions:

[detail level 12]

▼ src
p4est.h	The top-level 2D p4est interface
p4est_algorithms.h	Routines for managing quadrants as elements of trees and subtrees
p4est_balance.h
p4est_base.h	General support types and functions
p4est_bits.h	Routines for manipulating quadrants (neighbors, parents, children, etc.)
p4est_build.h	Create a new p4est object by adding individual quadrants in order
p4est_communication.h
p4est_connectivity.h	The connectivity defines the coarse topology of the forest
p4est_empty.h
p4est_extended.h	Interface routines with extended capabilities
p4est_geometry.h	Transform from tree-local "reference" coordinate system to global "physical space" coordinates
p4est_ghost.h	Passing quadrants and data to neighboring processes
p4est_io.h	Provide functions to serialize/deserialize a forest
p4est_iterate.h	Iteration over mesh topology via callbacks
p4est_lnodes.h
p4est_mesh.h	Forest topology in a conventional mesh format
p4est_nodes.h
p4est_plex.h
p4est_points.h
p4est_search.h	Search through quadrants, the local part of a forest, or the partition
p4est_to_p8est.h
p4est_to_p8est_empty.h
p4est_vtk.h	Routines for printing a forest and associated fields to VTK format
p4est_wrap.h	The logic in p4est_wrap encapsulates core p4est data structures and provides functions that clarify the mark-adapt-partition cycle
p6est.h	A hybrid 2D+1D AMR extension
p6est_communication.h	MPI_Comm management
p6est_empty.h
p6est_extended.h	Interface routines with extended capabilities
p6est_ghost.h	Passing columns of layers and data to neighboring processes
p6est_lnodes.h
p6est_profile.h
p6est_vtk.h
p8est.h	The top-level 3D p8est interface
p8est_algorithms.h	Routines for managing quadrants as elements of trees and subtrees
p8est_balance.h
p8est_bits.h	Routines for manipulating quadrants (neighbors, parents, children, etc.)
p8est_build.h	Create a new p8est object by adding individual quadrants in order
p8est_communication.h
p8est_connectivity.h	The connectivity defines the coarse topology of the forest
p8est_empty.h
p8est_extended.h	Interface routines with extended capabilities
p8est_geometry.h	Transform from tree-local "reference" coordinate system to global "physical space" coordinates
p8est_ghost.h	Passing quadrants and data to neighboring processes
p8est_io.h	Provide functions to serialize/deserialize a forest
p8est_iterate.h	Iteration over mesh topology via callbacks
p8est_lnodes.h
p8est_mesh.h	Forest topology in a conventional mesh format
p8est_nodes.h
p8est_plex.h
p8est_points.h
p8est_search.h	Search through quadrants, the local part of a forest, or the partition
p8est_tets_hexes.h
p8est_vtk.h	Routines for printing a forest and associated fields to VTK format
p8est_wrap.h	The logic in p8est_wrap encapsulates core p4est data structures and provides functions that clarify the mark-adapt-partition cycle