eliott/ladybird
1
0
Fork 0
mirror of https://github.com/LadybirdBrowser/ladybird synced 2026-04-30 11:37:16 +02:00
Code Issues Packages Projects Releases Wiki Activity

Everywhere: Fix many spelling errors

Browse Source
This commit is contained in:
mjz19910
2022-01-06 07:07:15 -07:00
committed by Linus Groh
parent 6bf91d00ef
commit 3102d8e160
Notes: sideshowbarker 2024-07-17 21:30:09 +09:00 
Author: https://github.com/mjz19910
Commit: https://github.com/SerenityOS/serenity/commit/3102d8e160b
Pull-request: https://github.com/SerenityOS/serenity/pull/11666
Reviewed-by: https://github.com/creator1creeper1
Reviewed-by: https://github.com/linusg ✅
39 changed files with 73 additions and 73 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
Userland/Libraries/LibCrypto/BigInt/Algorithms/ModularPower.cpp
View File

@@ -142,7 +142,7 @@ void UnsignedBigIntegerAlgorithms::almost_montgomery_multiplication_without_allo
UnsignedBigInteger::Word t = z.m_words[i] * k;
UnsignedBigInteger::Word carry_2 = montgomery_fragment(z, i, modulo, t, num_words);
// Compute the carry by combining all of the carrys of the previous computations
// Compute the carry by combining all of the carries of the previous computations
// Put it "right after" the range that we computed above
UnsignedBigInteger::Word temp_carry = previous_double_carry + carry_1;
UnsignedBigInteger::Word overall_carry = temp_carry + carry_2;