[APInt] Fix typo in comment. NFC
gitsvnid: https://llvm.org/svn/llvmproject/llvm/trunk@302815 911773080d340410b5e696231b3b80d8
Craig Topper
3 years ago
1137  1137  return APInt(BitWidth, 0); 
1138  1138  
1139  1139  // The nexttolast t is the multiplicative inverse. However, we are 
1140 
// interested in a positive inverse. Calcu 

1140  // interested in a positive inverse. Calculate a positive one from a negative⏎  
1141  1141  // one if necessary. A simple addition of the modulo suffices because 
1142  1142  // abs(t[i]) is known to be less than *this/2 (see the link above). 
1143  1143  return t[i].isNegative() ? t[i] + modulo : t[i]; 