aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
-rw-r--r--README4
-rw-r--r--libj2.74
-rw-r--r--libj2.h10
3 files changed, 9 insertions, 9 deletions
diff --git a/README b/README
index f54c47c..7f946c4 100644
--- a/README
+++ b/README
@@ -8,7 +8,7 @@ SYNOPSIS
DESCRIPTION
libj2 provides integer data types with double the width of uintmax_t,
- along with functions for preforming standard integer operations, with
+ along with functions for performing standard integer operations, with
optional overflow-detection.
libj2 provides the following value-assignment functions:
@@ -469,7 +469,7 @@ DESCRIPTION
libj2_j2u_mul_ju_overflow_p_quick(3),
libj2_ju_mul_j2u_overflow_p_quick(3)
Predict whether multiplying two values will result in an
- overflow, but do not preform the prediction if it is costly.
+ overflow, but do not perform the prediction if it is costly.
libj2_j2i_mul_j2i_to_j2i_overflow_p(3),
libj2_j2i_mul_ji_to_j2i_overflow_p(3),
diff --git a/libj2.7 b/libj2.7
index 2dfefee..89e90a9 100644
--- a/libj2.7
+++ b/libj2.7
@@ -14,7 +14,7 @@ Link with
.B libj2
provides integer data types with double the width of
.BR uintmax_t ,
-along with functions for preforming standard
+along with functions for performing standard
integer operations, with optional overflow-detection.
.PP
.B libj2
@@ -1079,7 +1079,7 @@ overflow.
.TQ
.BR libj2_ju_mul_j2u_overflow_p_quick (3)
Predict whether multiplying two values will result in an
-overflow, but do not preform the prediction if it is costly.
+overflow, but do not perform the prediction if it is costly.
.TP
.BR libj2_j2i_mul_j2i_to_j2i_overflow_p (3),
.TQ
diff --git a/libj2.h b/libj2.h
index 8097746..80dc9cb 100644
--- a/libj2.h
+++ b/libj2.h
@@ -83,7 +83,7 @@ struct libj2_j2u {
* libj2 does not implement bitwise operations,
* bit-scanning, or bit-rotation operations
* for this type, but a `struct libj2_j2i *`
- * can safetly be casted to `struct libj2_j2u *`
+ * can safely be cast to `struct libj2_j2u *`
* for such operators as well as the for
* unsigned bit shifting operations
*
@@ -110,7 +110,7 @@ struct libj2_j2i {
/**
* Arithmetic overflow prediction result
*
- * Use by some functions for which prediction
+ * Used by some functions for which prediction
* is costly in edge cases, and thus stopped
* as soon as such an edge case is detected
*
@@ -120,12 +120,12 @@ struct libj2_j2i {
*/
enum libj2_overflow {
/**
- * Where will not be an overflow
+ * There will be no overflow
*/
LIBJ2_NO_OVERFLOW = 0,
/**
- * Where will be a positive overflow
+ * There will be a positive overflow
*/
LIBJ2_POSITIVE_OVERFLOW = 1,
#define LIBJ2_OVERFLOW LIBJ2_POSITIVE_OVERFLOW
@@ -139,7 +139,7 @@ enum libj2_overflow {
#define LIBJ2_OVERFLOW_UNKNOWN LIBJ2_POSITIVE_OVERFLOW_UNKNOWN
/**
- * Where will be a positive overflow
+ * There will be a negative overflow
*/
LIBJ2_NEGATIVE_OVERFLOW = -1,