Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/t8_schemes/t8_scheme.cxx
Original file line number Diff line number Diff line change
Expand Up @@ -328,8 +328,8 @@ t8_element_get_last_descendant (const t8_scheme_c *scheme, const t8_eclass_t tre
}

void
t8_element_get_successor (const t8_scheme_c *scheme, const t8_eclass_t tree_class, const t8_element_t *elem1,
t8_element_t *elem2)
t8_element_construct_successor (const t8_scheme_c *scheme, const t8_eclass_t tree_class, const t8_element_t *elem1,
t8_element_t *elem2)
{
return scheme->element_construct_successor (tree_class, elem1, elem2);
}
Expand Down
4 changes: 2 additions & 2 deletions src/t8_schemes/t8_scheme.h
Original file line number Diff line number Diff line change
Expand Up @@ -639,8 +639,8 @@ t8_element_get_last_descendant (const t8_scheme_c *scheme, const t8_eclass_t tre
* \param [in,out] elem2 The element whose entries will be set.
*/
void
t8_element_get_successor (const t8_scheme_c *scheme, const t8_eclass_t tree_class, const t8_element_t *elem1,
t8_element_t *elem2);
t8_element_construct_successor (const t8_scheme_c *scheme, const t8_eclass_t tree_class, const t8_element_t *elem1,
t8_element_t *elem2);

/** Compute the coordinates of a given element vertex inside a reference tree
* that is embedded into [0,1]^d (d = dimension).
Expand Down
2 changes: 1 addition & 1 deletion src/t8_schemes/t8_scheme_helpers.hxx
Original file line number Diff line number Diff line change
Expand Up @@ -90,7 +90,7 @@ struct t8_scheme_helpers: public t8_crtp_basic<TUnderlyingEclassScheme>
// Allocate memory for a temporary element.
t8_element_t *parent;
underlying_impl.element_new (1, &parent);
// Pointer to a temoporary element, that will move up the refinement hierarchy
// Pointer to a temporary element, that will move up the refinement hierarchy
const t8_element_t *temp_element = element;
int temp_face = face;
for (int ilevel = element_level; ilevel > ancestor_level; --ilevel) {
Expand Down
Loading