Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Corrected English typos #291

Merged
merged 1 commit into from
Apr 10, 2024
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion src/math/ceil.rs
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@ pub fn ceil(x: f64) -> f64 {
{
//use an alternative implementation on x86, because the
//main implementation fails with the x87 FPU used by
//debian i386, probablly due to excess precision issues.
//debian i386, probably due to excess precision issues.
//basic implementation taken from https://github.com/rust-lang/libm/issues/219
use super::fabs;
if fabs(x).to_bits() < 4503599627370496.0_f64.to_bits() {
Expand Down
2 changes: 1 addition & 1 deletion src/math/floor.rs
Original file line number Diff line number Diff line change
Expand Up @@ -20,7 +20,7 @@ pub fn floor(x: f64) -> f64 {
{
//use an alternative implementation on x86, because the
//main implementation fails with the x87 FPU used by
//debian i386, probablly due to excess precision issues.
//debian i386, probably due to excess precision issues.
//basic implementation taken from https://github.com/rust-lang/libm/issues/219
use super::fabs;
if fabs(x).to_bits() < 4503599627370496.0_f64.to_bits() {
Expand Down
2 changes: 1 addition & 1 deletion src/math/pow.rs
Original file line number Diff line number Diff line change
Expand Up @@ -16,7 +16,7 @@
// 1. Compute and return log2(x) in two pieces:
// log2(x) = w1 + w2,
// where w1 has 53-24 = 29 bit trailing zeros.
// 2. Perform y*log2(x) = n+y' by simulating muti-precision
// 2. Perform y*log2(x) = n+y' by simulating multi-precision
// arithmetic, where |y'|<=0.5.
// 3. Return x**y = 2**n*exp(y'*log2)
//
Expand Down
2 changes: 1 addition & 1 deletion src/math/sqrt.rs
Original file line number Diff line number Diff line change
Expand Up @@ -96,7 +96,7 @@ pub fn sqrt(x: f64) -> f64 {
{
// Note: This path is unlikely since LLVM will usually have already
// optimized sqrt calls into hardware instructions if sse2 is available,
// but if someone does end up here they'll apprected the speed increase.
// but if someone does end up here they'll appreciate the speed increase.
#[cfg(target_arch = "x86")]
use core::arch::x86::*;
#[cfg(target_arch = "x86_64")]
Expand Down
2 changes: 1 addition & 1 deletion src/math/sqrtf.rs
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@ pub fn sqrtf(x: f32) -> f32 {
{
// Note: This path is unlikely since LLVM will usually have already
// optimized sqrt calls into hardware instructions if sse is available,
// but if someone does end up here they'll apprected the speed increase.
// but if someone does end up here they'll appreciate the speed increase.
#[cfg(target_arch = "x86")]
use core::arch::x86::*;
#[cfg(target_arch = "x86_64")]
Expand Down