summaryrefslogtreecommitdiff
path: root/exercises/098_bit_manipulation2.zig
diff options
context:
space:
mode:
authorChris Boesch <chrboesch@noreply.codeberg.org>2023-05-07 17:59:28 +0200
committerGitHub <noreply@github.com>2023-05-07 17:59:28 +0200
commit2cb6975b13d412b7e966debcd432a4f7a325addc (patch)
treed238aa4a8ab40326ed410c45d51a73f86537a026 /exercises/098_bit_manipulation2.zig
parentea93abf4d4a9fd408b3aa169806446eaa4e45a2d (diff)
parentded01c6adf111a03f6b627fdc4dc85b51c13da3a (diff)
Merge branch 'ratfactor:main' into testing
Diffstat (limited to 'exercises/098_bit_manipulation2.zig')
-rw-r--r--exercises/098_bit_manipulation2.zig6
1 files changed, 3 insertions, 3 deletions
diff --git a/exercises/098_bit_manipulation2.zig b/exercises/098_bit_manipulation2.zig
index d5ee825..9323548 100644
--- a/exercises/098_bit_manipulation2.zig
+++ b/exercises/098_bit_manipulation2.zig
@@ -39,7 +39,7 @@ fn isPangram(str: []const u8) bool {
// first we check if the string has at least 26 characters
if (str.len < 26) return false;
- // we uses a 32 bit variable of which we need 26 bit
+ // we uses a 32 bit variable of which we need 26 bits
var bits: u32 = 0;
// loop about all characters in the string
@@ -50,8 +50,8 @@ fn isPangram(str: []const u8) bool {
//
// to do this, we use a little trick:
// since the letters in the ASCI table start at 65
- // and are numbered by, we simply subtract the first
- // letter (in this case the 'a') from the character
+ // and are numbered sequentially, we simply subtract the
+ // first letter (in this case the 'a') from the character
// found, and thus get the position of the desired bit
bits |= @as(u32, 1) << @truncate(u5, ascii.toLower(c) - 'a');
}