summaryrefslogtreecommitdiff
path: root/strings
diff options
context:
space:
mode:
authorOtto Kekäläinen <otto@seravo.fi>2016-06-08 14:14:42 +0300
committerOtto Kekäläinen <otto@seravo.fi>2016-06-08 14:17:23 +0300
commiteffbe7dd7bdf4d27cb8764140a6d00c0b53af0b6 (patch)
tree7771bbdef76e31b77c0f1f2299b5f7256894cb9d /strings
parent9de6708390885415dc6737fcdb96a53ce565a7c2 (diff)
downloadmariadb-git-effbe7dd7bdf4d27cb8764140a6d00c0b53af0b6.tar.gz
General spell fixing in comments and strings
Diffstat (limited to 'strings')
-rw-r--r--strings/decimal.c4
-rw-r--r--strings/string.doc2
2 files changed, 3 insertions, 3 deletions
diff --git a/strings/decimal.c b/strings/decimal.c
index 74d456c9c9f..e64f7634a45 100644
--- a/strings/decimal.c
+++ b/strings/decimal.c
@@ -457,7 +457,7 @@ static void digits_bounds(decimal_t *from, int *start_result, int *end_result)
dec1 *end= from->buf + ROUND_UP(from->intg) + ROUND_UP(from->frac);
dec1 *buf_end= end - 1;
- /* find non-zero digit from number begining */
+ /* find non-zero digit from number beginning */
while (buf_beg < end && *buf_beg == 0)
buf_beg++;
@@ -468,7 +468,7 @@ static void digits_bounds(decimal_t *from, int *start_result, int *end_result)
return;
}
- /* find non-zero decimal digit from number begining */
+ /* find non-zero decimal digit from number beginning */
if (buf_beg == from->buf && from->intg)
{
start= DIG_PER_DEC1 - (i= ((from->intg-1) % DIG_PER_DEC1 + 1));
diff --git a/strings/string.doc b/strings/string.doc
index fcd020b8c60..3e5b607347a 100644
--- a/strings/string.doc
+++ b/strings/string.doc
@@ -41,7 +41,7 @@ Speciella användbara nya string-rutiner:
backwards from pos from. pat is not a regex(3) pattern, it is a literal
string which must be matched exactly.
The result 0 if the pattern was not found else it is the start char of
- the pattern counted from the begining of the string.
+ the pattern counted from the beginning of the string.
strappend(dest, len, fill) appends fill-characters to a string so that
the result length == len. If the string is longer than len it's