* If this set consists of exactly one element, we consider it to be
* the dominating one and return its corresponding index. Further, if the
* function is not able to find a finite element at all, it returns
- * numbers::invalid_unsigned_int.
+ * numbers::invalid_fe_index.
*
* For example, if a FECollection consists of
* `{FE_Q(1),FE_Q(2),FE_Q(3),FE_Q(4)}` elements and we are looking for the
* If this set consists of exactly one element, we consider it to be
* the dominated one and return its corresponding index. Further, if the
* function is not able to find a finite element at all, it returns
- * numbers::invalid_unsigned_int.
+ * numbers::invalid_fe_index.
*
* For example, if a FECollection consists of
* `{FE_Q(1),FE_Q(2),FE_Q(3),FE_Q(4)}` elements and we are looking for the
* If this set consists of exactly one element, we consider it to be
* the dominated one and return its corresponding index. Further, if the
* function is not able to find a finite element at all, it returns
- * numbers::invalid_unsigned_int.
+ * numbers::invalid_fe_index.
*
* The @p codim parameter describes the codimension of the investigated
* subspace and specifies that it is subject to this comparison. See
* If this set consists of exactly one element, we consider it to be
* the dominating one and return its corresponding index. Further, if the
* function is not able to find a finite element at all, it returns
- * numbers::invalid_unsigned_int.
+ * numbers::invalid_fe_index.
*
* The @p codim parameter describes the codimension of the investigated
* subspace and specifies that it is subject to this comparison. See