Skip to content

Commit c019d07

Browse files
committed
Fix some nits
1 parent f22d76e commit c019d07

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

ext/intl/grapheme/grapheme_string.c

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -965,7 +965,7 @@ PHP_FUNCTION(grapheme_levenshtein)
965965
UErrorCode ustatus2 = U_ZERO_ERROR;
966966

967967
/* When all costs are equal, levenshtein fulfills the requirements of a metric, which means
968-
* that the distance is symmetric. If string1 is shorter than string 2 we can save memory (and CPU time)
968+
* that the distance is symmetric. If string1 is shorter than string2 we can save memory (and CPU time)
969969
* by having shorter rows (p1 & p2). */
970970
if (ZSTR_LEN(string1) < ZSTR_LEN(string2) && cost_ins == cost_rep && cost_rep == cost_del) {
971971
zend_string *tmp = string1;
@@ -980,10 +980,10 @@ PHP_FUNCTION(grapheme_levenshtein)
980980

981981
if (U_FAILURE(ustatus1)) {
982982
/* Set global error code. */
983-
intl_error_set_code( NULL, ustatus1 );
983+
intl_error_set_code(NULL, ustatus1);
984984

985985
/* Set error messages. */
986-
intl_error_set_custom_msg( NULL, "Error converting input string to UTF-16", 0 );
986+
intl_error_set_custom_msg(NULL, "Error converting input string to UTF-16", 0);
987987
if (ustring1) {
988988
efree(ustring1);
989989
}
@@ -1048,7 +1048,7 @@ PHP_FUNCTION(grapheme_levenshtein)
10481048
int32_t pos1 = 0;
10491049
int32_t pos2 = 0;
10501050
int32_t usrch_pos = 0;
1051-
for (; pos1 != UBRK_DONE;) {
1051+
while (pos1 != UBRK_DONE) {
10521052
current1 = ubrk_current(bi1);
10531053
pos1 = ubrk_next(bi1);
10541054
if (pos1 == UBRK_DONE) {

0 commit comments

Comments
 (0)