fix typos

Author: lenaploetzke

example/IO/forest/netcdf/t8_write_forest_netcdf.cxx

@@ -54,13 +54,13 @@ T8_EXTERN_C_BEGIN ();
 */
 struct t8_example_netcdf_adapt_data
 {
-  t8_3D_point midpoint;             /* Midpoint of a aphere */
+  t8_3D_point midpoint;             /* Midpoint of a sphere */
   double refine_if_inside_radius;   /* refine all elements inside this radius from the sphere's midpoint */
   double coarsen_if_outside_radius; /* coarsen all element families outside of this radius from the sphere's midpoint */
 };
 
 /** This functions describe an adapt_function, an adapt_function describes the refinement/coarsening rules for a forest
-* \note If an element is inside a given radius from the midpoint of the hypercube, this element is refined. If a family of elements is outiside a given radius from the midpoint of the hypercube, it is coarsened. 
+* \note If an element is inside a given radius from the midpoint of the hypercube, this element is refined. If a family of elements is outside a given radius from the midpoint of the hypercube, it is coarsened. 
 * \note A detailed description of the adaption process is found in step 3 of the tutorial located in 't8code/example/tutorials'.
 */
 int
@@ -109,7 +109,7 @@ t8_example_netcdf_adapt (t8_forest_t forest)
 {
   t8_forest_t forest_adapt;
 
-  /* The adapt data which controls which elements will be refined or corsened based on the given radii */
+  /* The adapt data which controls which elements will be refined or coarsened based on the given radii */
   struct t8_example_netcdf_adapt_data adapt_data = {
     t8_3D_point ({ 0.5, 0.5, 0.5 }), /* Midpoints of the sphere. */
     0.2,                             /* Refine if inside this radius. */
@@ -195,7 +195,7 @@ t8_example_compare_performance_netcdf_var_properties (sc_MPI_Comm comm, int fore
   /* Construct a 3D hybrid hypercube as a cmesh */
   cmesh = t8_cmesh_new_hypercube_hybrid (comm, 1, 0);
 
-  /* Build a (partioined) uniform forest */
+  /* Build a (partitioned) uniform forest */
   forest = t8_forest_new_uniform (cmesh, default_scheme, forest_refinement_level, 0, comm);
 
   /* If the adapt_forest flag is set, the forest will be adapted */
@@ -343,12 +343,12 @@ t8_example_netcdf_write_forest (sc_MPI_Comm comm, int forest_refinement_level, i
 
   t8_global_productionf ("New cmesh was created\n");
 
-  /* Build a (partioined) uniform forest */
+  /* Build a (partitioned) uniform forest */
   forest = t8_forest_new_uniform (cmesh, default_scheme, level, 0, comm);
 
   t8_global_productionf ("New forest was created\n");
 
-  /* Eventually, adapt the forest (based on the flag aadapt_forest) */
+  /* Eventually, adapt the forest (based on the flag adapt_forest) */
   if (adapt_forest) {
     /** \note The forest is not repartitioned after the adapt-step.
    * Therefore, the workload may not be evenly distributed among the processes.

example/advect/t8_advection.cxx

@@ -114,7 +114,7 @@ typedef struct
    * element as well and is communicated with other processes in ghost_exchange. */
   sc_array_t *phi_values; /**< For each element and ghost its phi value. */
   sc_array_t
-    *phi_values_adapt; /**< phi values for the adapted forest, used during adaptaption to interpolate values. */
+    *phi_values_adapt; /**< phi values for the adapted forest, used during adaptation to interpolate values. */
   sc_MPI_Comm comm;    /**< MPI communicator used */
   sc_statinfo_t stats[ADVECT_NUM_STATS]; /**< Runtimes and other statistics. */
   double t;                              /**< Current simulation time */
@@ -142,7 +142,7 @@ typedef struct
   t8_3D_point midpoint;           /**< coordinates of element midpoint in R^3 */
   double vol;                     /**< Volume of this element */
   double phi_new;                 /**< Value of solution at midpoint in next time step */
-  double *fluxes[MAX_FACES];      /**< The fluxes to each neeighbor at a given face */
+  double *fluxes[MAX_FACES];      /**< The fluxes to each neighbor at a given face */
   int flux_valid[MAX_FACES];      /**< If > 0, this flux was computed, if 0 memory was allocated
                                                    for this flux, but not computed. If < 0, no memory was allocated. */
   int level;                      /**< The refinement level of the element. */
@@ -343,7 +343,7 @@ t8_advect_flux_upwind_1d (const t8_advect_problem_t *problem, const t8_locidx_t
   }
   /* Compute u at the interval boundary. */
   problem->u (x_j_half, problem->t, u_at_x_j_half);
-  /* In 1D we are only interested in the firs coordinate of u */
+  /* In 1D we are only interested in the first coordinate of u */
 
   sign = face == 0 ? -1 : 1;
   if (sign * u_at_x_j_half[0] >= 0) {
@@ -929,7 +929,7 @@ t8_advect_problem_init (t8_cmesh_t cmesh, t8_flow_function_3d_fn u, t8_example_l
   problem->num_time_steps = 0;            /* current time step */
   problem->comm = comm;                   /* MPI communicator */
   problem->vtk_count = 0;                 /* number of pvtu files written */
-  problem->band_width = band_width;       /* width of the refinemen band around 0 level-set */
+  problem->band_width = band_width;       /* width of the refinement band around 0 level-set */
   problem->dim = dim;                     /* dimension of the mesh */
   problem->dummy_op = dummy_op;           /* If true, emulate more computational load per element */
 

src/t8_forest/t8_forest_general.h

@@ -571,7 +571,7 @@ t8_forest_leaf_face_orientation (t8_forest_t forest, const t8_locidx_t ltreeid,
  * \note Important! This routine allocates memory which must be freed. Do it like this:
  *
  *   if (num_neighbors > 0) {
- *     scheme->element_destroy (pneigh_eclass, num_neighbors, neighbors);
+ *     scheme->element_destroy (pneigh_eclass, num_neighbors, pneighbor_leaves);
  *     T8_FREE (pneighbor_leaves);
  *     T8_FREE (pelement_indices);
  *     T8_FREE (dual_faces);
@@ -613,7 +613,7 @@ t8_forest_leaf_face_neighbors (t8_forest_t forest, t8_locidx_t ltreeid, const t8
  * \note Important! This routine allocates memory which must be freed. Do it like this:
  *
  *   if (num_neighbors > 0) {
- *     scheme->element_destroy (pneigh_eclass, num_neighbors, neighbors);
+ *     scheme->element_destroy (pneigh_eclass, num_neighbors, pneighbor_leaves);
  *     T8_FREE (pneighbor_leaves);
  *     T8_FREE (pelement_indices);
  *     T8_FREE (dual_faces);
@@ -913,7 +913,7 @@ t8_forest_new_uniform (t8_cmesh_t cmesh, const t8_scheme_c *scheme, const int le
 /** Build a adapted forest from another forest.
  * \param [in]    forest_from The forest to refine
  * \param [in]    adapt_fn    Adapt function to use
- * \param [in]    recursive   If true adptation is recursive
+ * \param [in]    recursive   If true adaptation is recursive
  * \param [in]    do_face_ghost If true, a layer of ghost elements is created for the forest.
  * \param [in]    user_data   If not NULL, the user data pointer of the forest is set to this value.
  * \return        A new forest that is adapted from \a forest_from.

src/t8_forest/t8_forest_ghost.cxx

@@ -90,7 +90,7 @@ typedef struct
 } t8_ghost_remote_tree_t;
 
 /**
- * This struct stores information about the data that the current process needds from a specific remote_process
+ * This struct stores information about the data that the current process needs from a specific remote_process
  * as ghost data, such as the number of remote elements and the remote trees.
 */
 typedef struct

tutorials/general/t8_step5_element_data_c_interface.c

@@ -218,7 +218,7 @@ t8_step5_output_data_to_vtu (t8_forest_t forest, struct t8_step5_data_per_elemen
   }
   {
     /* To write user defined data, we need to extended output function t8_forest_vtk_write_file
-     * from t8_forest_vtk.h. Despite writin user data, it also offers more control over which 
+     * from t8_forest_vtk.h. Despite writing user data, it also offers more control over which 
      * properties of the forest to write. */
     int write_treeid = 1;
     int write_mpirank = 1;