@@ -133,7 +133,7 @@ order of letters to be a-zA-Z0-9.
133
133
maximum number of letters supported by :ref:`Letter<pseudo_letter_type_class>`.
134
134
135
135
.. seealso::
136
- * :any:`throw_if_alphabet_not_duplicate_free `
136
+ * :any:`throw_if_alphabet_has_duplicates `
137
137
* :any:`throw_if_bad_rules`
138
138
* :any:`throw_if_bad_alphabet_or_rules`
139
139
)pbdoc" );
@@ -292,16 +292,16 @@ position *i*.
292
292
R"pbdoc(
293
293
Check if the alphabet and rules are valid.
294
294
295
- :raises LibsemigroupsError: if :any:`throw_if_alphabet_not_duplicate_free ` or
295
+ :raises LibsemigroupsError: if :any:`throw_if_alphabet_has_duplicates ` or
296
296
:any:`throw_if_bad_rules` does.
297
297
298
298
:complexity: Worst case :math:`O(mnp)` where :math:`m` is the length of
299
299
length of the word, :math:`n` is the size of the alphabet and :math:`p` is
300
300
the number of rules.)pbdoc" );
301
301
thing.def (
302
- " throw_if_alphabet_not_duplicate_free " ,
302
+ " throw_if_alphabet_has_duplicates " ,
303
303
[](Presentation_ const & self) {
304
- return self.throw_if_alphabet_not_duplicate_free ();
304
+ return self.throw_if_alphabet_has_duplicates ();
305
305
},
306
306
R"pbdoc(
307
307
Check if the alphabet is valid.
@@ -1320,7 +1320,7 @@ Set the inverse of each letter in the alphabet.
1320
1320
1321
1321
.. seealso::
1322
1322
1323
- * :any:`PresentationStrings.throw_if_alphabet_not_duplicate_free `
1323
+ * :any:`PresentationStrings.throw_if_alphabet_has_duplicates `
1324
1324
* :any:`presentation.throw_if_bad_inverses`
1325
1325
1326
1326
)pbdoc" );
0 commit comments