diff options
| author | Kim SHrier <[email protected]> | 2023-05-07 03:24:10 -0600 |
|---|---|---|
| committer | Kim SHrier <[email protected]> | 2023-05-07 03:24:10 -0600 |
| commit | b10e47839843c836bb0ea98e6f29ad7b23678295 (patch) | |
| tree | 40d6458b3371ad17fd2e7c7aa62af7e547a906cd /exercises | |
| parent | a446d67992d6035cc6c1fba9d019e9d67f84a79c (diff) | |
| download | ziglings-b10e47839843c836bb0ea98e6f29ad7b23678295.tar.xz ziglings-b10e47839843c836bb0ea98e6f29ad7b23678295.zip | |
Improve wording in some comments
Diffstat (limited to 'exercises')
| -rw-r--r-- | exercises/098_bit_manipulation2.zig | 6 |
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'); } |
